The theory change area have defined several operators trying to model the dynamic of knowledge. The goal of this work is to introduce a preprocessor of perceptions that could be part of an agent. The purpose of the preprocessor is…

Frequently we become amazed with the increasing number of problems to be solved that fiourish while facing daily activities. Often, related to these problems we llave also an incredible amount oí data. Since we cannot allways afford time and resources…

The notion of context and its importance in knowledge representation and nonmonotonic reasoning was first discussed in Artificial Intelligence by John McCarthy.
Ever since, contexts have found many applications in developing knowledge-based reasoning systems.
Defeasible argumentation has gained wide acceptance…

The problem of speeding up ínference has proved to be important in argumentative systems. When computing dialectical structures, several paths are searched (called argumentation lines), many of which will eventually prove useless. Morover, the performance of backward chainers degrades quickly…

The matrix connection method (MCM) is an alternative procedure for theorem proving than the usual resolution technique. We already have used the MCM for finding models in a real-time knowledge-based system generator. In this paper, we adapt the MCM to…

In this study we propose the standard modal logic KD43 as the logle governing expressions about Utopia. We define a formal construction corresponding to Utopian expressions In ordlnary language that we name utopian eonditionals.
They possess the singular properties of…

In the restricted single-machine common due date problem the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties, while for the weighted tardiness problem the goal is to find…

This paper presents a proposal for an architecture that integrates knowledge discovery systems (automatic acquisition) and knowledge based systems (experts systems). This work formulates considerations over the viability of the implementation of this architecture according to the advance of the…

The purpose of this paper is to describe how some theorems about constructions in categories can be seen as a way of doing generic programming. No prior knowledge of category theory is required to understand the paper.
We explore the…

In this work two declarative approaches based on the BDI theory are studied, an agent programming language 3APL and an agent architecture that uses defeasible argumentation for knowledge representation and reasoning. Based on that study and considering that in 3APL…