Classical negation in logic programs and disjunctive databases

An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic programs by including classical negation, in addition to negation-as-failure. The semantics of such extended programs is based on the method of stable models. The concept of a disjunctive database can be extended in a similar way. We show that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available. Computationally, classical negation can be eliminated from extended programs by a simple preprocessor. Extended programs are identical to a special case of default theories in the sense of Reiter.

[1]  Michael Gelfond,et al.  Autoepistemic Logic and Formalization of Commonsense Reasoning: Preliminary Report , 1988, NMR.

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

[3]  Randy Goebel,et al.  Gracefully adding negation and disjunction to Prolog , 1986, ICLP.

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

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

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

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

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

[9]  Michael Gelford,et al.  Autoepistemic logic and formalization of commonsense reasoning: preliminary report , 1989 .

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

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

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

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

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

[15]  Teodor Przymusinski.  Negation by Default , 1993 .

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

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

[18]  Fariba Sadri,et al.  Logic programs with exceptions , 2009, New Generation Computing.

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

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

[21]  Robert A. Kowalski,et al.  The treatment of negation in logic programs for representing legislation , 1989, ICAIL '89.

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

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

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

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

[26]  Fangzhen Lin,et al.  Argument Systems: A Uniform Basis for Nonmonotonic Reasoning , 1989, KR.