Suspending and resuming computations in engines for SLG evaluation

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

Volumn 2257, Issue , 2002, Pages 332-349

  Castro, Luís F ^a   Swift, Terrance ^a   Warren, David S ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINES; FORESTRY; PROLOG (PROGRAMMING LANGUAGE);

ACCESS METHODS; COMPUTATION PATHS; ENVIRONMENT MANAGEMENT; MEMORY MANAGEMENT; PROLOG PROGRAMS; SCHEDULING STRATEGIES; SLD RESOLUTION;

ENVIRONMENTAL MANAGEMENT;

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

References (19)

1. J. J. Alferes, F. Azevedo, P. Barahona, C. Damáasio, and T.. Logic programming techniques for solving circuit diagnosis. Technical report, Universidade Nova de Lisboa, 2001.
2. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20–74, January 1996.
3. B. Demoen and K. Sagonas. CAT: A copying approach to tabling. In PLILP, pages 21–35, 1998.
4. B. Demoen and K. Sagonas. Chat is θ(slg-wam). In Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, pages 337–357, 1999.
5. B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. In Practical Aspects of Declarative Languages: First International Workshop, 1999.
6. J. Freire, T. Swift, and D. S. Warren. Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies. Journal of Functional and Logic Programming, 1998(3), 1998.
7. Haifeng Guo and Gopal Gupta. A new tabling scheme with dynamic reordering of alternatives. In Workshop on Parallelism and Implementation Technology for (Constraint) Logic Languages, July 2000.
8. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings on the Conference on Automated Verification, pages 143–154, 1997.
9. I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient access mechanisms for tabled logic programs. Journal of Logic Programming, 38(1):31–55, January 1999.
10. R. Rocha. On applying Or-parallelism and tabling to logic programs. PhD thesis, Universidade do Porto, 2001.
11. K. Sagonas and T. Swift. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM TOPLAS, 20(3):586–635, May 1998.
12. Vítor Santos Costa. Optimising bytecode emulation for prolog. In LNCS 1702, Proceedings of PPDP’99, pages 261–267. Springer-Verlag, September 1999.
13. Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, and Neng-Fa Zhou. Linear tabulated resolution based on Prolog control strategy. Journal of Theory and Practice of Logic Programming, 1(1):71–122, 2001.
14. T. Swift. Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence, 25(3-4):201–240, 1999.
15. A. van Gelder, K. A. Ross, and J. S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.
16. D. S. Warren. Efficient Prolog memory management for flexible control. In ILPS, pages 198–202, 1984.
17. D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI, 1983.
18. G. Yang and M. Kifer. Flora: Implementing an efficient DOOD system using a tabling logic engine. In DOOD’2000: 6th International Conference on Rules and Objects in Databases, 2000.
19. Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, and Jia-Huai You. Implementation of a linear tabling mechanism. In Proceedings of PADL 2000, pages 109–123, 2000.