CHAT: The copy-hybrid approach to tabling

Future Generation Computer Systems

Volumn 16, Issue 7, 2000, Pages 809-830

  Demoen, Bart ^a   Sagonas, Konstantinos ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

PROLOG (PROGRAMMING LANGUAGE); TABLE LOOKUP;

ABSTRACT MACHINES; COPY-HYBRID APPROACH TO TABLING (CHAT);

MACHINE ORIENTED LANGUAGES;

EID: 0033733030     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(99)00092-8     Document Type: Article

References (14)

1. H. Aït-Kaci, Warren's Abstract Machine: A Tutorial Reconstruction, MIT Press, Cambridge, MA, 1991. See also: http://www.isg.sfu.ca/~hak/documents/wam.html.
2. Ali K.A.M., Karlsson R. The muse approach to OR-parallel Prolog. Int. J. Parallel Programming. 19(2):1990;129-162.
3. Bird R.S. Tabulation techniques for recursive programs. ACM Computing Surveys. 12(4):1980;403-417.
4. Chen W., Warren D.S. Tabled evaluation with delaying for general logic programs. J. ACM. 43(1):1996;20-74.
5. B. Demoen, K. Sagonas, CAT: the copying approach to tabling, in: C. Palamidessi, H. Glaser, K. Meinke (Eds.), Principles of Declarative Programming, 10th International Symposium, PLILP'98, Held Jointly with the Sixth International Conference, ALP'98, LNCS, vol. 1490, Pisa, Italy, Springer, Berlin, September 1998, pp. 21-35.
6. B. Demoen, K. Sagonas, Memory management for Prolog with tabling, in: Proceedings of ISMM'98: ACM SIGPLAN International Symposium on Memory Management, Vancouver, BC, Canada, ACM, New York, October 1998, pp. 97-106.
7. B. Demoen, K. Sagonas, CHAT is Θ (SLG-WAM), in: H. Ganzinger, D. McAllester, A. Voronkov (Eds.), Proceedings of the Sixth International Conference on Logic for Programming and Automated Reasoning, LNAI, vol.1705, Tbilisi, Republic of Georgia, Springer, Berlin 1999, pp. 337-357.
8. J. Freire, T. Swift, D.S. Warren, Beyond depth-first strategies: improving tabled logic programs through alternative scheduling. J. Functional and Logic Programming 1998 (3) (1998).
9. Michie D. Memo functions and machine learning. Nature. 218:1968;19-22.
10. Sagonas K., Swift T. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Trans. Programming Languages Syst. 20(3):1998;586-634.
11. K. Sagonas, T. Swift, D.S. Warren, An abstract machine for computing the well-founded semantics, in: M. Maher (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming, Bonn, Germany, MIT Press, Cambridge, MA, September 1996, pp. 274-288.
12. D.H.D. Warren, An abstract Prolog instruction set, Technical Report 309, SRI International, Menlo Park, USA, October 1983.
13. D.H.D. Warren, The SRI model for OR-Parallel execution of Prolog - abstract design and implementation issues, in: Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, IEEE Computer Science Press, September 1987, pp. 92-102.
14. Warren D.S. Memoing for logic programs. Commun. ACM. 35(3):1992;93-111.