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…

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…

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.

This article presents the confluence of two general ideas: Defeasible Logic Programming (DeLP, an argumentation based formalism for representing knowledge and reasoning) and Abduction in logic. In first place, we introduce a framework that formally states the problem of doing…

When using tableaux algorithms to reason about Description Logics (DLs), new information is inferred from the models considered while trying to achieve knowledge satisfiability. By focusing the ontology change problem, we consider an environment where DLs are the logical formalization…

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…

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 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…

In this paper, the two-dimensional strip packing problem with 3-stage level patterns is tackled using genetic algorithms (GAs). We evaluate the usefulness of a greedy seeding procedure for creating the initial population, incorporating problem knowledge. This is motivated by the…

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…