PROCEEDINGS IPMU '08
Computation of skeptical outputs in P-DeLP satisfying indirect consistency: a level-based approach
Teresa Alsinet, Carlos I. Chesñevar, Lluís Godo
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 object-language
level, in which indirect consistency
does not hold. In this paper
we consider a novel approach to
computing warranted arguments in
P-DeLP which ensures the above rationality
postulate and we describe
a procedure to effectively compute
them.
 | PDF full paper |