Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical viewpoint, capturing defeasible inference relationships for modelling argument and warrant is particularly important, as well as the study of their logical properties. This paper analyzes two non-monotonic operators for P-DeLP which model the expansion of a given program $\mathcal{P}$ by adding new weighed facts associated with argument conclusions and warranted literals, resp. Different logical properties for the proposed expansion operators are studied and contrasted with a traditional SLD-based Horn logic. We will show that this analysis provides useful comparison criteria that can be extended and applied to other argumentation frameworks.

[1]  Teresa Alsinet,et al.  A Complete Calcultis for Possibilistic Logic Programming with Fuzzy Propositional Variables , 2000, UAI.

[2]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[3]  Ana Gabriela Maguitman,et al.  Logical models of argument , 2000, CSUR.

[4]  H. Prade,et al.  Possibilistic logic , 1994 .

[5]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

[6]  Claudette Cayrol,et al.  Inferring from Inconsistency in Preference-Based Argumentation Frameworks , 2002, Journal of Automated Reasoning.

[7]  Richard A. Villa,et al.  Inclusion , 2000, Late Self-Portraits.

[8]  Didier Dubois,et al.  The Possibilistic Handling of Irrelevance in Exception-Tolerant Reasoning , 2004, Annals of Mathematics and Artificial Intelligence.

[9]  Leila Amgoud,et al.  A Formal Framework for Handling Conflicting Desires , 2003, ECSQARU.

[10]  David Makinson,et al.  General patterns in nonmonotonic reasoning , 1994 .

[11]  Guillermo Ricardo Simari,et al.  A Logic Programming Framework for Possibilistic Argumentation with Vague Knowledge , 2004, UAI.

[12]  Didier Dubois,et al.  Timed possibilistic logic , 1991, Fundam. Informaticae.

[13]  Teresa Alsinet,et al.  A Proof Procedure for Possibilistic Logic Programming with Fuzzy Constants , 2001, ECSQARU.

[14]  Guillermo Ricardo Simari,et al.  A first approach to argument-based recommender systems based on defeasible logic programming , 2004, NMR.

[15]  Ana Gabriela Maguitman,et al.  An Argumentative Approach to Assessing Natural Language Usage based on the Web Corpus , 2004, ECAI.

[16]  Didier Dubois,et al.  Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study Part 1: The Flat Case , 1997, Stud Logica.

[17]  Dov M. Gabbay,et al.  Nonmonotonic reasoning and uncertain reasoning , 1994 .

[18]  Didier Dubois,et al.  Argumentative inference in uncertain and inconsistent knowledge bases , 1993, UAI.

[19]  G. Brewka.  Principles of Knowledge Representation , 1996 .

[20]  Dov M. Gabbay,et al.  Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning , 1994 .