We have developed a distributed DSS able to work in a dynamic way. This system is based on the use of mobile agents, which receive the user's queries and visit the DSS domains gathering the required information. One of the…

Dentro del lenguaje de la Programación en Lógica tradicional, el operador de negación por falla "not" ha sido empleado tanto para representar información negativa como para proveer el fundamento básico de inferencias no monótonas.
En este trabajo se analiza este…

This study investigates an approach of knowledge discovery and data mining in insufficient databases. An application of Computational Taxonomy analysis demonstrates that the approach is effective in such a data mining process. The approach is characterized by the use ot…

In this article we will introduce certain considerations that must be taken into account while implementing the change operations of the belief change theory. The abstract models of bellief change make no considerations in respecto to the internal structures of…

Performance of parallel programs is one of the reasons of their development. The process of designing and programming a parallel application is a very hard task that requires the necessary knowledge for the detection of performance bottlenecks, and the corresponding…

Classical methods for representing and reasoning with knowledge rely on the assumption that the available information is complete, certain and consistent. In real-world problems this is usually not the case, and Al has long dealt with the issue of finding…

The notion of rational agency was proposed by Russell [9] as an alternative characterization of intelligence agency. Loosely speaking, an agent is said to be rational if it perfomns the right actions according to the information it possesses and the…

Implicitly exploitable parallelism for Logic Programming has received ample attention. Defeasible Argutmentation is specially apt for this optimizing technique. Defeasible Logic Programming (DLP), which is based on a defeasible argumentation formalism, could take full advantage of this type of parallel…

Current reasoning systems attempt to model an agent's knowledge and interaction with its environment in a symbolic manner. This environment, its world is generally dynamic and changing due to natural evolution or the actions of other agents that are a…

To find a good termination criterion for genetic algorithms is a difficult and frequently ignored task. In most instances the practitioner stops the algorittm after a predefined number of generations or function evaluations. How this number is established? This stop…