On the problem of computing the well-founded semantics

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 673-687

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

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; LOGIC PROGRAMS; POLYNOMIAL-TIME; TOPDOWN; WELL FOUNDED SEMANTICS;

ATOMS; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION; SEMANTICS;

ALGORITHMS;

EID: 33745436994     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. J.J. Alferes, C.V. Dam-Asio, and L.M. Pereira. A logic programming system for nonmonotonic reasoning. Journal of Automated Reasoning, 14:93-147, 1995.
2. K. Berman, J. Schlipf, and J.Franco. Computing the well-founded semantics faster. In Logic Programming and Nonmonotonic Reasoning (Lexington, KY, 1995), volume 928 of Lecture Notes in Computer Science, pages 113-125, Berlin, 1995. Springer.
3. S. Brass and J. Dix. Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA. Journal of Automated Reasoning, 20(1):143-165, 1998.
4. S. Brass,J. Dix,B. Freitag,U. Zukowski Transformation-based bottomup computation of the well-founded model Manuscript
5. S. Brass and J. Dix and B. Freitag and U. Zukowski. Transformation-based bottomup computation of the well-founded model. Manuscript. 5. W. Chen, T. Swift, and D.S. Warren. Efficient top-down computation of queries under the well-founded semantics. Journal of Logic Programming, 24(3):161-199, 1995.
6. W. Chen and D.S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, 1996.
7. W.F. Dowling and J.H. Gallier. Linear-time algorithms for testing the satis-Ability of propositional Horn formulae. Journal of Logic Programming, 1(3):267-284, 1984.
8. M. C. Fitting. Fixpoint semantics for logic programming-A survey. Theoretical Computer Science, 1999. To appear.
9. M.C. Fitting. Well-founded semantics, generalized. In Logic programming (San Diego, CA, 1991), MIT Press Series in Logic Programming, pages 71-84, Cambridge, MA, 1991. MIT Press.
10. M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Symposium on Logic Programming, pages 1070-1080, Cambridge, MA, 1988. MIT Press.
11. W. Marek and M. Truszczy-nski. Autoepistemic logic. Journal of the ACM, 38(3):588-619, 1991.
12. I. Niemeläand P. Simons. Efficient implementation of the well-founded and stable model semantics. In Proceedings of JICSLP-96. MIT Press, 1996.
13. P. Rao, I.V. Ramskrishnan, K. Sagonas, T. Swift, D. S. Warren, and J. Freire. XSB: A system for efficiently computing well-founded semantics. In Proceedings of LPNMR'97, pages 430-440. Berlin: Springer-Verlag, 1997. Lecture Notes in Computer Science, 1265.
14. V.S. Subrahmanian, D. Nau, and C. Vago. WFS + branch bound = stable models. IEEE Transactions on Knowledge and Data Engineering, 7:362-377, 1995.
15. A. Van Gelder. The alternating-xpoints of logic programs with negation. In ACM symposium on principles of database systems, pages 1-10, 1989.
16. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.
17. U. Zukowski, S. Brass, and B. Freitag. Improving the alternating-xpoint: the transformation approach. In Proceedings of LPNMR'97, pages 40-59. Berlin: Springer-Verlag, 1997. Lecture Notes in Computer Science, 1265.