Maximal Ideal Recursive Semantics for Defeasible Argumentation
نویسندگان
چکیده
In [1] a recursive warrant semantics for Defeasible Logic Programming extended with levels of possibilistic uncertainty for defeasible rules was introduced. The resulting argumentation framework, called RP-DeLP, is based on a general notion of collective (non-binary) conflict among arguments allowing to ensure direct and indirect consistency properties with respect to the strict knowledge. An output of a RP-DeLP program is a pair of sets of warranted and blocked conclusions (literals), all of them recursively based on warranted conclusions but, while warranted conclusions do not generate any conflict, blocked conclusions do. A RP-DeLP program may have multiple outputs in case of circular definitions of conflicts among arguments. In this paper we tackle to the problem of which output one should consider for a RP-DeLP program with multiple outputs. To this end we define the maximal ideal output of a RP-DeLP program as the set of conclusions which are ultimately warranted and we present an algorithm for computing them in polynomial space and with an upper bound on complexity equal to P .
منابع مشابه
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
In this article, we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main cha...
متن کاملFormalization and logical properties of the Maximal Ideal Recursive Semantics for Weighted Defeasible Logic Programming
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming framework which combines features from argumentation theory and logic programming, in which defeasible rules are attached with weights expressing their relative belief or preference strength. In P-DeLP a conclusion succeeds if there exists an argument that entails the conclusion and this argument is found to be undefeate...
متن کاملRP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics
In this paper we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (nonbinary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main charact...
متن کاملRP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics
In this paper we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (nonbinary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main charact...
متن کامل