Buscar
Mostrando ítems 1-10 de 24
Ponencia
Looking for P Truth
(Fénix Editora, 2004)
In a general sense, Logic studies how to derive new pieces of in- formation from previous ones. In this paper we explore the analogies between P systems, where new configurations can be obtained from previous ones by using ...
Ponencia
Towards a Practical Argumentative Reasoning with Qualitative Spatial Databases
(Springer, 2003)
Classical database management can be flawed if the Knowledge database is built within a complex Knowledge Domain. We must then deal withinconsistencies and, in general, withanomalies of several types. In this paper we ...
Capítulo de Libro
Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem
(Springer, 2004)
In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division.
Ponencia
A methodology for the computer-aided cleaning of complex knowledge databases
(IEEE Computer Society, 2002)
In environments with complex cognitive structure (such as semantic web or sophisticated spatial databases for geographical information systems), classical methods for detecting anomalies can be inadequate. In this paper ...
Capítulo de Libro
Exploring Computation Trees Associated with P Systems
(Springer, 2005)
Usually, the evolution of a P system generates a computation tree too large to be efficiently handled with present–day computers; moreover, different branches in this tree may differ significantly from a computational ...
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 computational devices and therefore their computation trees are di±cult to store and handle with ...
Capítulo de Libro
A Linear Solution for QSAT with Membrane Creation
(Springer, 2006)
The usefulness of P systems with membrane creation for solving NP problems has been previously proved (see [2, 3]), but, up to now, it was an open problem whether such P systems were able to solve PSPACE-complete problems ...
Capítulo de Libro
On the Power of Dissolution in P Systems with Active Membranes
(Springer, 2006)
In this paper we study membrane dissolution rules in the framework of P systems with active membranes but without using electrical charges. More precisely, we prove that the polynomial computational complexity class ...
Ponencia
Solving SAT with membrane creation
(University of Amsterdam, 2005)
Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. In this paper we ...
Ponencia
Generalizing Programs via Subsumption
(Springer, 2003)
In this paper we present a class of operators for Machine Learning based on Logic Programming which represents a characterization of the subsumption relation in the following sense: The clause C 1 subsumes the clause C 2 ...