Logic programming and negation : a survey

We survey here various approac.hes which we[e proposed to incorporate negation in logic programs. We concentrate on the proof-theoretic, and model-theoretic. issues and the relationships between them. 1991 Mathematics Su.bject Cla.<sification: 68Q40, 68T15. CR Cate90ries: F.3.2., FA.I, H.3.3, 1.2.3.

[1]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

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

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

[4]  Lee Naish,et al.  Negation and Quantifiers in NU-Prolog , 1986, ICLP.

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

[6]  Liz Sonenberg,et al.  Integrity Constraint Checking in Stratified Databases , 1987, J. Log. Program..

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

[8]  Egon Börger,et al.  Unsolvable Decision Problems for Prolog Programs , 1987, Computation Theory and Logic.

[9]  Shamim A. Naqvi,et al.  Database updates in logic programming , 1988, PODS.

[10]  Jorge Lobo,et al.  Weak Completion Theory for Non-Horn Programs , 1988, ICLP/SLP.

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

[12]  Krzysztof R. Apt,et al.  Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.

[13]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

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

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

[16]  Hidenori Itoh,et al.  A Query Evaluation Method for Stratified Programs Under the Extended CWA , 1988, ICLP/SLP.

[17]  Teodor C. Przymusinski.  On the Relationship Between Logic Programming and Nonmonotonic Reasoning , 1988, AAAI.

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

[19]  David B. Kemp,et al.  Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases , 1988, ICLP/SLP.

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

[21]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[22]  Teodor C. Przymusinski.  Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming , 1989, KR.

[23]  Hendrik Decker,et al.  Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution , 1989, CSL.

[24]  Kenneth A. Ross,et al.  The Well Founded Semantics for Disjunctive Logic Programs , 1989, DOOD.

[25]  John C. Shepherdson,et al.  A Sound and Complete Semantics for a Version of Negation as Failure , 1989, Theor. Comput. Sci..

[26]  Jack Minker,et al.  A Stratification Semantics for General Disjunctive Programs , 1989, NACLP.

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

[28]  Lawrence Cavedon,et al.  Continuity, Consistency, and Completeness Properties for Logic Programs , 1989, ICLP.

[29]  Victor W. Marek,et al.  Stable Semantics for Logic Programs and Default Theories , 1989, NACLP.

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

[31]  Serenella Cerrito,et al.  A linear semantics for allowed logic programs , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[32]  Teodor C. Przymusinski.  Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.

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

[34]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[35]  Teodor C. Przymusinski,et al.  Semantic Issues in Deductive Databases and Logic Programs , 1990 .

[36]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[37]  P. Legay,et al.  WELL!: An Evaluation Procedure for All Logic Programs , 1990, ICDT.

[38]  Taisuke Sato,et al.  Completed Logic Programs and their Consistency , 1990, J. Log. Program..

[39]  Franco Turini,et al.  A Transformational Approach to Negation in Logic Programming , 1990, J. Log. Program..

[40]  Roland N. Bol,et al.  Loop Checking and Negation , 1990, J. Log. Program..

[41]  Teodor C. Przymusinski.  Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs , 1991, Artif. Intell..

[42]  Jorge Lobo,et al.  WF³: A Semantics for Negation in Normal Disjunctive Logic Programs , 1991, ISMIS.

[43]  Hendrik Decker,et al.  On Generalized Cover Axioms , 1991, ICLP.

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

[45]  Peter J. Stuckey,et al.  Constructive negation for constraint logic programming , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

[47]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

[48]  Nicole Bidoit,et al.  Negation in Rule-Based Database Languages: A Survey , 1991, Theor. Comput. Sci..

[49]  Teodor C. Przymusinski.  Well-Founded Completions of Logic Programs , 1991, ICLP.

[50]  Robert F. Stärk,et al.  A Complete Axiomatization of the Three-Valued Completion of Logic Programs , 1991, J. Log. Comput..

[51]  Christine Froidevaux,et al.  General Logical Databases and Programs: Default Logic Semantics and Stratification , 1991, Inf. Comput..

[52]  Jia-Huai You,et al.  Making default inferences from logic programs , 1991, Comput. Intell..

[53]  Yong Hu,et al.  Extended Well-Founded Model Semantics for General Logic Programs , 1991, ICLP.

[54]  Kenneth A. Ross,et al.  Modular acyclicity and tail recursion in logic programs , 1991, PODS.

[55]  Keith L. Clark,et al.  Logic-Programming Schemes and Their Implementation , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[56]  Catholijn M. Jonker,et al.  Cautious backtracking and well-founded semantics in truth maintenance systems , 1991 .

[57]  J. Zwiers,et al.  Assertional Data Reification Proofs: Survey and Perspective , 1991 .

[58]  Kotagiri Ramamohanarao,et al.  Efficient Bottom-UP Computation of Queries on Stratified Databases , 1991, J. Log. Program..

[59]  Teodor C. Przymusinski,et al.  Stationary Semantics for Normal and Disjunctive Logic Programs , 1991 .

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

[61]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[62]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[63]  Fairouz Kamareddine,et al.  Non well-foundedness and type freeness can unify the interpretation of functional application , 1992 .

[64]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[65]  Teodor C. Przymusinski,et al.  Soundness and Completeness of Partial Deductions for Well-Founded Semantics , 1992, LPAR.

[66]  Jürgen Dix,et al.  Classifying Semantics of Disjunctive Logic Programs , 1992, JICSLP.

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

[68]  Robert F. Stark,et al.  The Proof Theory of Logic Programs with Negation , 1992 .

[69]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[70]  Krzysztof R. Apt,et al.  A new definition of SLDNF-resolution , 1992 .

[71]  D. Warren.  Negation in Disjunctive Logic Programs , 1993 .

[72]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[73]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[74]  Mark Wallace,et al.  Tight, Consistent and Computable Completions for Unrestricted Logic Programs , 1993, J. Log. Program..

[75]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

[76]  M. Mowbray,et al.  A Completeness Result for SLDNF-Resolution , 1993, GULP.

[77]  Dino Pedreschi,et al.  Reasoning about Termination of Pure Prolog Programs , 1993, Inf. Comput..

[78]  A. Nerode,et al.  Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties , 1993 .

[79]  Melvin Fitting,et al.  Metric Methods Three Examples and a Theorem , 1994, J. Log. Program..

[80]  Robert F. Stärk,et al.  The Declarative Semantics of the Prolog Selection Rule , 1994, LICS.

[81]  Gerd Wagner.  Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation , 1994 .

[82]  Frank Teusink,et al.  A characterization of stable models using a non-monotonic operator , 1993, Methods Log. Comput. Sci..

[83]  Robert F. Stärk,et al.  Input/Output Dependencies of Normal Logic Programs , 1994, J. Log. Comput..

[84]  José Júlio Alferes,et al.  Adding Closed World Assumptions to Well-Founded Semantics , 1994, Theor. Comput. Sci..

[85]  Carolina Ruiz,et al.  Semantics for Disjunctive Logic Programs with Explicit and Default Negation , 1994, Fundam. Informaticae.

[86]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

[87]  Piero A. Bonatti,et al.  Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs , 1995, J. Log. Program..

[88]  Robert Stärk,et al.  From logic programs to inductive definitions , 1996 .

[89]  Wlodzimierz Drabent,et al.  On Negation As Instantiation , 1996, ALP.

[90]  J. van Leeuwen,et al.  Logic Programming , 2002, Lecture Notes in Computer Science.