Buscar
Mostrando ítems 1-9 de 9
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 restricting the schemes of induction, minimization and (a version of) collection to Δ n+1 (T) formulas. ...
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 of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class ...
Artículo
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 represent and formally verify some algorithms of this theory. We also develop a method to transform ...
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. This representation allows us to express the set of rules and the configuration of the P system in ...
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 order to obtain some quantitative parameters showing how complex the evolution of a P system is. ...
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 provers. For that purpose, we develop a framework where we de ne a generic SAT-prover based on transformation ...