Transformation-based bottom-up computation of the well-founded model

Theory and Practice of Logic Programming

Volumn 1, Issue 5, 2001, Pages 497-538

  Brass, Stefan ^a   Dix, Jürgen ^b   Freitag, Burkhard ^c   Zukowski, Ulrich ^c  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

^c UNIVERSITY OF PASSAU   (Germany)

Author keywords

Alternating fixpoint; Bottom up evaluation; Magic set transformation; Well founded semantics

Indexed keywords

EID: 0000772277     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S147106840100103X     Document Type: Article

References (46)

1. Apt, K. R., Marek, V., Truszczynski, M. and Warren, D. S. (eds). (1999) The Logic Programming Paradigm: Current Trends and Future Directions. Springer-Verlag.
2. Balbin, I. and Ramamohanarao, K. (1986) A Differential Approach to Query Optimisation in Recursive Databases. Technical Report 86/7, Department of Computer Science, University of Melbourne, Australia.
3. Beeri, C. and Ramakrishnan, R. (1991) On the Power of Magic. J. Logic Programming, 10, 255-299.
4. Berman, K. A., Schlipf, J. S. and Franco, J. V. (1995) Computing the Well-founded Semantics Faster. In: Nerode, A., Marek, W. and Truszczyński, M. (eds.), Logic Programming and Non-monotonic Reasoning, Proceedings of 3rd International Conference, pp. 113-126. Lecture Notes in Computer Science 928. Springer-Verlag.
5. Bol, R. N. and Degerstedt, L. (1998) Tabulated Resolution for the Well-founded Semantics. J. Logic Programming, 34(2), 67-109.
6. Brass, S. and Dix, J. (1994) A Disjunctive Semantics Based on Unfolding and Bottom-up Evaluation. In: Wolfinger, B. (ed.), Innovationen bei rechen- und kommunikationssystemen, (ifip '94-congress, workshop fg2: disjunctive logic programming and disjunctive databases), pp. 83-91. Springer-Verlag.
7. Brass, S. and Dix, J. (1997) Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. J. Logic Programming, 32(3), 207-228. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pp. 85-98, 1995. LNCS 928. Springer-Verlag.)
8. Brass, S. and Dix, J. (1997) Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. J. Logic Programming, 32(3), 207-228. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pp. 85-98, 1995. LNCS 928. Springer-Verlag.)
9. Brass, S. and Dix, J. (1998) Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA. J. Automated Reasoning, 20(1), 143-165. (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, pp. 268-283, 1996. LNCS 1126. Springer-Verlag.)
10. Brass, S. and Dix, J. (1998) Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA. J. Automated Reasoning, 20(1), 143-165. (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, pp. 268-283, 1996. LNCS 1126. Springer-Verlag.)
11. Brass, Stefan, & Dix, Jürgen. (1999) Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. J. Logic Programming, 38(3), 167-213. (Extended abstract appeared in: Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation, Proceedings 12th International Logic Programming Conference, Tokyo, pp. 199-213, 1995. MIT Press.)
12. Brass, Stefan, & Dix, Jürgen. (1999) Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. J. Logic Programming, 38(3), 167-213. (Extended abstract appeared in: Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation, Proceedings 12th International Logic Programming Conference, Tokyo, pp. 199-213, 1995. MIT Press.)
13. Bry, F. (1989) Logic Programming as Constructivism: A Formalization and its Application to Databases. Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'89), pp. 34-50.
14. Bry, F. (1990) Negation in Logic Programming: A Formalization in Constructive Logic. In: Karagiannis, D. (ed.), Information Systems and Artificial Intelligence: Integration Aspects, pp. 30-46. LNCS 474. Springer-Verlag.
15. Chen, W. and Warren, D. S. (1996) Tabled Evaluation with Delaying for General Logic Programs. J. ACM, 43(1), 20-74.
16. Chen, W., Swift, T. Warren, D. S. (1995) Efficient Top-down Computation of Queries Under the Well-founded Semantics. J. Logic Programming, 24(3), 219-245.
17. Dix, J. (1995a) A Classification-theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta informaticae, XXII(3), 227-255.
18. Dix, J. (1995b) A Classification-theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta informaticae, XXII(3), 257-288.
19. Dix, J. and Stolzenburg, F. (1998) A Framework to Incorporate Nonmonotonic Reasoning into Constraint Logic Programming. J. Logic Programming, 37(1,2,3), 47-76. (Special Issue on Constraint Logic Programming.)
20. Dowling, W. F. and Gallier, J. H. (1984) Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Logic Programming, 1(3), 267-284.
21. Dung, P. M. and Kanchansut, K. (1989a) A Fixpoint Approach to Declarative Semantics of Logic Programs. Proc. North American Conference on Logic Programming (NACLP'89), pp. 604-625.
22. Dung, P. M. and Kanchansut, K. (1989b) A Natural Semantics of Logic Programs with Negation. Proc. 9th Conf. on Foundations of Software Technology and Theoretical Computer Science, pp. 70-80.
23. Fitting, M. C. (1985) A Kripke-Kleene Semantics of Logic Programs. J. Logic Programming, 4, 295-312.
24. Freire, J., Swift, T. and Warren, D. S. (1997) Taking I/O Seriously: Resolution Reconsidered for Disk. Proc. Int. Conf. on Logic Programming (ICLP'97), pp. 198-212. Leuven, Belgium. MIT Press.
25. Freitag, B., Schütz, H. and Specht, G. (1991) LOLA - A Logic Language for Deductive Databases and its Implementation. Proc. 2nd Int. Symposium on Database Systems for Advanced Applications (DASFAA '91), pp. 216-225. Tokyo, Japan.
26. Gelfond, M. and Lifschitz, V. (1988) The Stable Model Semantics for Logic Programming. In: Kowalski, R. and Bowen, K. (eds.), 5th Conf. on Logic Programming, pp. 1070-1080. MIT Press.
27. Kemp, D. B., Srivastava, D. and Stuckey, P. J. (1995) Bottom-up Evaluation and Query Optimization of Well-founded models. Theor. Comput. Sci., 146, 145-184.
28. Marek, W. and Truszczynski, M. (1991) Autoepistemic Logic. J. ACM, 38(3), 588-619.
29. Morishita, S. (1996) An Extension of Van Gelder's Alternating Fixpoint to Magic Programs. J. Computer & System Sci., 52, 506-521.
30. Niemelä, I. and Simons, P. (1996) Efficient Implementation of the Well-founded and Stable Model Semantics. In: Maher, M. (ed.), Proc. Joint Int. Conf. & Symposium on Logic Programming, pp. 289-303. Bonn, Germany. MIT Press.
31. Przymusinski, Te. (1989a) Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model. Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. Pages 11-21. Philadelphia, PN. ACM Press.
32. Przymusinski, Te. (1989b) On the Declarative and Procedural Semantics of Logic Programs. J. Automated Reasoning, 5, 167-205.
33. Przymusinski, T. (1990) Well-founded Semantics Coincides With Three-valued Stable Semantics. Fundamenta informaticae, XIII, 445-463.
34. Przymusinski, T. (1991) Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs. Artif. Intell., 49, 309-343. (Extended abstract appeared in: Three-valued non-monotonic formalisms and logic programming. Proc. 1st Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Canada, pp. 341-348. Morgan Kaufmann, 1989.)
35. Przymusinski, T. (1991) Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs. Artif. Intell., 49, 309-343. (Extended abstract appeared in: Three-valued non-monotonic formalisms and logic programming. Proc. 1st Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Canada, pp. 341-348. Morgan Kaufmann, 1989.)
36. Ramakrishnan, R., Srivastava, D. and Sudarshan, S. (1992) Controlling the Search in Bottom-Up Evaluation. In: Apt, K. (ed.), Proc. Joint Int. Conf. & Symposium on Logic Programming, pp. 273-287. MIT Press.
37. Sagonas, K., Swift, T. and Warren, D. S. (1994) XSB as an Efficient Deductive Database Engine. In: Snodgrass, R. T. and Winslett, M. (eds.), Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'94), pp. 442-453.
38. Stuckey, P. J. and Sudarshan, S. (1997) Well-Founded Ordered Search: Goal-Directed Bottom-Up Evaluation of Well-Founded Models. J. Logic Programming, 32(3), 171-205.
39. Subrahmanian, V.S., Nau and Vago (1995) WFS + Branch and Bound = Stable Models. IEEE Trans. Knowledge & Data Eng., 17(3), 362-377.
40. Van Gelder, A. (1989) The Alternating Fixpoint of Logic Programs with Negation. Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pods'89), pp. 1-10.
41. Van Gelder, A. (1993) The Alternating Fixpoint of Logic Programs with Negation. J. Comput. & System Sci., 47(1), 185-221.
42. Van Gelder, A., Ross, K. A. and Schlipf, J. S. (1991) The Well-Founded Semantics for General Logic Programs. J. ACM, 38, 620-650.
43. Zukowski, U. and Freitag, B. (1996a) Adding Flexibility to Query Evaluation for Modularly Stratified Databases. Proc. Joint Int. Conf. & Symposium on Logic Programming (JICSLP'96), pp. 304-319. Bonn, Germany. MIT Press.
44. Zukowski, U. and Freitag, B. (1996b) The Differential Fixpoint of General Logic Programs. In: Boulanger, D., Geske, U., Gianotti, F. and Seipel, D. (eds.), Proc. Workshop DDLP'96 on Deductive Databases and Logic Programming. 4th Workshop in conjunction with JICSLP'96, pp. 45-56. Bonn, Germany.
45. Zukowski, U. and Freitag, B. (1997) The Deductive Database System LOLA. In: Dix, J., Furbach, U. and Nerode, A. (eds.), Nonmonotonic Extensions of Logic Programming: LNAI 1265, pp. 375-386. Springer-Verlag.
46. Zukowski, U., Brass, S. and Freitag, B. (1997) Improving the Alternating Fixpoint: The Transformation Approach. In: Dix, J., Furbach, U. Nerode, A. (eds.), Logic Programming and Nonmonotonic Reasoning: LNAI 1265, pp. 40-59. Springer-Verlag.