Relating defeasible and normal logic programming through transformation properties

This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEMDeLP to classical logic programming frameworks. In DeLP, we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals (∼A) in these rules are considered to represent classical negation. In contrast to this, in normal logic programming (NLP), there is only one kind of rules, but the meaning of negative literals (not A) is different: they represent a kind of negation as failure, and thereby introduce defeasibility. Various semantics have been defined for NLP, notably the well-founded semantics (WFS) (van Gelder et al., Proceedings of the Seventh Symposium on Principles of Database Systems, 1988, pp. 221-230; J. ACM 38 (3) (1991) 620) and the stable semantics Stable (Gelfond and Lifschitz, Fifth Conference on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080; Proceedings of the Seventh International Conference on Logical Programming, Jerusalem, MIT Press, Cambridge, MA, 1991, pp. 579-597).In this paper we consider the transformation properties for NLP introduced by Brass and Dix (J. Logic Programming 38(3) (1999) 167) and suitably adjusted for the DeLP framework. We show which transformation properties are satisfied, thereby identifying aspects in which NLP and DeLP differ. We contend that the transformation rules presented in this paper can help to gain a better understanding of the relationship of DeLP semantics with respect to more traditional logic programming approaches. As a byproduct, we obtain the result that DeLP is a proper extension of NLP.

[1]  Henry Prakken,et al.  Argument-Based Extended Logic Programming with Defeasible Priorities , 1997, J. Appl. Non Class. Logics.

[2]  Jürgen Ebert,et al.  GraX-an interchange format for reengineering tools , 1999, Sixth Working Conference on Reverse Engineering (Cat. No.PR00303).

[3]  Luís Moniz Pereira,et al.  Prolegomena to Logic Programming for Non-monotonic Reasoning , 1996, NMELP.

[4]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming , 1993, IJCAI.

[5]  Guillermo Ricardo Simari,et al.  A Mathematical Treatment of Defeasible Reasoning and its Implementation , 1992, Artif. Intell..

[6]  Burkhard Freitag,et al.  Transformation-Based Bottom-Up Computation of the Well-Founded Model , 1996, NMELP.

[7]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[8]  Andreas Winter,et al.  Querying as an enabling technology in software reengineering , 1999, Proceedings of the Third European Conference on Software Maintenance and Reengineering (Cat. No. PR00090).

[9]  Guillermo R. Simari,et al.  lntroducing generalized specificity in logic programming , 2000 .

[10]  Antonis C. Kakas,et al.  Computing Argumentation in Logic Programming , 1999, J. Log. Comput..

[11]  Frieder Stolzenburg,et al.  Loop-Detection in Hyper-Tableaux by Powerful Model Generation , 1999, J. Univers. Comput. Sci..

[12]  Oliver Obst,et al.  Towards a Logical Approach for Soccer Agents Engineering , 2000, RoboCup.

[13]  Nicholas Rescher,et al.  Dialectics: A Controversy-Oriented Approach to the Theory of Knowledge , 1977 .

[14]  Norbert Eisinger,et al.  A Confluent Connection Calculus , 2000, Intellectics and Computational Logic.

[15]  Guillermo Ricardo Simari.  Modeling Defeasibility in an Extended Logic Programming Setting Using an Abstract Argumentation Framework , 2002 .

[16]  Peter Baumgartner,et al.  Abductive Coreference by Model Construction , 1999 .

[17]  José Júlio Alferes,et al.  A logic programming system for nonmonotonic reasoning , 1995, Journal of Automated Reasoning.

[18]  Guillermo Ricardo Simari,et al.  An Argumentative Framework for Reasoning with Inconsistent and Incomplete Information , 2004 .

[19]  Phan Minh Dung,et al.  An Argumentation Semantics for Logic Programming with Explicit Negation , 1993, ICLP.

[20]  Peter Baumgartner,et al.  The Taming of the (X)OR , 2000, Computational Logic.

[21]  Henry Prakken,et al.  Logics for Defeasible Argumentation , 2001 .

[22]  Manfred Rosendahl,et al.  Specification of Symbols and Implementation of Their Constraints in JKogge , 2000 .

[23]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[24]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[25]  Jens Woch,et al.  Implementation of a Schema-TAG-Parser , 1999 .

[26]  Stephan Philippi,et al.  Modelling a concurrent ray-tracing algorithm using object-oriented Petri-Nets , 2001 .

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

[28]  John L. Pollock,et al.  Defeasible Reasoning , 2020, Synthese Library.

[29]  Jürgen Dix,et al.  Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated Gcwa , 1997 .

[30]  Phan Minh Dung,et al.  An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..

[31]  Andy Schürr,et al.  GXL: toward a standard exchange format , 2000, Proceedings Seventh Working Conference on Reverse Engineering.

[32]  Guillermo R. Simari,et al.  The Role of Dialectics in Defeasible Argumentation , 1994 .

[33]  Jürgen Dix,et al.  A Framework to Incorporate Non-Monotonic Reasoning Into Constraint Logic Programming , 1998, J. Log. Program..

[34]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[35]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[36]  Ulrich Furbach,et al.  Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.

[37]  Jürgen Dix,et al.  Super logic programs , 2000, TOCL.

[38]  Gerard Vreeswijk,et al.  Defeasible Dialectics: A Controversy-Oriented Approach Towards Defeasible Argumentation , 1993, J. Log. Comput..

[39]  Jürgen Ebert,et al.  A Formalization of SOCCA , 1999 .

[40]  Jürgen Dix,et al.  Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..

[41]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[42]  Donald Nute,et al.  Defeasible Logic , 1994, INAP.

[43]  Oliver Obst,et al.  Spatial Agents Implemented in a Logical Expressible Language , 1999, RoboCup.

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

[45]  Joseph Douglas Horton,et al.  Merge Path Improvements for Minimal Model Hyper Tableaux , 1999, TABLEAUX.

[46]  Guillermo Ricardo Simari,et al.  Automating Defeasible Reasoning with Logic Programming (DeReLoP) , 1999 .

[47]  Jürgen Dix,et al.  A general theory of confluent rewriting systems for logic programming and its applications , 2001, Ann. Pure Appl. Log..

[48]  Jürgen Dix,et al.  Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.

[49]  Jürgen Dix,et al.  Characterizations of the Disjunctive Stable Semantics by Partial Evaluation , 1997, J. Log. Program..