Computation of Stable Models and Its Integration with Logical Query Processing

The well-founded semantics and the stable model semantics capture intuitions of the skeptical and credulous semantics in nonmonotonic reasoning, respectively. They represent the two dominant proposals for the declarative semantics of deductive databases and logic programs. However, neither semantics seems to be suitable for all applications. We have developed an efficient implementation of goal-oriented effective query evaluation under the well-founded semantics. It produces a residual program for subgoals that are relevant to a query, which contains facts for true instances and clauses with body literals for undefined instances. We present a simple method of stable model computation that can be applied to the residual program of a query to derive answers with respect to stable models. The method incorporates both forward and backward chaining to propagate the assumed truth values of ground atoms, and derives multiple stable models through backtracking. Users are able to request that only stable models satisfying certain conditions be computed. A prototype has been developed that provides integrated query evaluation under the well-founded semantics, the stable models, and ordinary Prolog execution. We describe the user interface of the prototype and present some experimental results.

[1]  Divesh Srivastava,et al.  Controlling the Search in Bottom-Up Evaluation , 1992, JICSLP.

[2]  Sergio Greco,et al.  Greedy by choice , 1992, PODS '92.

[3]  Konstantinos Sagonas,et al.  Xsb as an Eecient Deductive Database Engine , 1994 .

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

[5]  Rodney W. Topor,et al.  Safety and translation of relational calculus , 1991, TODS.

[6]  Weidong Chen.  Query evaluation in deductive databases with alternating fixpoint semantics , 1995, TODS.

[7]  Kave Eshghi,et al.  Computing Stable Models by Using the ATMS , 1990, AAAI.

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

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

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

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

[12]  David Scott Warren,et al.  Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..

[13]  Domenico Saccà,et al.  Effective Implementation of Negation in Database Logic Query Languages , 1993, LOGIDATA+: Deductive Databases with Complex Objects.

[14]  Kenneth A. Ross.  The semantics of deductive databases , 1992 .

[15]  Shamim A. Naqvi,et al.  A Logical Language for Data and Knowledge Bases , 1989 .

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

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

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

[19]  Phan Minh Dung,et al.  Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.

[20]  John S. Schlipf.  A Survey of Complexity and Undecidability Results in Logic Programming , 1992, Structural Complexity and Recursion-theoretic methods in Logic-Programming.

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

[22]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

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

[24]  John L. Cuadrado,et al.  A Truth Maintenance System Based on Stable Models , 1989, NACLP.

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

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

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

[28]  R. Ramesh,et al.  A Portable Method of Integrating SLG Resolution into Prolog Systems , 1994, ILPS.

[29]  David S. Warren.  Transforming Abductive Logic Programs to Disjunctive Programs , 1993 .

[30]  Anil Nerode,et al.  Mixed integer programming methods for computing nonmonotonic deductive databases , 1994, JACM.

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

[32]  Weidong Chen,et al.  Towards Effective Evaluation of General Logic Programs , 1993 .

[33]  Konstantinos Sagonas,et al.  XSB as an efficient deductive database engine , 1994, SIGMOD '94.

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

[35]  Peter J. Stuckey,et al.  Well-Founded Ordered Search (Extended Abstract) , 1993, FSTTCS.

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

[37]  David Scott Warren,et al.  Query evaluation under the well-founded semantics , 1993, PODS.

[38]  Peter J. Stuckey,et al.  Well-founded ordered search , 1993 .

[39]  Divesh Srivastava,et al.  Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs , 1990, IEEE Trans. Knowl. Data Eng..

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

[41]  John S. Schlipf,et al.  The expressive powers of the logic programming semantics (extended abstract) , 1990, PODS.

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

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