Efficient goal directed bottom-up evaluation of logic programs

Journal of Logic Programming

Volumn 38, Issue 3, 1999, Pages 355-370

  Codish, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Bottom up evaluation; Magic sets

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE REUSABILITY; COMPUTER SOFTWARE SELECTION AND EVALUATION; MATHEMATICAL MODELS; PROLOG (PROGRAMMING LANGUAGE);

MAGIC-SET TRANSFORMATION;

LOGIC PROGRAMMING;

EID: 0033101766     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10024-9     Document Type: Article

References (27)

1. K.R. Apt, Introduction to logic programming, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, Elsevier, Amsterdam; MIT Press, Cambridge, 1990, pp. 495-574.
2. F. Bancilhon, D. Maier, Y. Sagiv, J. Ullman, Magic sets and other strange ways to implement logic programs, in: Proceedings of the Fifth ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, 1986, pp. 1-15.
3. R. Barbuti, R. Giacobazzi, G. Levi, A general framework for semantics-based bottom-up abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems 15 (1) (1993) 133-181.
4. C. Beeri, R. Ramakrishnan, On the power of magic, The Journal of Logic Programming 10 (3/4) (1991) 255-300.
5. A. Bossi, M. Gabrielli, G. Levi, M. Martelli, The s-semantics approach: Theory and applications, The Journal of Logic Programming 19/20 (1994) 149-198.
6. M. Codish, D. Dams, E. Yardeni, Bottom-up abstract interpretation of logic programs, Journal of Theoretical Computer Science 124 (1994) 93-125.
7. M. Codish, B. Demoen, Analysing logic programs using "prop"-ositional logic programs and a magic wand, The Journal of Logic Programming 25 (3) (1995) 249-274.
8. M. Codish, V. Lagoon, Type Dependencies for Logic Programs using ACI-unification, Proceedings of the 1996 Israeli Symposium on Theory of Computing and Systems, IEEE Press, New York, 1996, pp. 136-145.
9. M. Codish, C. Taboch, A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints, in: J. Hanus, M. Heering, K. Meinke (Eds.), Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming, Southhampton, UK, 1997, LNCS 1290, Springer, Berlin, pp. 31-45.
10. M. Codish, V. Lagoon, F. Bueno, An algebraic approach to sharing analysis of logic programs, in: Proceedings of the Fourth International Static Analysis Symposium, LNCS 1302, Springer, Berlin, 1997.
11. S. Debray, R. Ramakrishnan, Abstract interpretation of logic programs using magic transformations, The Journal of Logic Programming 18 (2) (1994) 149-176.
12. J. Earley, An efficient context-free parsing algorithm, Communications of the ACM 13 (2) (1970) 94-102.
13. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoretical Computer Science 69 (3) (1989) 289-318.
14. J.P. Gallagher, D.A. de Waal, Fast and precise regular approximations of logic programs, in: P. Van Hentenryck (Ed.), Logic Programming - Proceedings of the Eleventh International Conference on Logic Programming, Massachusetts Institute of Technology, MIT Press, Cambridge, MA, 1994, pp. 599-613.
15. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
16. M.J. Maher, R. Ramakrishnan, Deja vu in fixpoints of logic programs, Technical Report TR 893, Computer Sciences Department, University of Wisconsin-Madison, 1989.
17. R. Ramakrishnan, D. Srivastava, S. Sudarshan, Rule ordering in bottom-up fixpoint evaluation of logic programs, IEEE Transactions on Knowledge and Data Engineering 6 (4) (1994) 501-517 (A shorter version appeared in VLDB, 1990).
18. R. Ramakrishnan, J. Ullman, A survey of deductive database systems, The Journal of Logic Programming 23 (2) (1995) 125-149.
19. R. Ramakrishnan, Parallelism in logic programs, in: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990, pp. 246-260.
20. R. Ramakrishnan, Magic templates: A spellbinding approach to logic programs, The Journal of Logic Programming 11 (3 and4) (1991) 189-216.
21. R. Ramakrishnan, D. Srivastava, S. Sudarshan, Efficient bottom-up evaluation of logic programs, in: J. Vandewalle,(Ed.), The State of the Art in Computer Systems and Software Engineering, Kluwer Academic Publishers, Dordrecht, 1992.
22. K. Sagonas, T. Swift, D.S. Warren. The XSB programmer's manual version 1.5.0. http://www.cs. sunysb.edu/ sbprolog /manual/manual.html, February 1996.
23. K. Sagonas, D.S. Warren, Personal communication, 1997.
24. H. Seki, On the power of Alexander templates, in: Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems, Philadelphia, Pennsylvania, 1989.
25. S. Sudarshan, R. Ramakrishnan, Optimizations of bottom-up evaluation with non-ground terms, in: D. Miller (Ed.), Logic Programming - Proceedings of the 1993 International Symposium, Massachusetts Institute of Technology, Cambridge, Massachusetts 021-42, MIT Press, Cambridge, MA, 1993, pp. 557-574.
26. J. Ullman, Principles of Database and Knowledge - Base Systems, vol. 1, Computer Science Press, Rockville, MD, 1988.
27. J. Wunderwald, Memoing evaluation by source-to-source transformation, in: M. Proietti (Ed.), Proceedings of the Fifth International Workshop on Logic Program Synthesis and Transformation, LNCS 1048, Springer, Berlin, 1995, pp. 17-32.