Guillermo Ricardo Simari

Defeasible logic programming: an argumentative approach

The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation inference mechanism for warranting the entailed conclusions. In DeLP an argumentation formalism will be used for deciding between contradictory goals. Queries will be supported by arguments that could be defeated by other arguments. A query

Towards an argument interchange format

q

Computing Generalized Specificity

will succeed when there is an argument

Argumentation and the Dynamics of Warranted Beliefs in Changing Environments

{mathcal A}

Explanations, belief revision and defeasible reasoning

for

Relating defeasible and normal logic programming through transformation properties

q

Argument-based critics and recommenders: a qualitative perspective on user support systems

that is warranted, i.e. the argument

Computing dialectical trees efficiently in possibilistic defeasible logic programming

{mathcal A}

An argumentative reasoning service for deliberative agents

that supports

Review: on the evolving relation between belief revision and argumentation

q