Listar Artículos (Ciencias de la Computación e Inteligencia Artificial) por fecha de publicación
Mostrando ítems 21-40 de 355
-
Ponencia
A Formal Proof of Dickson’s Lemma in ACL2
(Springer, 2003)Dickson’s Lemma is the main result needed to prove the termination of Buchberger’s algorithm for computing Gr¨obner basis ...
-
Artículo
Induction, minimization and collection for Δ n+1 (T)–formulas
(Springer, 2004)For a theory T, we study relationships among IΔ n +1 (T), LΔ n+1 (T) and B * Δ n+1 (T). These theories are obtained ...
-
Artículo
Modelos de computación celular con membranas
(SEMA, 2004) -
Artículo
On the quantifier complexity of Δ n+1 (T)– induction
(Springer, 2004)In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity ...
-
Artículo
Deductive databases and P systems
(2004) -
Artículo
Verification of the Formal Concept Analysis
(Real Academia de Ciencias, 2004)This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to ...
-
Artículo
A Prolog Simulator for Deterministic P Systems with Active Membranes
(Springer, 2004)In this paper we propose a new way to represent P systems with active membranes based on Logic Programming techniques. ...
-
Artículo
An Efficient Family of P Systems for Packing Items into Bins
(Graz University of Technology, Institut für Informationssysteme und Computer Medie, 2004) -
Artículo
A Note on Complexity Measures for Probabilistic P Systems
(J.UCS.org, 2004)In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in ...
-
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 ...
-
Artículo
Symport/Antiport P Systems with Three Objects Are Universal
(IOS Press, 2005)The operations of symport and antiport, directly inspired from biology, are already known to be rather powerful when used ...
-
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 ...
-
Artículo
Tissue P systems with channel states
(Elsevier, 2005)We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling ...
-
Artículo
Solving the Subset-Sum Problem by P Systems with Active Membranes
(Springer, 2005)We present the first membrance computing solution to the Subset-Sum problem using a family of deterministic P systems with ...
-
Artículo
A fast P system for finding a balanced 2-partition
(Springer, 2005)Numerical problems are not very frequently addressed in the P systems literature. In this paper we present an effective ...
-
Artículo
Computational efficiency of dissolution rules in membrane systems
(Taylor and Francis, 2006)Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient to efficiently solve ...
-
Artículo
Spike Trains in Spiking Neural P Systems
(World Scientific, 2006)We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate ...
-
Capítulo de Libro
Computationally Hard Problems Addressed Through P Systems
(Springer, 2006)In this chapter we present a general framework to provide efficient solutions to decision problems through families of ...
-
Capítulo de Libro
Available Membrane Computing Software
(Springer, 2006)The simulation of a P system with current computers is a quite com-plex task. P systems are intrinsically nondeterministic ...
-
Artículo
Bounding the Indegree of Spiking Neural P Systems
(Turku Center for Computer Science, 2006)We continue the search of normal forms for spiking neural P systems, and we prove that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness.