Implementation of tabled evaluation with delaying in prolog

IEEE Transactions on Knowledge and Data Engineering

Volumn 9, Issue 4, 1997, Pages 559-574

  Ramesh, R ^b   Chen, Weidong ^a,c  

^a IEEE   (United States)

^b TEXAS INSTRUMENTS   (United States)

^c Southern Methodist University   (United States)

Author keywords

Nonmonotonic reasoning; Program transformation; Query processing; Search strategy; Tabled evaluation

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL LINGUISTICS; PROLOG (PROGRAMMING LANGUAGE); QUERY LANGUAGES; TABLE LOOKUP;

NONMONOTONIC REASONING; PROGRAM TRANSFORMATION APPROACH; TABLED EVALUATION;

LOGIC PROGRAMMING;

EID: 0031190325     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.617050     Document Type: Review

References (21)

1. C. Beeri and R. Ramakrishnan, "On the Power of Magic," J. Logic Programming, vol. 10, nos. 3 and 4, pp. 255-299, 1991.
2. W. Chen, "Extending Prolog with Nonmonotonic Reasoning," J. Logic Programming, vol. 27, no. 2, pp. 169-183, May 1996.
3. W. Chen, T. Swift, and D.S. Warren, "Efficient Top-Down Computation of Queries Under the Well-Founded Semantics," J. Logic Programming, vol. 24, no. 3, pp. 161-199, Sept. 1995.
4. W. Chen and D.S. Warren, "Query Evaluation Under the Well-Founded Semantics," Proc. 12th ACM Symp. Principles Database Systems, pp. 168-179, May 1993.
5. W. Chen and D.S. Warren, "Tabled Evaluation with Delaying for General Logic Programs," J. ACM, vol. 43, no. 1, pp. 20-74, 1996.
6. D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, and C. Zaniolo, "The LDL System Prototype," IEEE Trans. Knowledge and Data Eng., vol. 2, pp. 76-89, 1990.
7. C. Fan and S.W. Dietrich, "Extension Table Built-Ins for Prolog," Software - Practice and Experience, vol. 22, no. 7, pp. 573-597, July 1992.
8. D.B. Kemp, P.J. Stuckey, and D. Srivastava, "Query Restricted Bottom-Up Evaluation of Normal Logic Programs," Proc. Joint Int'l Conf. and Symp. Logic Programming, pp. 288-302. MIT Press, 1992.
9. J.W. Lloyd, Foundations of Logic Programming. New York: Springer-Verlag, second edition, 1987.
10. S. Morishita, "An Alternating Fixpoint Tailored to Magic Programs," Proc. ACM SIGACT-SIGMOD-SIGART Symp. Principles Database Systems, pp. 123-134, May 1993.
11. J.F. Naughton and R. Ramakrishnan, "Bottom-Up Evaluation of Logic Programs," Computational Logic: Essays in Honor of Alan Robinson, J.-L. Lassez and Gordon Plotkin, eds., pp. 640-700, MIT Press, 1991.
12. U. Nilsson, "Goal-Directed Bottom-Up Evaluation of Normal Logic Programs," Proc. Int'l Logic Programming Symp., p. 647, MIT Press, Oct. 1993.
13. I.V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D.S. Warren, "Efficient Tabling Mechanisms for Logic Programs," Proc. Int'l Conf. Logic Programming, L. Sterling, ed., pp. 697-711, MIT Press, 1995.
14. R. Ramakrishnan, D. Srivastava, and S. Sudarshan, "Controlling the Search in Bottom-Up Evaluation," Proc. Joint Int'l Conf. and Symp. Logic Programming, pp. 273-287, MIT Press, 1992.
15. R. Ramakrishnan, D. Srivastava, and S. Sudarshan, "CORAL: Control, Relation, and Logic," Proc. Int'l Conf. Very Large Data Bases, pp. 238-249, Morgan Kaufmann, 1992.
16. K. Sagonas, T. Swift, and D.S. Warren, The XSB Programmer's Manual, State Univ. of New York at Stony Brook, 1993.
17. K. Sagonas, T. Swift, and D.S. Warren, "XSB as an Efficient Deductive Database Engine," Proc. ACM SIGMOD Conf. Management Data, pp. 442-453, 1994.
18. Swedish Inst. of Computer Science, SICStus Prolog User's Manual, sixth edition, Kista, Sweden, Aug. 1992.
19. H. Tamaki and T. Sato, "OLD Resolution with Tabulation," Proc. Int'l Conf. Logic Programming, pp. 84-98, MIT Press, 1986.
20. A. Van Gelder, K.A. Ross, and J.S. Schlipf, "The Well-Founded Semantics for General Logic Programs," J. ACM, vol. 38, no. 3, pp. 620-650, July 1991.
21. L. Vieille, "Recursive Query Processing: The Power of Logic," Theoretical Computer Science, vol. 69, pp. 1-53, 1989.