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…

In the last years there has been an increasing demand of a variety of logical systems, prompted
mostly by applications of logic in AI, logic programming and other related areas. Labeled Deductive
Systems (LDS) were developed as a °exible methodology…

This paper summarizes the main results developed in the author's PhD Thesis.
The main goal of the Thesis is to provide a formalization of defeasible argumentation oriented towards its computational treatment. In order to do this, an LDS-based logical framework…

A re-design process implies dealing with complex interactions between stakeholders, especially if we are talking about a personalization re-engineered process, which can be applied to an existing web application. In this context, knowledge becomes a main factor of influence, but…

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…

The Semantic Web purports to give computeraccessible meaning to the content of the World Wide Web. The rationale behind this project is to create an environment where all this information could be freely exchanged among diverse entities, yet retaining its…

Defeasible Logic Programming (DeLP) is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information.
Within the field of Logic Programming, most of the implementations of Prolog…

We discuss how data mining, patternbases and databases can be integrated into inductive databases, which make data mining an inductive query process. We propose a software architecture for such inductive databases, and extend this architecture to support the clustering of…