WFS + Branch and Bound = Stable Models

IEEE Transactions on Knowledge and Data Engineering

Volumn 7, Issue 3, 1995, Pages 362-377

  Subrahmanian, V S ^a   Nau, Dana ^a   Vago, Carlo ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

deductive databases; Logic programming; monotonic reasoning; negation by failure; non

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; DATABASE SYSTEMS; OPTIMIZATION; RAPID PROTOTYPING;

BRANCH AND BOUND; DEDUCTIVE DATABASE; NEGATION BY FAILURE; NONMONOTONIC REASONING; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 0029321867     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.390244     Document Type: Article

References (22)

1. K.R. Apt, H. Blair, and A. Walker, “Towards a theory of declarative knowledge,” J. Minker, ed., Foundations of Deductive Databases and Logic Programming, pp. 89-148, Morgan Kaufmann, 1988.
2. C. Baral and V.S. Subrahmanian, “Stable and extension class theory for logic programs and default logics,” J. Automated Reasoning, vol. 8, pp. 345-366,1992.
3. C. Baral and V.S. Subrahmanian. “Dualities between alternative semantics for logic programming and nonmonotonic reasoning,” J. Automated Reasoning, vol. 10, pp. 399-420, 1993.
4. C. Bell, A. Nerode, R. Ng. and V.S. Subrahmanian, “Implementing deductive databases by linear programming,” accepted for publication in ACM Trans. Database Systems.
5. C. Bell, A. Nerode, R. Ng, and V.S. Subrahmanian, “Computation and implementation of nonmonotonic deductive databases,” J. ACM, vol. 41, no. 6, pp. 1,178-1215, Nov. 1994.
6. W. Chen and D.S Warren, “A practical approach to computing the well-founded semantics,” Proc. 1992 lnt'l Conf. Logic Programming, Nov. 1992.
7. M.C. Fitting, “A Kripke-Kleene semantics for logic programming,” J. Logic Programming, vol. 4, pp. 295-312, 1985.
8. M. Gelfond and V. Lifschitz, “The stable model semantics for logic programming,” Proc. Fifth lnt’l Conf. and Symp. on Logic Programming, R.A. Kowalski and K.A. Bowen, eds., pp. 1,070-1,080, 1988.
9. G. Gottlob, S. Marcus, A. Nerode, and V.S. Subrahmanian, “Non-ground stable and well-founded demantics,” manuscript in preparation, 1993.
10. V Kagan, A. Nerode, and V.S. Subrahmanian, “Computing definite logic programs by partial instantiation,” Annals of Pure and Applied Logic, vol. 67, pp. 161-182, 1993.
11. V. Kagan, A. Nerode, and V.S. Subrahmanian, “Computing minimal models by partial instantiation,” 1993, accepted for publication in Theoretical Computer Science.
12. D. Kemp, P.J. Stuckey, and D. Srivastava, “Magic sets and bottom-up evaluation of well-founded models,” Proc. 1991 Int'l Logic Programming Symp., V. Saraswat and K. Ueda, eds., pp. 337-351, MIT Press, 1991.
13. D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison Wesley, 1973.
14. N. Leone and P. Rullo, “Safe computation of the well-founded semantics of DATALOG queries,” Information Systems, vol. 17, no. 1,1992.
15. N. Leone, M. Romeo, P. Rullo, and D. Sacca, “Effective implementation of negation in database logic query languages,” LOGIDATA+: Deductive Databases with Complex Objects, LNCS vol. 701, pp. 159-175, Springer, 1993.
16. J.W. Lloyd, Foundations of Logic Programming, Springer, 1987.
17. W. Marek and M. Truszczynski, “Stable semantics for logic programs and default theories,” Proc. 1989 North Am. Conf. Logic Programming, E. Lusk and R. Overbeek, eds., pp. 243-256, MIT Press, 1989.
18. D. Sacca and C. Zaniolo, “Stable models and nondeterminism in logic programs with negation.” Proc. 1990 ACM Symp. Principles of Data- base Systems.
19. V.S. Subrahmanian, D.S. Nau, and C. Vago, “WFS + branch and bound stable models,” Tech. Report CS-TR-2935, July 1992, Univ. of Maryland. Tech. report version of this paper.
20. A. van Gelder, “The alternating fixpoint of logic programs with negation,” Proc. Eighth ACM Symp. Principles of Database Systems, pp. 1-10, 1989.
21. A. van Gelder, K. Ross, and J. Schlipf, “Unfounded sets and well-founded semantics for general logic programs,” Proc. Seventh Symp. Principles of Database Systems, pp. 221-230, 1988.
22. D.S. Warren, “Computing the well-founded semantics of logic programs,” SUNY Stonybrook Tech. Report TR 91-12, June 1991.