A Unifying View for Logic Programming with Non-Monotonic Reasoning

Abstract We provide a simple formulation of a framework where some extensions of logic programming with non-monotonic reasoning are treated uniformly, namely, two kinds of negation and abduction. The resulting semantics is purely model-theoretic, and gives meaning to any noncontradictory abductive logic program. Moreover, it embeds and generalizes some existing semantics which deal with negation and abduction. The framework is equipped with a correct top-down proof procedure.

[1]  Frank Teusink,et al.  A Proof Procedure for Extended Logic Programs , 1993, ILPS.

[2]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[3]  Philip T. Cox,et al.  Causes for Events: Their Computation and Applications , 1986, CADE.

[4]  Chandrabose Aravindan,et al.  On the Correctness of Unfold/Fold Transformation of Normal and Extended Logic Programs , 1995, J. Log. Program..

[5]  Luís Moniz Pereira,et al.  Abduction over 3-Valued Extended Logic Programs , 1995, International Conference on Logic Programming and Non-Monotonic Reasoning.

[6]  Francesca Toni,et al.  An Assumption-Based Framework for Non-Monotonic Reasoning , 1993, LPNMR.

[7]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[8]  Danny De Schreye,et al.  SLDNFA: An Abductive Procedure for Normal Abductive Programs , 1992, JICSLP.

[9]  Robert A. Kowalski,et al.  A Theorem-Proving Approach to Database Integrity , 1988, Foundations of Deductive Databases and Logic Programming..

[10]  Evelina Lamma,et al.  Normal logic programs as open positive programs , 1992, CNKBS.

[11]  José Júlio Alferes,et al.  Contradiction Removal Semantics with Explicit Negation , 1992, Logic at Work.

[12]  Evelina Lamma,et al.  Modularity in Logic Programming , 1994, J. Log. Program..

[13]  Paolo Mancarella,et al.  An Algebra of Logic Programs , 1988, ICLP/SLP.

[14]  Michael J. Maher.  Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[15]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[16]  Antonio Brogi,et al.  Fully Abstract Composition Semantics for an Algebra of Logic Programs , 1995, Theor. Comput. Sci..

[17]  Robert A. Kowalski,et al.  Problems and Promises of Computational Logic , 1990 .

[18]  José Júlio Alferes,et al.  Contradiction: When Avoidance Equals Removal - Part II , 1993, ELP.

[19]  José Júlio Alferes,et al.  Derivation Procedures for Extended Stable Models , 1991, IJCAI.

[20]  José Júlio Alferes,et al.  Contradiction: When Avoidance Equals Removal - Part I , 1993, ELP.

[21]  William L. Rodi,et al.  Belief Revision and Paraconsistency in a Logic Programming Framework , 1991, International Conference on Logic Programming and Non-Monotonic Reasoning.

[22]  Paolo Mancarella,et al.  Stable Theories for Logic Programs , 1991, ISLP.

[23]  Li-Yan Yuan,et al.  On the Equivalence of Semantics for Normal Logic Programs , 1995, J. Log. Program..

[24]  Phan Minh Dung,et al.  Well-Founded Reasoning with Classical Negation , 1991, LPNMR.

[25]  Hans Rott,et al.  Logic, Action and Information , 1996 .

[26]  José Júlio Alferes,et al.  Scenario Semantics of Extended Logic Programs , 1993, LPNMR.

[27]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[28]  Gerhard Brewka.  An Abductive Framework for Generalized Logic Programs , 1993, LPNMR.

[29]  Paolo Mancarella,et al.  Short Note: Preferred Extensions are Partial Stable Models , 1992, J. Log. Program..

[30]  Chris Evans,et al.  Negation-as-failure as an approach to the Hanks-McDermott problem , 1989 .

[31]  José Júlio Alferes,et al.  Optative Reasoning with Scenario Semantics , 1993, ICLP.

[32]  Maurizio Gabbrielli,et al.  Contributions to the Semantics of Open Logic Programs , 1992, FGCS.

[33]  Phan Minh Dung,et al.  Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.

[34]  Chiaki Sakama,et al.  Extended Well-Founded Semantics for Paraconsistent Logic Programs , 1992, FGCS.

[35]  José Júlio Alferes,et al.  Debugging by Diagnosing Assumptions , 1993, AADEBUG.

[36]  Ken Satoh,et al.  A Query Evaluation Method for Abductive Logic Programming , 1992, Joint International Conference and Symposium on Logic Programming.

[37]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[38]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

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

[40]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[41]  Zbigniew W. Ras,et al.  Methodologies for Intelligent Systems , 1991, Lecture Notes in Computer Science.

[42]  Kurt Konolige,et al.  An Abductive Framework for General Logic Programs and other Nonmonotonic Systems , 1993, IJCAI.

[43]  José Júlio Alferes,et al.  Top-Down Query Evaluation for Well-Founded Semantics with Explicit Negation , 1994, ECAI.

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

[45]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[46]  Paolo Mancarella,et al.  Generalized Stable Models: A Semantics for Abduction , 1990, ECAI.

[47]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

[48]  Teodor C. Przymusinski.  Semantics of Disjunctive Logic Programs and Deductive Databases , 1991, DOOD.

[49]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[50]  José Júlio Alferes,et al.  Well Founded Semantics for Logic Programs with Explicit Negation , 1992, ECAI.

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

[52]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

[53]  José Júlio Alferes,et al.  On Logic Program Semantics with Two Kinds of Negation , 1992, JICSLP.

[54]  Evelina Lamma,et al.  An Abductive Framework for Extended Logic Programming , 1995, LPNMR.

[55]  José Júlio Alferes,et al.  SLX - A Top-down Derivation Procedure for Programs with Explicit Negation , 1994, ILPS.

[56]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[57]  Jürgen Dix,et al.  Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview , 1996, Logic, Action, and Information.

[58]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[59]  Danny De Schreye,et al.  Representing Incomplete Knowledge in Abductive Logic Programming , 1993, J. Log. Comput..

[60]  José Júlio Alferes,et al.  Contradiction Removal within Well Founded Semantics , 1991, LPNMR.

[61]  José Júlio Alferes,et al.  Non-Monotonic Reasoning with Logic Programming , 1993, J. Log. Program..