Computation of skeptical outputs in P-DeLP satisfying indirect consistency: a level-based approach

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

Málaga, España

Conferencia; 12th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2008); 2008

Recent research has identified the notion of indirect consistency as a rationality postulate that every rule-based argumentation frameworks should satisfy. Possibilistic Defeasible Logic Programming (PDeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at objectlanguage level, in which indirect consistency does not hold. In this paper we introduce a novel approach to computing warranted arguments in P-DeLP which ensures the above rationality postulate.