Abstract:

Recent research has identified the notion of \emph{indirect consistency} as a rationality postulate that every rule-based argumentation frameworks should satisfy. Possibilistic Defeasible Logic Programming (P-DeLP) 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 \Pdelp which ensures the above rationality postulate and we describe a procedure to effectively compute them.

• Tagged
• XML
• BibTex