Buscar
Mostrando ítems 61-70 de 78
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 ...
Artículo
Dialogue Moves for Natural Command Languages
(Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
Artículo
P Systems Computing the Period of Irreducible Markov Chains
(Agora University of Oradea, 2009)
It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the se- quence of distributions at time n converges to the stationary ...
Artículo
Efficient execution in an automated reasoning environment
(Cambridge University Press, 2008)
We describe a method that permits the user of a mechanized mathematical logic to write elegant logical definitions while allowing sound and efficient execution. In particular, the features supporting this method allow ...
Artículo
Modular Assembly of Cell Systems Biology Models Using P Systems
(World Scientific, 2009)
In this paper we propose an extension of the modelling framework based on P systems which explicitly includes modularity. Modularisation in cellular systems can be produced by chemical specificity and spatial localisation ...
Artículo
Modelado de diálogo basado en conocimiento, acciones y expectativas
(Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2002)
Este trabajo propone un modelo declarativo para el modelado de sistemas de gestión de diálogo. La estrategia propuesta se basa en una división funcional del sistema de gestión en cuatro niveles: especificación, interfaz ...
Artículo
Uniform solutions to SAT and Subset Sum by spiking neural P systems
(Springer, 2009)
We continue the investigations concerning the possibility of using spiking neural P systems as a framework for solving computationally hard problems, addressing two problems which were already recently considered in this ...
Artículo
Towards Maude 2.0
(Elsevier, 2000)
Maude 2.0 is the new version of the Maude rewriting logic language currently under development. Maude 2.0’s three main goals are: (i) greater generality and expressiveness;( ii) efficient support for a wider range of ...
Artículo
Spiking neural P systems with extended rules: universality and languages
(Springer, 2008)
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous ...
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 solution to the 2-Partition problem via a family of deterministic P systems with active membranes ...