We identify different kinds of relevance relations between formulas that emerge in the process of belief revision. Informal definitions for alternative notions of relevance are suggested and a set of schemas and intuitive postulates for formalizing these notions are proposed.

Los agentes pueden definirse como componentes de software (programas) activos que perciben, razonan y se comunican a través de un protocolo predefinido. Muy generalmente, como en el caso de la World Wide Web, los agentes no son desarrollados en aislamiento…

The aim of this work is to relate two apparently independent concepts as belief revision and relevance. We propose a formal characterization for the notion of (ir)relevance by means of a set of postulates. Then we define (ir)relevance using change…

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…

The goal of this work involves the developing of an argumentation-based formalism that an agent could use for constructing plans. In this formalism, agents will have certain knowledge about the world, and a set of actions that they will be…

The design of intelligent agents is a key issue for many applications. Although there is no universally accepted de nition of intelligence, a notion of rational agency has been proposed as an alternative for the characterization of intelligent agency.
Modeling…

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…

The development of isolated agents involves the manipulation of components such as actions, mental attitudes and decisions. Multi-agent systems have to deal with these components from different agents, without to forget the privacy and autonomy of each agent. For programming…

Este trabalho mostra uma forma de pensar concorrente. São utilizados algoritmos de grafos, algoritmo do menor caminho, para mostrar desde a especificação até a implementação de algoritmos concorrentes. Objetiva-se mostrar uma outra forma de ensinar a concorrência, sua teoria, propriedades…

Artificial Intelligence has long dealt with the issue of finding a suitable formalization for reasoning with incomplete and potentially inconsistent information. Defeasible argumentation [SL92,CML00,PraVre99] has proven to be a successful approach in many respects, since it naturally resembles many aspects…