Memoing evaluation by source-to-source transformation

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

Volumn 1048, Issue , 1996, Pages 17-32

  Wunderwald, Jens E ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; INTELLIGENT DATABASES;

BOTTOM UP; MAGIC SETS; META-INTERPRETERS; SOURCE-TO-SOURCE TRANSFORMATIONS; TOPDOWN;

LOGIC PROGRAMMING;

EID: 84949217347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60939-3_2     Document Type: Conference Paper

References (15)

1. F. Bancilhon and R. Ramakrishnan. An amateur’s introduction to recursive query processing strategies, invited paper. In Proceedings of SIGMOD. 1986.
2. C. Beeri and R. Ramakrishnan. On the power of magic. The Journal of Logic Programming, 10:255-300, January 1991.
3. F. Bry. Query evaluation in recursive databases: bottom-up and top-down reconciled. Data & Knowledge Engineering, 5:289-312, 1990.
4. W. Burgard. Goal-Directed Forward Chaining for Logic Programs. PhD thesis, Universität Bonn, 1991.
5. K. De Bosschere and P. Tarau. Blackboard Communication in Logic Programming. In Proceedings of the PARCO’93 Conference, Grenoble, France, September 1993.
6. S.W. Dietrich. Extension tables: Memo relations in logic programming. In Proceedings of the 1987 Symposium on Logic Programming, pages 264-273, 1987.
7. J. Gallagher. Transforming logic programs by specialising interpreters. In European Conference on Artificial Intelligence, pages 109-122, 1986.
8. J. F. Naughton and R. Ramakrishnan. How to forget the past without repeating it. In 16th International Conference on Very Large Data Bases, 1990.
9. R. Ramakrishnan. Magic templates: A spellbinding approach to logic programs. In Robert A. Kowalski and Kenneth A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 140-159, Seatle, 1988. ALP, IEEE, The MIT Press.
10. R. Ramesh and Weidong Chen. A portable method of integrating slg resolution into prolog systems. In Logic Programming - Proceedings of the 1994 International Symposium, pages 618-632. The MIT Press, 1994.
11. H. Schütz. Tupelweise Bottom-up-Auswertung von Logikprorammen. PhD thesis, Technische Universität München, 1993.
12. K. Sagonas, T. Swift, and D.S. Warren. XSB as an efficient deductive database engine. In Proceedings of SIGMOD. 1994.
13. D. S. Warren. Memoing for logic programs with applications to abstract interpretation and partial deduction. In Communications of ACM. 1992.
14. J. E. Wunderwald. Adding Bottom-up Evaluation to Prolog (Preliminary Title). PhD thesis, Technische Universität München, to appear.
15. J. E. Wunderwald. Logikprogrammieren mit frei wählbarer Auswertungsrichtung. In Proceedings of the Tenth Logic Programming Workshop, Zürich, 1994.