A space efficient engine for subsumption-based tabled evaluation of logic programs

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

Volumn 1722, Issue , 1999, Pages 284-299

  Johnson, Ernie ^a   Ramakrishnan, C R ^a   Ramakrishnan, I V ^a   Rao, Prasad ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING;

LOGIC PROGRAMS; SPACE EFFICIENT; SPACE USAGE; SUBGOALS; TABLED RESOLUTION; TERMINATION PROPERTY;

COMPUTER CIRCUITS;

EID: 84957639459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_19     Document Type: Conference Paper

References (12)

1. R. Bol and L. Degerstadt. Tabulated resolution for well-founded semantics. In Proc. of the Symp. on Logic Programming, 1993. 284
2. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. JACM, 43(1), 1996. 284
3. S. Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, and T. Swift. Optimizing clause resolution: Beyond unification factoring. In ICLP, 1995.
4. Y. Dong, et al. Fighting livelock in the i-protocol: A comparative study of verification tools. In Tools and Algorithms for the Construction and Analysis of Systems, (TACAS '99). Springer Verlag, 1999.
5. E. Johnson, C. R. Ramakrishnan, I. V. Ramakrishnan, and P. Rao. A space-efficient engine for subsumption-based tabled evaluation of logic programs. Technical report. Available from http://www.cs.sunysb.edu/~ejohnson. 288, 294, 298
6. Y. S. Ramakrishna, et al. Efficient model checking using tabled resolution. In Proceedings of the 9th International Conference on Computer-Aided Verification (CAV '97), Haifa, Israel, July 1997. Springer-Verlag. 284
7. C. R. Ramakrishnan, S. Dawson, and D. S. Warren. Practical program analysis using general purpose logic programming systems - a case study. In ACM Symposium on Programming Language Design and Implementation, 1996. 284
8. I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient access mechanisms for tabled logic programs. JLP, January 1999. 285, 288, 289, 291, 292, 292, 294
9. P. Rao, C. R. Ramakrishnan, and I. V. Ramakrishnan. A thread in time saves tabling time. In JICSLP. MIT Press, 1996. 285, 287
10. H. Tamaki and T. Sato. OLDT resolution with tabulation. In ICLP, pages 84-98. MIT Press, 1986. 284
11. A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. JACM, 38(3), July 1991. 284
12. The XSB Group. The XSB programmer's manual, Version 1.8, 1998. Available from http://www.cs.sunysb.edu/~sbprolog.