Alejandro Javier García

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

Computing Generalized Specificity

q

The Added Value of Argumentation

will succeed when there is an argument

Introduction to structured argumentation

{\mathcal A}

An argumentative reasoning service for deliberative agents

for

Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers

q

Defeasible reasoning and partial order planning

that is warranted, i.e. the argument

Data mining applied to the cognitive rehabilitation of patients with acquired brain injury

{\mathcal A}

A survey of different approaches to support in argumentation systems

that supports

Formalizing dialectical explanation support for argument-based reasoning in knowledge-based systems

q