Negation in Logic Programming

A survey of treatments of negation in logic programming. The following aspects are discussed: elimination of negation by renaming, definite Horn programs and queries, the relation between the closed world assumption and the completed data base, and their relation to negation as failure, negation as failure for definite Horn programs, special classes of program for which negation as failure coincides with classical negation applied to the completed data base or closed world assumption, semantics for negation in terms of special classes of models, semantics for negation as failure in terms of 3-valued logic.

[1]  Bernard Meltzer.  Theorem-Proving for Computers: Some Results on Resolution and Renaming , 1966, Comput. J..

[2]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[3]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[5]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[6]  Paul J. Voda.  Choices in, and Limitations of, Logic Programming , 1986, ICLP.

[7]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[8]  John C. Shepherdson,et al.  Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..

[9]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[10]  John C. Shepherdson,et al.  Negation as Failure II , 1985, J. Log. Program..

[11]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[12]  Howard A. Blair.  The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language , 1982, Inf. Control..

[13]  Harry R. Lewis,et al.  Renaming a Set of Clauses as a Horn Set , 1978, JACM.

[14]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[15]  Michael J. Maher,et al.  Comments on "General Failure of Logic Programs" , 1986, J. Log. Program..

[16]  Michael J. Maher,et al.  Closures and Fairness in the Semantics of Programming Logic , 1984, Theor. Comput. Sci..

[17]  H. Ebbinghaus,et al.  Über Eine Prädikatenlogik mit Partiell Definierten Prädikaten und Funktionen , 1969 .

[18]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[19]  Michael J. Maher,et al.  Invited Talk: Some Issues and Trends in the Semantics of Logic Programming , 1986, ICLP.

[20]  Peter H. Schmitt,et al.  Computational Aspects of Three-Valued Logic , 1986, CADE.

[21]  Shamim A. Naqvi.  A Logic for Negation in Database Systems , 1986, XP7.52 Workshop on Database Theory.

[22]  D.M. Gabbay,et al.  N-Prolog: An Extension of Prolog with Hypothetical Implication II - Logical Foundations, and Negation as Failure , 1985, J. Log. Program..

[23]  Michael J. Maher,et al.  Logic Programming Language Scheme , 1986, Logic Programming: Functions, Relations, and Equations.

[24]  Peter J. Stuckey,et al.  Canonical Logic Programs , 1986, J. Log. Program..

[25]  Donald Perlis,et al.  Computing Protected Circumscription , 1985, J. Log. Program..

[26]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

[27]  Alan Mycroft,et al.  Logic Programs and Many-Valued Logic , 1984, STACS.

[28]  Michael J. Maher,et al.  A Theory of Complete Logic Programs with Equality , 1984, J. Log. Program..

[29]  Dov M. Gabbay,et al.  Modal Provability Foundations for Negation by Failure , 1991, ELP.

[30]  Teodor C. Przymusinski,et al.  The extended closed world assumption and its relationship to parallel circumscription , 1985, PODS '86.

[31]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[32]  Taisuke Sato.  Negation and Semantics of Prolog Programs , 1982, ICLP.

[33]  David A. Plaisted.  Complete Problems in the First-Order Predicate Calculus , 1984, J. Comput. Syst. Sci..

[34]  Sten-Åke Tärnlund,et al.  Horn clause computability , 1977, BIT.

[35]  John W. Lloyd,et al.  A Basis for Deductive Database Systems II , 1986, J. Log. Program..

[36]  Michael J. Maher,et al.  Optimal Fixedpoints of Logic Programs , 1985, Theor. Comput. Sci..

[37]  Martin Davis,et al.  The Prehistory and Early History of Automated Deduction , 1983 .

[38]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[39]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[40]  Hassan Aït-Kaci,et al.  LOGIN: A Logic Programming Language with Built-In Inheritance , 1986, J. Log. Program..

[41]  J. W. LLOYD,et al.  Making Prolog more Expressive , 1984, J. Log. Program..

[42]  Joxan Jaffar,et al.  Completeness of the Negation as Failure Rule , 1983, IJCAI.