Improving the alternating fixpoint: The transformation approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1265, Issue , 1997, Pages 40-59

  Zukowski, Ulrich ^a   Brass, Stefan ^b   Freitag, Burkhard ^a  

^a UNIVERSITY OF PASSAU   (Germany)

^b UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

BOTTOM UP; DISJUNCTIVE LOGIC PROGRAMS; FIXPOINTS; PROGRAM TRANSFORMATIONS; WELL-FOUNDED MODELS;

LOGIC PROGRAMMING;

EID: 84946748377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_4     Document Type: Conference Paper

References (29)

1. C. Bell, A. Nerode, R. Ng, and V. S. Subrahmanian. Implementing stable semantics by linear programming. In L. M. Pereira and A. Nerode, editors, Logic Programming and Non-monotonic Reasoning, Proc. of the Second Int. Workshop (LP-NMR’93), pages 23-42. MIT Press, 1993.
2. S. Brass. Bottom-up query evaluation in extended deductive databases. Habilitationsschrift, Universität Hannover, Fachbereich Mathematik, 1996. http://www.informatik.uni-hannover.de/~sb/habil.html.
3. S. Brass. SLDMagic - An improved magic set technique. In B. Novikov and J. W. Schmidt, editors, Advances in Databases and Information Systems - ADBIS’96, 1996.
4. S. Brass and J. Dix. Disjunctive semantics based upon partial and bottom-up evaluation. In L. Sterling, editor, Logic Programming, Proc. of the Twelfth Int. Conf. on Logic Programming (ICLP’95), pages 199-213. MIT Press, 1995.
5. S. Brass and J. Dix. A general approach to bottom-up computation of disjunctive semantics. In J. Dix, L. M. Pereira, and T. C. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, number 927 in LNAI, pages 127-155. Springer, 1995.
6. S. Brass and J. Dix. Characterizing D-WPS: Confluence and iterated GCWA. In 5th European Workshop on Logics in AI (JELIA’96), 1996.
7. S. Brass, B. Freitag, and U. Zukowski. Transformation based bottom-up computation of the well-founded model. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 171-201. Springer, Berlin, 1997.
8. th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’89), pages 34-50, 1989.
9. F. Bry. Negation in logic programming: A formalization in constructive logic. In D. Karagiannis, editor, Information Systems and Artificial Intelligence: Integration Aspects, number 474 in LNCS, pages 30-46. Springer, 1990.
10. 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.
11. W. Chen and D. S. Warren. Query-evaluation under the well founded semantics. In Proc. of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’93), pages 168-179, 1993.
12. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1): 20-74, 1996.
13. P. Cholewinski, V. W. Marek, A. Mikitiuk, and M. Truszczyński. Experimenting with nonmonotonic reasoning. In L. Sterling, editor, Logic Programming, Proc. of the Twelfth Int. Conf. on Logic Programming (ICLP’95), pages 267-281. MIT Press, 1995.
14. L. Degerstedt and U. Nilsson. Magic computation for well-founded semantics. In J. Dix, L. M. Pereira, and T. C. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, number 927 in LNAI, pages 181-204. Springer, 1995.
15. P. M. Dung and K. Kanchansut. A fixpoint approach to declarative semantics of logic programs. In Proc. North American Conference on Logic Programming (NACLP’89), pages 604-625, 1989.
16. P. M. Dung and K. Kanchansut. A natural semantics of logic programs with negation. In Proc. of the Ninth Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 70-80, 1989.
17. B. Freitag, H. Schütz, and G. Specht. LOLA - a logic language for deductive databases and its implementation. In Proc. 2nd International Symposium on Database Systems for Advanced Applications (DASFAA '91), Tokyo, Japan, April 2-4, 1991, pages 216-225, 1991.
18. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Logic Programming, Proc. of the 5th Int. Conf. and Symp., pages 1070-1080, Cambridge, Mass., 1988. MIT Press.
19. D. B. Kemp, D. Srivastava, and P. J. Stuckey. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science, 146: 145-184, 1995.
20. W. Marek and M. Truszczynski. Autoepistemic logic. Journal of the ACM, 38(3): 588-619, 1991.
21. K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In R. T. Snodgrass and M. Winslett, editors, Proc. of the 1994 ACM SIG-MOD Int. Conf. on Management of Data (SIGMOD’94), pages 442-453, 1994.
22. V. S. Subrahmanian and C. Zaniolo. Relating stable models and AI planning domains. In L. Sterling, editor, Logic Programming, Proc. of the Twelfth Int. Conf. on Logic Programming (ICLP’95), pages 233-247. MIT Press, 1995.
23. A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’89), pages 1-10, 1989.
24. A. Van Gelder. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences, 47(1): 185-221, 1993.
25. A. Van Gelder, K. Ross, and J. S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proc. of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’88), pages 221-230, 1988.
26. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the Association for Computing Machinary (JACM), 38: 620-650, 1991.
27. U. Zukowski and B. Freitag. Adding flexibility to query evaluation for modu-larly stratified databases. In Proc. of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP’96). September 2 - 6, 1996, Bonn, Germany, pages 304-319. MIT Press, 1996.
28. U. Zukowski and B. Freitag. The differential fixpoint of general logic programs. In D. Boulanger, U. Geske, F. Giannotti, and D. Seipel, editors, Proc. of the Workshop DDLP’96 on Deductive Databases and Logic Programming. 4th Workshop in conjunction with JICSLP’96. Bonn, Germany, September 2- 6, 1996, volume 295 of GMD-Studien, pages 45-56, St. Augustin, Germany, 1996. GMD.
29. U. Zukowski, B. Freitag, and S. Brass. Transformation-based bottom-up computation of the well-founded model. Technical Report MIP-9620, Universität Passau, 1996.