Resolution for Skeptical Stable Model Semantics

An extension of resolution for skeptical stable model semantics is introduced. Unlike previous approaches, our calculus is not derived from credulous inference and enjoys a number of properties that are not satisfied by current nonmonotonic reasoning systems. Skeptical resolution is top down, in general, and goal directed on call-consistent programs. It does not need the given program to be instantiated before reasoning. It may compute nonground answer substitutions efficiently. It is compatible with different implementations of negation as failure. Some inferences, which depend on nonground negative goals, can be drawn without resorting to negation-as-failure; as a consequence, many goals that flounder in the standard setting have a successful skeptical derivation. The paper contains a preliminary study of some interesting derivation strategies and a sketch of a prototype implementation of the calculus.

[1]  K. A. Ross,et al.  Tabled Evaluation with Delaying for General Logic Programs , 1996 .

[2]  Jürgen Dix,et al.  Logic Programming and Nonmonotonic Reasoning 4th International Conference, Lpnmr '97, Dagstuhl Castle, Germany, July 28-31, 1997 : Proceedings' , 1997 .

[3]  Nicola Olivetti,et al.  A Sequent Calculus for Circumscription , 1997, CSL.

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

[5]  Victor W. Marek,et al.  Computing Intersection of Autoepistemic Expansions , 1991, LPNMR.

[6]  Anil Nerode,et al.  Implementing Stable Semantics by Linear Programming , 1993, LPNMR.

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

[8]  Torsten Schaub,et al.  Skeptical Query-Answering in Constrained Default Logic , 1996, FAPR.

[9]  David Scott Warren,et al.  Computation of Stable Models and Its Integration with Logical Query Processing , 1996, IEEE Trans. Knowl. Data Eng..

[10]  Nicola Olivetti,et al.  A Sequent Calculus for Skeptical Default Logic , 1997, TABLEAUX.

[11]  Piero A. Bonatti.  Resolution for Skeptical Stable Semantics , 1997, LPNMR.

[12]  Piero A. Bonatti,et al.  Sequent Calculi for Default and Autoepistemic Logics , 1996, TABLEAUX.

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

[14]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

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

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

[17]  Hubert Comon,et al.  Disunification: A Survey. , 1991 .

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

[19]  Georg Gottlob,et al.  A Non-Ground Realization of the Stable and Well-Founded Semantics , 1996, Theor. Comput. Sci..

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

[21]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[22]  Ilkka Niemelä,et al.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.