On a tabling engine that can exploit or-parallelism

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

Volumn 2237, Issue , 2001, Pages 43-58

  Rocha, Ricardo ^a   Silva, Fernando ^a   Costa, Vìtor Santos ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Or parallelism; Parallel logic programming; Tabling

Indexed keywords

ENGINES; LOGIC PROGRAMMING; MODEL CHECKING;

IMPLEMENTATION TECHNIQUES; LINEAR SPEED-UP; MULTI-PROCESSORS; OR-PARALLELISM; PARALLEL COMPLETIONS; PARALLEL ENGINES; PARALLEL LOGIC PROGRAMMING; TABLING;

COMPUTER CIRCUITS;

EID: 23044528655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_11     Document Type: Conference Paper

References (18)

1. K. Ali and R. Karlsson. The Muse Approach to OR-Parallel Prolog. Journal of Parallel Programming, 19(2):129–162, 1990.
2. Jeff Bonwick. The Slab Allocator: An Object-Caching Kernel Memory Allocator. In USENIX Summer 1994, pages 87–98, 1994.
3. W. Chen and D. S. Warren. Query Evaluation under the Well Founded Semantics. In Proceedings of PODS, pages 168–179, 1993.
4. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20–74, 1996.
5. B. Demoen and K. Sagonas. CAT: the Copying Approach to Tabling. In Proceedings of PLILP, number 1490 in LNCS, pages 21–35. Springer-Verlag, 1998.
6. B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approac h to Tabling. In Proceedings of PADL, number 1551 in LNCS, pages 106–121. Springer-Verlag, 1999.
7. J. Freire, R. Hu, T. Swift, and D. S. Warren. Exploiting Parallelism in Tabled Evaluations. In Proceedings of PLILP, pages 115–132. Springer-Verlag, 1995.
8. J. Freire, T. Swift, and D. S. Warren. Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies. In Proceedings of PLILP, pages 243–258. Springer-Verlag, 1996.
9. Hai-Feng Guo and G. Gupta. A New Tabling Scheme with Dynamic Reordering of Alternatives. In Workshop on Parallelism and Implementation Technology for (Constraint) Logic Languages, 2000.
10. I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient Tabling Mechanisms for Logic Programs. In Proceedings of ICLP, pages 687–711. The MIT Press, 1995.
11. R. Rocha. On Applying Or-Parallelism and Tabling to Logic Programs. PhD thesis, Computer Science Department, University of Porto, 2001.
12. R. Rocha, F. Silva, and V. Santos Costa. Or-Parallelism within Tabling. In Proceedings of PADL, number 1551 in LNCS, pages 137–151. Springer-Verlag, 1999.
13. R. Rocha, F. Silva, and V. Santos Costa. Yap Or: an Or-Parallel Prolog System Basedon Environment Copying. In Proceedings of EPIA, number 1695 in LNAI, pages 178–192. Springer-Verlag, 1999.
14. R. Rocha, F. Silva, and V. Santos Costa. Yap Tab: A Tabling Engine Designedto Support Parallelism. In Proceedings of TAPD, pages 77–87, 2000.
15. K. Sagonas and T. Swift. An Abstract Machine for Tabled Execution of Fixed- Order Stratified Logic Programs. Journal of ACM Transactions on Programming Languages and Systems, 1998.
16. Vìtor Santos Costa. Optimising Bytecode Emulation for Prolog. In Proceedings of PPDP, number 1702 in LNCS, pages 261–267. Springer-Verlag, 1999.
17. David H. D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.
18. Neng-Fa Zhou. Implementation of a Linear Tabling Mechanism. In Proceedings of PADL, number 1753 in LNCS, pages 109–123. Springer Verlag, 2000.