Diego R. García

Defeasible reasoning and partial order planning

Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This problem affects every aspect of a planning process. We will present an argumentation-based formalism that an agent could use for constructing plans starting from a previously introduced formalism. In such a formalism, agents represent their knowledge about their environment in Defeasible Logic Programming, and have a set of actions they can execute to affect their environment. These actions are defined in combination with a defeasible argumentation formalism. We will analyze the interplay of arguments and actions when constructing plans using Partial Order Planning techniques.

Planning and defeasible reasoning

We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to construct plans using Partial Order Planning techniques.

On influence and contractions in defeasible logic programming

In this paper, we investigate the problem of contraction in Defeasible Logic Programming (DeLP), a logic-based approach for defeasible argumentation.We develop different notions of contraction based on both, the different forms of entailment implicitly existent in argumentation-based formalisms and the influence literals exhibit in the reasoning process. We give translations of widely accepted rationality postulates for belief contraction to our framework. Moreover we discuss on the applicability of contraction for defeasible argumentation and the role of influence in this matter.