Listar Ponencias (Ciencias de la Computación e Inteligencia Artificial) por fecha de publicación
Mostrando ítems 21-40 de 442
-
Ponencia
A Quasi-Metric for Machine Learning
(Springer, 2002)The subsumption relation is crucial in the Machine Learning systems based on a clausal representation. In this paper we ...
-
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 ...
-
Ponencia
Complexity Classes in Cellular Computing with Membranes
(2003)In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polynomial time by a family of P systems belonging to a prefixed class of recognizer membrane systems, F.
-
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 ...
-
Ponencia
An Agent Based Approach of Collective Foraging
(Springer, 2003)In this paper the behaviour of a bee colony is modeled as a society of communicating agents acting in parallel and ...
-
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 ...
-
Capítulo de Libro
Hybrid Networks of Evolutionary Processors
(Springer, 2003)A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph ...
-
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
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 ...
-
Ponencia
P Systems with Tables of Rules
(Fénix Editora, 2004)In the last time, several e®orts were made in order to remove the polarization of membranes from P systems with active ...
-
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 ...
-
Ponencia
Tissue P Systems with Cell Division
(Fénix Editora, 2004)In tissue P systems several cells (elementary membranes) commu- nicate through symport/antiport rules, thus carrying out ...
-
Ponencia
A CLIPS Simulator for Recognizer P Systems with Active Membranes
(Fénix Editora, 2004)In this paper we propose a new way to represent recognizer P systems with active membranes based on Production Systems ...
-
Ponencia
Simulating Shuffle-Exchange Networks with P Systems
(Fénix Editora, 2004)We present in this paper a simulation with P systems of the parallel architecture known as shuffle-exchange network. This ...
-
Ponencia
Approximating Non-discrete P Systems
(Springer, 2004)The main goal of this paper is to propose some geometric approaches to the computations of non-discrete P systems. The ...
-
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 Java Simulator for Basic Transition P Systems
(Fénix Editora, 2004)In this paper, a software tool (called SimCM, from Spanish Sim- ulador de Computaci¶on con Membranas) for handling P ...
-
Ponencia
A Note on Complexity Measures for Probabilistic P Systems
(Fénix Editora, 2004)In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in ...
-
Ponencia
Towards a tool for ontology engineering
(IEEE Computer Society, 2004)A tool based on a spatial representation of provisional ontologies is designed. The tool allows the cleming of Knowledge Bases, aa well to induce new concepts in early steps of the building of an ontology.
-
Ponencia
Provably Total Primitive Recursive Functions: Theories with Induction
(Springer, 2004)A natural example of a function algebra is R (T), the class of provably total computable functions (p.t.c.f.) of a theory ...