A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming

TERESA ALSINET,; CARLOS IVÁN CHESÑEVAR; LLUÍS GODO,

Computational Models of Argument

IOS Press

Lugar: Amsterdam, Holanda; Año: 2008; p. 1 - 12

Possibilistic Defeasible Logic Programming (Pdelp) is anargumentation framework based on logic programming whichincorporates a treatment of possibilistic uncertainty atobject-language level. In Pdelp, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in thecontext of so-called rationality postulates for rule-based argumentation systems.In this paper we present a novel level-based approach  to computingwarranted arguments in Pdelp which ensures the above rationality postulate.We also show that our solution presents some advantages in comparison with theuse of a transposition operator applied on strict rules.