Formalisation and logical properties of the maximal ideal recursive semantics for weighted defeasible logic programming
MetadataShow full item record
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 undefeated by a warrant procedure that systematically explores the universe of arguments in order to present an exhaustive synthesis of the relevant chains of pros and cons for the given conclusion. Recently, we have proposed a new warrant recursive semantics for P-DeLP, called Recursive P-DeLP (RP-DeLP for short), based on the claim that the acceptance of an argument should imply also the acceptance of all its sub-arguments which reflect the different premises on which the argument is based. This paper explores the relationship between the exhaustive dialectical analysis-based semantics of P-DeLP and the recursive-based semantics of RP-DeLP, and analyses a non-monotonic inference operator for RP-DeLP which models the expansion of a given program by adding new weighted facts associated with warranted conclusions. Given the recursive-based semantics of RP-DeLP, we have also implemented an argumentation framework for RP-DeLP that is able to compute not only the output of warranted and blocked conclusions, but also explain the reasons behind the status of each conclusion. We have developed this framework as a stand-alone application with a simple text-based input/output interface to be able to use it as part of other artificial intelligence systems
Is part ofJournal of Experimental & Theoretical Artificial Intelligence, 2016, vol. 28, núm. 1-2, p. 275-294
European research projects
Showing items related by title, author, creator and subject.
Alsinet, Teresa; Béjar Torres, Ramón; Godo i Lacasa, Lluís; Guitart Bravo, Francesc (Oxford University Press, 2016)In this paper we first define a recursive semantics for warranted formulas in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. The recursive semantics ...
A logic programming framework for possibilistic argumentation: formalization and logical properties Alsinet, Teresa; Chesñevar, Carlos Iván; Godo i Lacasa, Lluís; Simari, Guillermo Ricardo (Elsevier, 2008)In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for ...
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification Alsinet, Teresa; Chesñevar, Carlos Iván; Godo i Lacasa, Lluís; Sandri, Sandra; Simari, Guillermo Ricardo (Elsevier, 2008)Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the ...