On the completeness of naive memoing in prolog

New Generation Computing

Volumn 15, Issue 2, 1997, Pages 141-162

  Dietrich, Suzanne Wagner ^a,b   Fan, Changguan ^a,c,d  

^a Arizona State University   (United States)

^b STONY BROOK UNIVERSITY   (United States)

^c Regenisys Corporation   (United States)

^d Shanghai Inst of Railway Technology   (China)

Author keywords

Logic Programming; Memoing; Recursion

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; PERT; PROLOG (PROGRAMMING LANGUAGE); QUERY LANGUAGES; RECURSIVE FUNCTIONS;

NAIVE MEMOING;

LOGIC PROGRAMMING;

EID: 0030680615     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037235     Document Type: Article

References (26)

1. Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J., "Magic Sets and Other Strange Ways to Implement Logic Programs," Symposium on Principles of Database Systems, ACM, pp. 1-15, 1986.
2. Bancilhon, F. and Ramakrishnan, R., "An Amateur's Introduction to Recursive Query Processing Strategies," SIGMOD, ACM, pp. 1-15, 1986.
3. Bird, R. S., "Tabulation Techniques for Recursive Programs," Computing Surveys, 12, 4, pp. 403-417, 1980.
4. Bry, F., "Query Evaluation in Deductive Databases: Bottom-up and Top-down Reconciled," Proceedings of the First International Conference on Deductive and ObjectOriented Databases, pp. 25-44, December 1989.
5. Chen, W. and Warren, D. S., "Query Evaluation under the Well-Founded Semantics," Symposium on Principles of Database Systems, ACM, pp. 168-179, 1993.
6. Dietrich, S. W., "Extension Tables: Memo Relations in Logic Programming," Symposium on Logic Programming, IEEE, pp. 264-272, 1987.
7. Dietrich, S. W., "Shortest Path by Approximation in Logic Programming," ACM Letters on Programming Languages and Systems, 1, 2, pp. 119-137, June 1992.
8. Fagin, B. S. and Despain, A. M., "Goal Caching in Prolog," Hawaiian International Conference on System Sciences, IEEE, pp. 277-281, 1986.
9. Fan, C. and Dietrich, S. W., "Extension Table Built-ins for Prolog," Software Practice and Experience, pp. 573-597, July 1992.
10. Han, J., "Compilation-Based List Processing in Deductive Databases," the International Conference on Extending Database Technology, pp. 104-119, March 1992.
11. Keller, R. M., "Applicative Caching," ACM Transactions on Programming Languages and Systems, 8, 1, pp. 88-108, January 1986.
12. Kifer, M., "On Safety, Domain Independence and Capturability of Database Queries," Proc. of the 3rd International Conference on Data and Knowledge Bases: Improving Usability and Responsiveness, IPA and ACM, pp. 405-415, June, 1988.
13. Lindholm, T. G. and O'Keefe, R. A., "Efficient Implementation of a Defensible Semantics for Dynamic Prolog Code," Proc. of the International Conference on Logic Programming, ACM, pp. 21-39, 1987.
14. Lloyd, J. W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, New York, NY, 1987.
15. Naughton, J. F., "One-Sided Recursion," Symposium on Principles of Database Systems, ACM, pp. 340-348, 1987.
16. Naughton, J. F., Ramakrishnan, R., Sagiv, Y., and Ullman, J. D., "Efficient Evaluation of Right-, Left-, and Multi-Linear Rules," SIGMOD, ACM, pp. 235-242, 1989.
17. Ramakrishnan R., Bancilhon, F., and Silberschatz, A., "Safety of Recursive Horn Clauses with Infinite Relations," Symposium on Principles of Database Systems, ACM, pp. 328-339, 1987.
18. Sagonas, K., Swift, T., and Warren, D. S., "XSB as an Efficient Deductive Database Engine," Proc. of the 1994 ACM SIGMOD International Conference on the Management of Data, ACM, pp. 442-453, 1994.
19. Tamaki, H. and Sato, T., "Unfold/Fold Transformation of Logic Programs," Proc. of the International Conference on Logic Programming, ACM, pp. 127-138, July 1984.
20. Tamaki, H. and Sato, T., "OLD Resolution with Tabulation," Proc. of the International Conference on Logic Programming, ACM, pp. 84-98, July 1986.
21. Ullman, J. D., Principles of Database and Knowledge-Base Systems, Vol. 1. Computer Science Press, Rockville, Md, 1988.
22. Ullman, J. D., Principle of Database and Knowledge-Base Systems, Vol. 2: The New Technologies, Computer Science Press, Rockville, Md, 1989.
23. Vieille, L., "A Database-Complete Proof Procedure Based on SLD-Resolution," Proc. of the International Conference on Logic Programming, ACM, pp. 74-103, 1987.
24. Warren, D. S., "The XWAM: A Machine that Integrates Prolog and Database Query Evaluation," Architecture Workshop of the North American Conference on Logic Programming, ALP, 1990.
25. Warren, D. S., "Memoing for Logic Programs," Communications of the ACM, 35, 3, ACM, pp. 94-111, March 1992.
26. Zhang, W. and Yu, C. T., "A Necessary Condition for a Double Recursive Rule to Be Equivalent to a Linear Recursive Rule," SIGMOD, ACM, pp. 345-356, 1987.