WFS + Branch and Bound = Stable Models

Though the semantics of nonmonotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. In this paper, we develop techniques to compute the well-founded model of a logic program. We describe a prototype implementation and show, based on experimental results, that our technique is more efficient than the standard alternating fixpoint computation. Subsequently, we develop techniques to compute the set of all stable models of a deductive database. These techniques first compute the well-founded semantics and then use an intelligent branch and bound strategy to compute the stable models. We report on our implementation, as well as on experiments that we have conducted on the efficiency of our approach. >

[1]  Anil Nerode,et al.  Computing Minimal Models by Partial Instantiation , 1996, Theor. Comput. Sci..

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

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

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

[5]  Anil Nerode,et al.  Implementing deductive databases by mixed integer programming , 1996, TODS.

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

[7]  Anil Nerode,et al.  Implementing deductive databases by linear programming , 1992, PODS.

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

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

[10]  Anil Nerode,et al.  Computing Definite Logic Programs by Partial Instantiation , 1994, Ann. Pure Appl. Log..

[11]  Victor W. Marek,et al.  Stable Semantics for Logic Programs and Default Theories , 1989, NACLP.

[12]  Nicola Leone,et al.  Safe computation of the well-founded semantics of Datalog queries , 1992, Inf. Syst..

[13]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

[15]  G. Levi,et al.  Computing Definite Logic Programs by Partial Instantiation , 1994 .

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

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

[18]  Divesh Srivastava,et al.  Magic Sets and Bottom-Up Evaluation of Well-Founded Models , 1991, ISLP.

[19]  Georg Gottlob,et al.  Non-ground stable and well-founded semantics , 1994 .

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