Listar Ciencias de la Computación e Inteligencia Artificial por título
Mostrando ítems 351-370 de 880
-
Artículo
Formal proofs about rewriting using ACL2
(Springer, 2002)We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We describe the formalization ...
-
Ponencia
Formal Reasoning about Efficient Data Structures: A Case Study in ACL2
(Springer, 2003)We describe in this paper the formal verification, using the ACL2 system, of a syntactic unification algorithm where terms ...
-
Artículo
Formal verification of a generic framework to synthesize SAT-provers
(Springer, 2004)We present in this paper an application of the ACL2 system to generate and reason about propositional satis ability ...
-
Ponencia
Formal Verification of Molecular Computational Models in ACL2: A Case Study
(Springer, 2003)Theorem proving is a classical AI problem with a broad range of applications. Since its complexity is exponential in the ...
-
Ponencia
Formal Verification of P Systems with Active Membranes through Model Checking
(Springer, 2011)Formal verification of P systems using model checking has attracted a significant amount of research in recent years. ...
-
Capítulo de Libro
Formal Verification of Programs in Molecular Models with Random Access Memory
(Fénix Editorial, 2005)Formal verification of molecular programs is a first step towards their automatic processing by means of reasoning ...
-
Tesis Doctoral
Formalización en Isar de la metalógica de primer orden
(2012-06-12)El objetivo del trabajo es formalizar razonamiento complejo de forma legible por los humanos y procesable por las máquinas. ...
-
Artículo
Formalization of a normalization theorem in simplicial topology
(Springer, 2012)In this paper we present a complete formalization of the Normalization Theorem, a result in Algebraic Simplicial Topology ...
-
Ponencia
Formalizing Rewriting in the ACL2 Theorem Prover
(Springer, 2000)We present an application of the ACL2 theorem prover to formalize and reason about rewrite systems theory. This can be ...
-
Artículo
Formally Verified Tableau-Based Reasoners for a Description Logic
(Springer, 2014)Description Logics are a family of logics used to represent and reason about conceptual and terminological knowledge. One ...
-
Ponencia
Forward and Backward Chaining with P Systems
(Fénix Editora, 2011)On the one hand, one of the concepts which lies at the basis of membrane computing is the multiset rewriting rule. On the ...
-
Artículo
Foundational Challenges in Automated Data and Ontology Cleaning in the Semantic Web
(IEEE Computer Society, 2006)The application of automated reasoning systems to data cleaning in the Semantic Web raises many challenges on the ...
-
Ponencia
Four (Somewhat Nonstandard) Research Topics
(Fénix Editora, 2014)Four research directions are suggested, dealing with the following four main ideas: computing along the axon (up to now, ...
-
Ponencia
FPGA Implementation of Robot Obstacle Avoidance Controller based on Enzymatic Numerical P Systems
(IMCS: International Membrane Computing Society, 2019)It is a long-cherished wish to implement numerical P systems (NPS) on a parallel architecture so that its large scale ...
-
Ponencia
Fractals and P Systems
(Fénix Editora, 2006)In this paper we show that the massive parallelism, the synchronous appli- cation of the rules, and the discrete nature ...
-
Artículo
Fragments of Arithmetic and true sentences
(Wiley, 2005)By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is ...
-
Ponencia
Un Framework para Big Data Optimization Basado en jMetal y Spark
(Universidad de Salamanca, 2016)Las metaheur sticas multi-objetivo se han convertido en t ecnicas muy utilizadas para la resoluci on problemas complejos ...
-
Artículo
From distribution to replication in cooperative systems with active membranes: A frontier of the efficiency
(Elsevier, 2018)P systems with active membranes use evolution, communication, dissolution and division(or separation) rules. They do not ...
-
Artículo
From fault detection to one-class severity discrimination of 3D printers with one-class support vector machine
(Elsevier, 2021)The lack of faulty condition data reduces the feasibility of supervised learning for fault detection or fault severity ...
-
Artículo
From NP-Completeness to DP-Completeness: A Membrane Computing Perspective
(Hindawi, 2020)Presumably efficient computing models are characterized by their capability to provide polynomial-time solutions for ...