Linear tabling strategies and optimizations

Theory and Practice of Logic Programming

Volumn 8, Issue 1, 2008, Pages 81-109

  Zhou, Neng Fa ^a   Sato, Taisuke ^b   Shen, Yi Dong ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Linear tabling; Memoization; Prolog; Recursion; Semi naive evaluation; Tabling

Indexed keywords

LINEAR TABLING STRATEGIES; MEMOIZATION; PROBABILISTIC LEARNING; PROGRAM ANALYSIS; PROLOGS;

DATABASE SYSTEMS; MODEL CHECKING; PROBABILISTIC LOGICS; RECURSIVE FUNCTIONS; THEOREM PROVING;

LOGIC PROGRAMMING;

EID: 36849085355     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S147106840700316X     Document Type: Article

References (38)

1. APT, K., BLAIR, H. A. AND WALKER, A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, San Francisco, 89-142.
2. BANCILHON, F. AND RAMAKRISHNAN, R. 1986. An amateur's introduction to recursive query processing strategies. In Proc. of ACM SIGMOD '86, 16-52.
3. CHEN, W. AND WARREN, D. S. 1996. Tabled evaluation with delaying for general logic programs. Journal of the ACM 43, 1, 20-74.
4. DAWSON, S., RAMAKRISHNAN, C. R. AND WARREN, D. S. 1996. Practical program analysis using general purpose logic programming systems - A case study. ACM SIGPLAN Notices 31, 5, 117-126.
5. DEMOEN, B. AND SAGONAS, K. 1998. CAT: The copying approach to tabling. In Proc. of Programming Language Implementation and Logic Programming (PLILP), LNCS 1490, 21-35.
6. DEMOEN, B. AND SAGONAS, K. 1999. CHAT: The copy-hybrid approach to tabling. In Proc. of Practical Aspects of Declarative Programming (PADL), LNCS 1551, 106-121.
7. DIETRICH, S. W. 1987. Extension tables: Memo relations in logic programming. In IEEE Fourth Symposium on Logic Programming. 264-272.
8. EISNER, J., GOLDLUST, E. AND SMITH, N. A. 2004. Dyna: A declarative language for implementing dynamic programs. In Proc. of the 42nd Annual Meeting of ACL.
9. FREIRE, J., SWIFT, T. AND WARREN, D. S. 1998. Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies. Journal of Functional and Logic Programming.
10. GUO, H.-F. AND GUPTA, G. 2001. A simple scheme for implementing tabled logic of programming systems based on dynamic reordering of alternatives. In Proc. of International Conference on Logic Programming (ICLP), LNCS 2237, 181-195.
11. JOHNSON, M. 1995. Memoization of top down parsing. Computational Linguistics 21, 3.
12. LIU, M. 1999. Deductive database languages: Problems and solutions. ACM Computing Surveys 31, 1, 27-62.
13. LLOYD, J. W. 1988. Foundation of Logic Programming, 2nd ed. Springer-Verlag, New York.
14. MICHIE, D. 1968. "memo" functions and machine learning. Nature 218, 6, 19-22.
15. NIELSON, F., NIELSON, H. R., SUN, H., BUCHHOLTZ, M., HANSEN, R. R., PILEGAARD, H. AND SEIDL, H. 2004. The succinct solver suite. In Proc. Tools and Algorithms for the Construction and Analysis of Systems: 10th International Conference (TACAS), LNCS 2988, 251-265.
16. PIENTKA, B. December 2003. Tabled Higher-order Logic Programming. PhD thesis, Technical Report CMU-CS-03-185, Carnegie Mellon University, Pittsburgh.
17. PRZYMUSINSKI, T. C. 1989. Every logic program has a natural stratification and an iterated least fixed point model. In PODS '89: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, New York, 11-21.
18. RAMAKRISHNAN, C. Feb. 2002. Model checking with tabled logic programming. In ALP News Letter. ALP.
19. RAMAKRISHNAN, I., RAO, P., SAGONAS, K., SWIFT, T. AND WARREN, D. 1998. Efficient access mechanisms for tabled logic programs. Journal of Logic Programming 38, 31-54.
20. RAMAKRISHNAN, R. AND ULLMAN, J. D. 1995. A survey of deductive database systems. Journal of Logic Programming 23, 2, 125-149.
21. ROCHA, R., SILVA, F. AND COSTA, V. S. 2005a. Dynamic mixed-strategy evaluation of tabled logic programs. In Proc. of International Conference on Logic Programming (ICLP), 250-264.
22. ROCHA, R., SILVA, F. AND COSTA, V. S. 2005b. On applying or-parallelism and tabling to logic programs. Theory and Practice of Logic Programming (TPLP) 5, 1 & 2, 161-205.
23. SAGONAS, K. AND SWIFT, T. 1998. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Transactions on Programming Languages and Systems 20, 3, 586-634.
24. SAGONAS, K., SWIFT, T. AND WARREN, D. S. 1994. XSB as a deductive database. SIGMOD Record (ACM Special Interest Group on Management of Data) 23, 2, 512-512.
25. SATO, T. AND KAMEYA, Y. 2001. Parameter learning of logic programs for symbolic-statistical modeling. Journal of Artificial Intelligence Research, 391-454.
26. SHEN, Y.-D., YUAN, L., YOU, J. AND ZHOU, N.-F. 2001. Linear tabulated resolution based on Prolog control strategy. Theory and Practice of Logic Programming (TPLP) 1, 1, 71-103.
27. SHEN, Y.-D., YUAN, L.-Y., YOU, J.-H. AND ZHOU, N.-F. 1999. Linear tabulated resolutions for the well-founded semantics. In Proc. of Logic Programming and Nonmonotonic Reasoning, 192-205.
28. SOMOGYI, Z. AND SAGONAS, K. in press. Tabling in mercury: Design and implementation. In Proc. of Practical Aspects of Declarative Programming (PADL) 15. Springer-Verlag, New York.
29. TAMAKI, H. AND SATO, T. 1986. OLD resolution with tabulation. In Proc. of the Third International Conference on Logic Programming, E. Shapiro, Ed. 84-98, LNCS 225, Springer.
30. ULLMAN, J. D. 1988. Database and Knowledge-Base Systems, Vols. 1 & 2. Computer Science Press, New York.
31. URATANI, N., TAKEZAWA, T., MATSUO, H. AND MORITA, C. 1994. ATR Integrated Speech and Language Database [Technical Report TR-IT-0056], ATR Interpreting Telecommunications Research Laboratories. In Japanese, ATR.
32. WARREN, D. S. 1992. Memoing for logic programs. Communications of the ACM, Special Section on Logic Programming 35, 93-111.
33. WARREN, D. S. 1999. Programming in Tabled Prolog [DRAFT 1]. url: http://www.cs.sunysb.edu/ warren/xsbbook/book.html. Accessed. April 1, 2006.
34. ZHOU, N.-F. 1996. Parameter passing and control stack management in Prolog implementation revisited. ACM Transactions on Programming Languages and Systems 18, 6, 752-779.
35. ZHOU, N.-F. AND SATO, T. 2003. Efficient fixpoint computation in linear tabling. In Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, 275-283.
36. ZHOU, N.-F., SATO, T. AND HASIDA, K. 2003. Toward a high-performance system for symbolic and statistical modeling. In IJCAI Workshop on Learning Statistical Models from Relational Data, 153-159.
37. ZHOU, N.-F., SHEN, Y.-D. AND SATO, T. 2004. Semi-naive evaluation in linear tabling. In Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, 90-97.
38. ZHOU, N.-F., SHEN, Y.-D., YUAN, L.-Y. AND YOU, J.-.H. 2000. Implementation of a linear tabling mechanism. In Proc. of Practical Aspects of Declarative Programming (PADL), LNCS 1753, 109-123.