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

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

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…

Little has been written about the component provision problem (programming plans and domain concepts) for the repositories of knowledge in program understanding systems and reports that specifically address this issue are unknown. Model-driven and plan-driven approaches use repositories where construction…

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…

Artificial Intelligence (AI) has long dealt with the issue of finding a suitable formalization for commonsense reasoning. Defeasible argumentation has proven to be a successful approach in many respects, proving to be a confluence point for many alternative logical frameworks.…

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…