On the Relationship Between Logic Programming and Nonmonotonic Reasoning

In spite of the existence of a close relationship between logic programming and non-monotonic reasoning, in the past the two research areas have progressed largely independently of each other. Recently, however, a new declarative semantics of logic programs has been proposed and it has been shown to be equivalent to suitable forms of four major non-monotonic formalisms: McCarthy's circumscription, Reiter's closed world assumption, Moore's autoepistemic logic and Reiter's default logic. The importance of these results stems not only from the fact that they shed new light on the relationship between logic programming and nonmonotonic reasoning, but also from the fact that they establish a close relationship between four major formalizations of non-monotonic reasoning for an important class of theories.

[1]  Halina Przymusinska.  On the Relationship between Autoepistemic Logic and Prioritized Circumscription for Stratified Deductive Data Bases , 1987, ISMIS.

[2]  Christine Froidevaux,et al.  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming , 1987, LICS.

[3]  Michael Gelfond,et al.  Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..

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

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

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

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

[8]  Raymond Reiter,et al.  Circumscription Implies Predicate Completion (Sometimes) , 1982, AAAI.

[9]  Kurt Konolige,et al.  On the Relation Between Default Theories and Autoepistemic Logic , 1987, IJCAI.

[10]  Vladimir Lifschitz,et al.  Closed-World Databases and Circumscription , 1987, Artif. Intell..

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

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

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

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

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

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