On the problem of computing the well-founded semantics

Theory and Practice of Logic Programming

Volumn 1, Issue 5, 2001, Pages 591-609

  Lonc, Zbigniew ^a,b   Truszczyński, Mirosław ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

^b WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Alternating fixpoint; Well founded semantics

Indexed keywords

EID: 0346511489     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068401001053     Document Type: Article

References (18)

1. Alferes, J. J., Damásio, C. V. and Pereira, L. M. (1995) A logic programming system for nonmonotonic reasoning. J. Automated Reasoning, 14, 93-147.
2. Berman, K., Schlipf, J. and Franco, J. (1995) Computing the well-founded semantics faster. Logic Programming and Nonmonotonic Reasoning, (Lexington, KY. Lecture Notes in Computer Science 928. Springer-Verlag.
3. 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.
4. Brass, S., Dix, J., Freitag, B. and Zukowski, U. (2001) Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming. To appear.
5. Chen, W. and Warren, D. S. (1996) Tabled evaluation with delaying for general logic programs. J. ACM, 43(1), 20-74.
6. Chen, W., Swift, T. and Warren, D. S. (1995) Efficient top-down computation of queries under the well-founded semantics. J. Logic Programming, 24(3), 161-199.
7. Dowling, W. F. and Gallier, J. H. (1984) Linear-time algorithms for testing the satisfiability of prepositional Horn formulae. J. Logic Programming, 1(3), 267-284.
8. Fitting, M. C. (1985) A Kripke-Kleene semantics for logic programs. J. Logic Programming, 2(4), 295-312.
9. Fitting, M. C. (2001) Fixpoint semantics for logic programming - a survey. Theoretical Computer Science. To appear.
10. Fitting, M. C. (1991) Well-founded semantics, generalized. Logic Programming, pp. 71-84. MIT Press Series in Logic Programming. MIT Press.
11. Gelfond, M. and Lifschitz, V. (1988) The stable semantics for logic programs. In: Kowalski, R. and Bowen, K. (eds.), Proceedings of the 5th International Conference on Logic Programming, pp. 1070-1080. MIT Press.
12. Marek, W. and Truszczyński, M. (1991) Autoepistemic logic. J.ACM, 38(3), 588-619.
13. Niemelä, I. and Simons, P. (1996) Efficient implementation of the well-founded and stable model semantics. Proceedings of JICSLP-96. MIT Press.
14. Rao, P., Ramskrishnan, I. V., Sagonas, K., Swift, T., Warren, D. S. and Freire, J. (1997) XSB: A system for efficiently computing well-founded semantics. Proceedings of LPNMR'97: Lecture Notes in Computer Science 1265, pp. 430-440. Springer-Verlag.
15. Subrahmanian, V. S., Nau, D. and Vago, C. (1995) WFS + branch bound = stable models. IEEE Trans. Knowledge & Data Eng., 7, 362-377.
16. Van Gelder, A. (1989) The alternating fixpoints of logic programs with negation. ACM Symposium on Principles of Database Systems, pp. 1-10.
17. Van Gelder, A., Ross, K. A. and Schlipf, J. S. (1991) The well-founded semantics for general logic programs. J. ACM, 38(3), 620-650.
18. Zukowski, U., Brass, S. and Freitag, B. (1997) Improving the alternating fixpoint: the transformation approach. Proceedings of LPNMR'97: Lecture Notes in Computer Science 1265, pp. 40-59. Springer-Verlag.