CHAT is θ(SLG-WAM)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1705 LNAI, Issue , 1999, Pages 337-357

  Demoen, Bart ^a   Sagonas, Konstantinos ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

A-PROLOG; EXECUTION ENVIRONMENTS; LOGIC PROGRAMMING SYSTEMS; SCHEDULING STRATEGIES; TWO SOURCES; UNDERLYING PRINCIPLES; WORST-CASE COMPLEXITY;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84886281851     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_21     Document Type: Conference Paper

References (15)

1. E. Borger and D. Rosenzweig. The WAM - Definition and compiler correctness. In C. Beierle cind L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, pages 20-90. Elsevier Science, North-Holland, 1995.
2. S. Dawson, C- R. Ramakrishnan, itnd D. S. Warren. Practical program analysis using general purpose logic programming systems - A case study. In Proceedings of the ACM SIGPLAN PLDI, pages 117-126, Philadelphia, May 1996. ACM Press.
3. B. Demoen and K. Sagonas. CAT: the Copying Approach to Tabling. In C. Padamidessi, H. Gleiser, and K. Meinke, editors. Principles of Declarative Programming (PLILP'98), number 1490 in LNCS, pages 21-35, Sept. 1998. Springer.
4. B. Demoen and K. Sagonas. Memory Mansigement for Prolog with Tabling. In Proceedings of ISMM'98: ACM SIGPLAN International Symposium on Memory Management, pages 97-106, Vancouver, B.C., Canada, Oct. 1998. ACM Press.
5. B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. In G. Gupta, editor. Practical Aspects of Declarative Languages (PADL), number 1551 in LNCS, pages 106-121, San Antonio, Texas, Jan. 1999. Springer.
6. J. Preire, T. Swift, and D. S. Warren. Beyond depth-first strategies: Improving tabled logic progrcims through alternative scheduUng. JFLP, 1998(3), Apr. 1998.
7. G. Gupta and B. Jayfurzunan. Analysis of Or-peirallel execution models. ACM Trans. Prog. Lang. Syst., 15(4):659-680, Sept. 1993.
8. P. Kursawe. How to invent a Prolog machine. New Gen. Comp., 5(1):97-114, 1987.
9. Y. S. Ramakrishna, C. R. Ramcikrishnan, I. V. Ramakrishnan, S. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings of the 9th CAV, number 1254 in LNCS, pages 143-154, July 1997. Springer.
10. D. M. RussinofF. A verified Prolog compiler for the Warren Abstract Machine. J. of Logic Program., 13(4):367-12, Aug. 1992.
11. K. Sagonas and T. Swift. An abstrsM:t machine for tabled execution of fixed-order stratified logic programs. ACM Trans. Prog. Lang. Syst., 20(3):586-634, May 1998.
12. K. Sagonas, T. Swift, and D. S. Wauren. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD'94, pages 442-453, May 1994. ACM.
13. P. Vem Roy. 1983-1993: The wonder years of sequential Prolog implementation. J. of Logic Program., 19/20:385-441, May/July 1994.
14. D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI International, Menlo Park, U.S.A., Oct. 1983.
15. D. S. Wcirren. Efficient Prolog memory management for flexible control strategies. In Proceedings of the 1984 Symp. Logic Program., pages 198-202, Feb. 1984. IEEE