Logic Programming and Negation: A Survey

[1]  Blain Brown.  Continuity , 2021, Nature.

[2]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

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

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

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

[6]  Maurizio Martelli,et al.  Negation as Instantiation , 1995, Inf. Comput..

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

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

[9]  Pascal Van Hentenryck.  Proceedings of the eleventh international conference on Logic programming , 1994 .

[10]  R. F. Stark,et al.  The declarative semantics of the Prolog selection rule , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

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

[12]  Krzysztof R. Apt,et al.  On the occur-check-free PROLOG programs , 1994, TOPL.

[13]  John W. Lloyd,et al.  The Gödel programming language , 1994 .

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

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

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

[17]  Roland N. Bol,et al.  Tabulated Resolution for the Well-Founded Semantics , 1993, J. Log. Program..

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

[19]  Melvin Fitting,et al.  The Family of Stable Models , 1993, J. Log. Program..

[20]  David Scott Warren,et al.  A Goal-Oriented Approach to Computing the Well-Founded Semantics , 1993, J. Log. Program..

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

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

[23]  Chiaki Sakama,et al.  Negation in Disjunctive Logic Programs , 1993, ICLP.

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

[25]  Jürgen Dix,et al.  Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties (Extended Abstract) , 1993, LPNMR.

[26]  Karl Stroetmann,et al.  A Completeness Result for SLDNF-Resolution , 1993, J. Log. Program..

[27]  Mark Wallace,et al.  Tight, Consistent and Computable Completions for Unrestricted Logic Programs , 1993, The Journal of Logic Programming.

[28]  Agostino Cortesi,et al.  Graph Properties for Normal Logic Programs , 1993, Theor. Comput. Sci..

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

[30]  A. Kakas,et al.  Abductive Logic Programming , 1992, LPNMR.

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

[32]  Maurizio Martelli,et al.  A New SLDNF-Tree , 1992, Inf. Process. Lett..

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

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

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

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

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

[38]  S. Ginsburg,et al.  Acyclic logic programs and the completeness of SLDNF-resolution , 1991 .

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

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

[41]  John C. Shepherdson,et al.  Correct Answers to Allowed Programs and Queries are Ground , 1991, J. Log. Program..

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

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

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

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

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

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

[48]  Stefano Baratella,et al.  Models of Clark's completion for some classes of logic programs , 1991, Fundam. Informaticae.

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

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

[51]  Koichi Furukawa,et al.  Proceedings of the eighth international conference on Logic programming , 1991 .

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

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

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

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

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

[57]  Jorge Lobo,et al.  Generalized Well-founded Semantics for Logic Programs (Extended Abstract) , 1990, CADE.

[58]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

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

[60]  Charles Elkan,et al.  A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems , 1990, Artif. Intell..

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

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

[63]  Laura Giordano,et al.  Generalized Stable Models, Truth Maintenance and Conflict Resolution , 1990, ICLP.

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

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

[66]  H. Przymusinska,et al.  Weakly stratified logic programs , 1990 .

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

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

[69]  John W. Lloyd,et al.  A Completeness Theorem for SLDNF Resolution , 1989, J. Log. Program..

[70]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

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

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

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

[74]  Krzysztof R. Apt,et al.  On the Safe Termination of PROLOG Programs , 1989, ICLP.

[75]  Michael Gelfond,et al.  Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.

[76]  Kenneth A. Ross,et al.  A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..

[77]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[78]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

[79]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

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

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

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

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

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

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

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

[87]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

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

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

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

[91]  R. Reiter.  On Closed World Data Bases , 1987, Logic and Data Bases.

[92]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

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

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

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

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

[97]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

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

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

[100]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

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

[102]  J. McCarthy.  Circumscription: a form of non-monotonic reasoning , 1995 .

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

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

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

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

[107]  Kees Doets,et al.  Levationis Laus , 1993, J. Log. Comput..

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

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

[110]  V. Wiktor Marek,et al.  Nonmonotonic Logic , 1993, Artificial Intelligence.

[111]  Jürgen Dix,et al.  A Framework for Representing and Characterizing Semantics of Logic Programs , 1992, KR.

[112]  E. Marchiori,et al.  Proving run-time properties of general programs w.r.t. constructive negation , 1992 .

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

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

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

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

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

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

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

[120]  Serenella Cerrito,et al.  A Linear Axiomatization of Negation as Failure , 1992, J. Log. Program..

[121]  K. Apt,et al.  A New Deenition of Sldnf-resolution , 1992 .

[122]  Stefan Lüttringhaus-Kappel,et al.  Laziness in logic programming , 1992 .

[123]  Hector J. Levesque,et al.  Three-valued nonmonotonic formalisms and semantics of logic programs , 1992 .

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

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

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

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

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

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

[130]  Teodor C. Przymusinski.  Autoepistemic Logics of Closed Beliefs and Logic Programming , 1991, LPNMR.

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

[132]  K. Apt.  Fundamenta informaticae on Logic Programming , 1990 .

[133]  Weakly Strati.  Weakly Stratiied Logic Programs , 1990 .

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

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

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

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

[138]  Teodor C. Przymusinski.  Non-Monotonic Formalisms and Logic Programming , 1989, ICLP.

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

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

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

[142]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[143]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[144]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[145]  M. Gelfond,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[146]  H. Seki,et al.  A Query Evaluation Method for Stratified Programs Under the Extended CWA , 1988, ICLP/SLP.

[147]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

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

[149]  PerspectiveTeodor,et al.  Non { monotonic Reasoning vs . Logic Programming : A New , 1987 .

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

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

[152]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .