An Overview of Nonmonotonic Reasoning and Logic Programming

Abstract The focus of this paper is nonmonotonic reasoning as it relates to logic programming. I discuss the prehistory of nonmonotonic reasoning, starting from approximately 1958. I then review the research that has been accomplished in the areas of circumscription, default theory, modal theories, and logic programming. The overview includes the major results developed, including complexity results that are known about the various theories. I then provide a summary which includes an assessment of the field and what must be done to further research in nonmonotonic reasoning and logic programming.

[1]  Melvin Fitting.  Well-Founded Semantics, Generalized , 1991, ISLP.

[2]  Victor W. Marek,et al.  Relating Autoepistemic and Default Logics , 1989, KR.

[3]  Paolo Mancarella,et al.  Database Updates through Abduction , 1990, VLDB.

[4]  Richard W. Weyhrauch,et al.  Prolegomena to a Theory of Mechanized Formal Reasoning , 1980, Artif. Intell..

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

[6]  Marvin Minsky,et al.  Logical Versus Analogical or Symbolic Versus Connectionist or Neat Versus Scruffy , 1991, AI Mag..

[7]  Lawrence J. Henschen,et al.  Compiling the GCWA in Indefinite Deductive Databases , 1988, Foundations of Deductive Databases and Logic Programming..

[8]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[9]  Jack Minker,et al.  Perspectives in Deductive Databases , 1988, J. Log. Program..

[10]  Robert E. Mercer,et al.  On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..

[11]  Sarit Kraus,et al.  Nonmonotonicity and the Scope of Reasoning , 1991, Artif. Intell..

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

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

[14]  Matthew L. Ginsberg,et al.  Readings in Nonmonotonic Reasoning , 1987, AAAI 1987.

[15]  Krishnaprasad Thirunarayan,et al.  An Evidence-based Framework for a Theory of Inheritance , 1989, IJCAI.

[16]  Donald Perlis,et al.  Circumscribing with Sets , 1987, Artif. Intell..

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

[18]  Robert G. Jeroslow,et al.  Computation-oriented reductions of predicate to propositional logic , 1988, Decis. Support Syst..

[19]  Raymond Reiter,et al.  On Inheritance Hierarchies With Exceptions , 1983, AAAI.

[20]  Chitta Baral,et al.  Generalized Negation As Failure and Semantics of Normal Disjunctive Logic Programs , 1992, LPAR.

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

[22]  Maurizio Lenzerini,et al.  The Complexity of Closed World Reasoning and Circumscription , 1990, AAAI.

[23]  Raymond Reiter,et al.  Circumscription and Generic Mathematical Objects , 1994, Fundam. Informaticae.

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

[25]  José Júlio Alferes,et al.  Counterfactual Reasoning Based on Revising Assumptions , 1991, ISLP.

[26]  Katsumi Inoue,et al.  Hypothetical Reasoning in Logic Programs , 1994, J. Log. Program..

[27]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

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

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

[30]  Jorge Lobo,et al.  Relating Minimal Models and Pre-Requisite-Free Normal Defaults , 1992, Inf. Process. Lett..

[31]  Daniel Lehmann,et al.  Rationality, Transitivity, and Contraposition , 1992, Artif. Intell..

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

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

[34]  Daniel Lehmann,et al.  What does a Conditional Knowledge Base Entail? , 1989, Artif. Intell..

[35]  Hector J. Levesque,et al.  The Tractability of Path-Based Inheritance , 1989, IJCAI.

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

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

[38]  Bart Selman,et al.  Hard Problems for Simple Default Logics , 1989, Artif. Intell..

[39]  Richmond H. Thomason,et al.  Conditionals and artificial intelligence , 1991, Fundam. Informaticae.

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

[41]  Kurt Konolige,et al.  Quantification in autoepistemic logic , 1991, Fundam. Informaticae.

[42]  John S. Schlipf,et al.  When is Closed World Reasoning Tractable? , 1988, International Syposium on Methodologies for Intelligent Systems.

[43]  Carl Hewitt,et al.  PLANNER: A Language for Proving Theorems in Robots , 1969, IJCAI.

[44]  Patrick J. Hayes,et al.  Computation and Deduction , 1973, MFCS.

[45]  Donald Perlis,et al.  On the consistency of commonsense reasoning , 1986, Comput. Intell..

[46]  J. Doyle.  Some theories of reasoned assumptions : an essay in rational psychology , 1983 .

[47]  Matthew L. Ginsberg.  A Circumscriptive Theorem Prover , 1989, Artif. Intell..

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

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

[50]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[51]  Hisao Tamaki,et al.  OLD Resolution with Tabulation , 1986, ICLP.

[52]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[53]  Scott E. Fahlman,et al.  NETL: A System for Representing and Using Real-World Knowledge , 1979, CL.

[54]  Victor W. Marek,et al.  The Stable Models of a Predicate Logic Program , 1994, J. Log. Program..

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

[56]  James P. Delgrande,et al.  An Approach to Default Reasoning Based on a First-Order Conditional Logic: Revised Report , 1987, Artif. Intell..

[57]  Jack Minker,et al.  Circumscription and Disjunctive Logic Programming , 1991, Artificial and Mathematical Theory of Computation.

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

[59]  Richard Hull,et al.  Positivism vs minimalism in deductive databases , 1985, PODS '86.

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

[61]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[62]  David S. Touretzky,et al.  A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..

[63]  Jack Minker,et al.  A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

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

[65]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[66]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

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

[68]  John S. Schlipf,et al.  Decidability and definability with circumscription , 1987, Ann. Pure Appl. Log..

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

[70]  Katsumi Inoue,et al.  Bottom-up Abduction by Model Generation , 1993, IJCAI.

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

[72]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

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

[74]  V. S. Subrahmanian,et al.  Reasoning in Inconsistent Knowledge Bases , 1995, IEEE Trans. Knowl. Data Eng..

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

[76]  Chitta Baral.  Issues in knowledge representation: semantics and knowledge combination , 1992 .

[77]  Jan Chomicki,et al.  Generalized Closed World Assumptions is Pi^0_2-Complete , 1990, Inf. Process. Lett..

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

[79]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, Theor. Comput. Sci..

[80]  Robert Stalnaker.  A Theory of Conditionals , 2019, Knowledge and Conditionals.

[81]  Gerhard Brewka,et al.  Nonmonotonic Reasoning: Logical Foundations of Commonsense By Gerhard Brewka (Cambridge University Press, 1991) , 1991, SGAR.

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

[83]  John McCarthy,et al.  Programs with common sense , 1960 .

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

[85]  Kave Eshghi,et al.  Abductive Planning with Event Calculus , 1988, ICLP/SLP.

[86]  Hector J. Levesque,et al.  Foundations of a Functional Approach to Knowledge Representation , 1984, Artif. Intell..

[87]  Tomasz Imielinski,et al.  Results on Translating Defaults to Circumscription , 1985, IJCAI.

[88]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

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

[90]  Anil Nerode,et al.  Computation and implementation of non-monotonic deductive databases , 1991 .

[91]  Matthew L. Ginsberg.  The MVL theorem proving system , 1991, SGAR.

[92]  Philippe Besnard,et al.  An Introduction to Default Logic , 1989, Symbolic Computation.

[93]  Kotagiri Ramamohanarao,et al.  Design overview of the Aditi deductive database system , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[94]  Katsumi Inoue,et al.  Embedding Negation as Failure into a Model Generation Theorem Prover , 1992, CADE.

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

[96]  Jack Minker,et al.  An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..

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

[98]  V. S. Subrahmanian,et al.  WFS + Branch and Bound = Stable Models , 1995, IEEE Trans. Knowl. Data Eng..

[99]  David H. D. Warren,et al.  Logic Programming, Proceedings of the Seventh International Conference, Jerusalem, Israel, June 18-20, 1990 , 1990, ICLP.

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

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

[102]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[103]  Christos H. Papadimitriou,et al.  On Finding Extensions of Default Theories , 1992, ICDT.

[104]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

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

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

[107]  Teodor C. Przymusinski.  An Algorithm to Compute Circumscription , 1989, Artif. Intell..

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

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

[110]  Jack Minker,et al.  Semantics of Disjunctive Deductive Databases , 1992, ICDT.

[111]  Hector J. Levesque,et al.  All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..

[112]  Bart Selman,et al.  Knowledge Compilation using Horn Approximations , 1991, AAAI.

[113]  J. M. Dunn,et al.  Modern Uses of Multiple-Valued Logic , 1977 .

[114]  Katsumi Inoue,et al.  An Abductive Procedure for the CMS/ATMS , 1990, Truth Maintenance Systems.

[115]  David S. Touretzky,et al.  The Mathematics of Inheritance Systems , 1984 .

[116]  Jack Minker,et al.  Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases , 1991, ICLP.

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

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

[119]  Raymond Reiter,et al.  On Reasoning by Default , 1978, TINLAP.

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

[121]  Terry Winograd,et al.  Extended Inference Modes in Reasoning by Computer Systems , 1990, Artif. Intell..

[122]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[123]  Victor W. Marek,et al.  More on modal aspects of default logic , 1992, Fundam. Informaticae.

[124]  Jon Doyle,et al.  The Ins and Outs of Reason Maintenance , 1983, IJCAI.

[125]  Sarit Kraus,et al.  Reasoning about ignorance: a note on the Bush-Gorbachev problem , 1991, Fundam. Informaticae.

[126]  Pierre Siegel,et al.  Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..

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

[128]  Drew McDermott,et al.  Nonmonotonic Logic II: Nonmonotonic Modal Theories , 1982, JACM.

[129]  Ilkka Niemelä.  On the decidability and complexity of autoepistemic reasoning , 1992, Fundam. Informaticae.

[130]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[131]  Raymond Reiter.  On Asking What a Database Knows , 1990 .

[132]  Vladimir Lifschitz,et al.  Between Circumscription and Autoepistemic Logic , 1989, KR.

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

[134]  Jorge Lobo,et al.  On Constructive Negation for Disjunctive Logic Programs , 1990, NACLP.

[135]  Françoise Gire,et al.  Well Founded Semantics and Stable Semantics of Semi-Strict Programs , 1992, ICDT.

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

[137]  Vladimir Lifschitz,et al.  Benchmark Problems for Formal Non-Monotonic Reasoning, Version 2.00 , 1988, NMR.

[138]  D. Perlis,et al.  The SUPREM architecture: a new intelligent paradigm , 1986 .

[139]  Benjamin N. Grosof,et al.  Generalizing Prioritization , 1991, KR.

[140]  Donald Perlis,et al.  Reasoning situated in time I: basic concepts , 1990, J. Exp. Theor. Artif. Intell..

[141]  Victor W. Marek,et al.  The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs , 1992, Theor. Comput. Sci..

[142]  Hector Geffner,et al.  Default reasoning - causal and conditional theories , 1992 .