On applying or-parallelism and tabling to logic programs

Theory and Practice of Logic Programming

Volumn 5, Issue 1-2, 2005, Pages 161-205

  Rocha, Ricardo ^a   Silva, Fernando ^a   Costa, Vitor Santos ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Implementation; Or parallelism; Performance; Tabling

Indexed keywords

DECISION TABLES; EXPERT SYSTEMS; KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS; LOGIC GATES; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; PRODUCTIVITY;

IMPLEMENTATION; OR-PARALLELISM; SLD RESOLUTION; TABLING;

LOGIC PROGRAMMING;

EID: 14544285474     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002030     Document Type: Article

References (57)

1. ALI, K. AND KARLSSON, R. 1990a. Full Prolog and Scheduling OR-Parallelism in Muse. International Journal of Parallel Programming 19, 6, 445-475.
2. ALI, K. AND KARLSSON, R. 1990b. The Muse Approach to OR-Parallel Prolog. International Journal of Parallel Programming 19, 2, 129-162.
3. ALI, K. AND KARLSSON, R. 1992. Scheduling Speculative Work in MUSE and Performance Results. International Journal of Parallel Programming 21, 6, 449-476.
4. APT, K. AND BOL, R. 1994. Logic Programming and Negation: A Survey. Journal of Logic Programming 19 & 20, 9-72.
5. BEAUMONT, A. AND WARREN, D. H. D. 1993. Scheduling Speculative Work in Or-Parallel Prolog Systems. In Proceedings of the 10th International Conference on Logic Programming. MIT Press, Budapest, Hungary, pp. 135-149.
6. BONWICK, J. 1994. The Slab Allocator: An Object-Caching Kernel Memory Allocator. In Proceedings of the Usenix Summer 1994 Technical Conference. Usenix Association, Boston, USA, 87-98.
7. CHEN, W., SWIFT, T., AND WARREN, D. S. 1995. Efficient Top-Down Computation of Queries under the Well-Founded Semantics. Journal of Logic Programming 24, 3, 161-199.
8. CHEN, W. AND WARREN, D. S. 1996. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM 43, 1, 20-74.
9. CIEPIELEWSKI, A. 1991. Scheduling in Or-parallel Prolog Systems: Survey and Open Problems. International Journal of Parallel Programming 20, 6, 421-451.
10. DAMÁSIO, C. 2000. A distributed tabling system. In Proceedings 2nd Conference on Tabulation in Parsing and Deduction. Vigo, Spain, pp. 65-75.
11. DEMOEN, B. AND SAGONAS, K. 1998. CAT: the Copying Approach to Tabling. In Proceedings 10th International Symposium on Programming Language Implementation and Logic Programming. Number 1490 in Lecture Notes in Computer Science. Springer-Verlag, Pisa, Italy, pp. 21-35.
12. DEMOEN, B. AND SAGONAS, K. 2000. CHAT: The Copy-Hybrid Approach to Tabling. Future Generation Computer Systems 16, 7, 809-830.
13. FREIRE, J., Hu, R., SWIFT, T. AND WARREN, D. S. 1995. Exploiting Parallelism in Tabled Evaluations. In Proceedings 7th International Symposium on Programming Languages: Implementations, Logics and Programs. Number 982 in Lecture Notes in Computer Science. Springer-Verlag, Utrecht, The Netherlands, pp. 115-132.
14. FREIRE, J., SWIFT, T. AND WARREN, D. S. 1996. Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies. In Proceedings of the Eight International Symposium on Programming Language Implementation and Logic Programming. Number 1140 in Lecture Notes in Computer Science. Springer-Verlag, Aachen, Germany, 243-258.
15. Guo, H.-F. AND GUPTA, G. 2001. A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives. In Proceedings 17th International Conference on Logic Programming. Number 2237 in Lecture Notes in Computer Science. Springer-Verlag, Paphos, Cyprus, pp. 181-196.
16. Guo, H.-F. AND GUPTA, G. 2002. Cuts in Tabled Logic Programming. In Proceedings Colloquium on Implementation of Constraint and LOgic Programming Systems. Copenhagen, Denmark.
17. GUPTA, G., PONTELLI, E., ALI, K., CARLSSON, M. AND HERMENEGILDO, M. V. 2001. Parallel Execution of Prolog Programs: A Survey. ACM Transactions on Programming Languages and Systems 23, 4, 472-602.
18. HAUSMAN, B. 1990. Pruning and Speculative Work in OR-Parallel PROLOG. PhD thesis, The Royal Institute of Technology, Stockholm, Sweden.
19. HERMENEGILDO, M. V. 1986. An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel. Ph.D. thesis, University of Texas, Austin, TX.
20. HERMENEGILDO, M. V. AND GREENE, K. 1991. The &-Prolog System: Exploiting Independent And-Parallelism. New Generation Computing 9, 3, 4, 233-257.
21. Hu, R. 1997. Efficient Tabled Evaluation of Normal Logic Programs in a Distributed Environment. PhD thesis, Department of Computer Science, State University of New York, Stony Brook, USA.
22. JOHNSON, E., RAMAKRISHNAN, C. R., RAMAKRISHNAN, I. V. AND RAO, P. 1999. A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs. In Proceedings 4th Fuji International Symposium on Functional and Logic Programming. Number 1722 in Lecture Notes in Computer Science. Springer-Verlag, Tsukuba, Japan, pp. 284-300.
23. KOWALSKI, R. 1979. Logic for Problem Solving. Artificial Intelligence Series. North-Holland.
24. KOZEN, D. 1983. Results on the propositional μ-calculus. Theoretical Computer Science 27, 333-354.
25. L. F. CASTRO, D. S. W. 2003. Approximate Pruning in Tabled Logic Programming. In Proceedings of the 12th European Symposium on Programming. Lecture Notes in Computer Science, vol. 2618. Springer Verlag, Warsaw, Poland, pp. 69-83.
26. LUSK, E., BUTLER, R., Disz, T., OLSON, R., OVERBEEK, R., STEVENS, R., WARREN, D. H. D., CALDERWOOD, A., SZEREDI, P., HARIDI, S., BRAND, P., CARLSSON, M., CIEPIELEWSKI, A. AND HAUSMAN, B. 1988. The Aurora Or-Parallel Prolog System. In Proceedings International Conference on Fifth Generation Computer Systems. Institute for New Generation Computer Technology, Tokyo, Japan, pp. 819-830.
27. MARQUES, R., SWIFT, T. AND CUNHA, J. 2000. An Architecture for a Multi-threaded Tabling Engine. In Proceedings of the 2nd Conference on Tabulation in Parsing and Deduction. Vigo, Spain, pp. 141-154.
28. MATTERN, F. 1989. Global Quiescence Detection based on Credit Distribution and Recovery. Information Processing Letters 30, 4, 195-200.
29. MICHIE, D. 1968. Memo Functions and Machine Learning. Nature 218, 19-22.
30. MILNER, R. 1989. Communication and Concurrency. Prentice Hall.
31. PONTELLI, E. AND GUPTA, G. 1997. Implementation Mechanisms for Dependent And-Parallelism. In Proceedings of the 14th International Conference on Logic Programming. MIT Press, Leuven, Belgium, pp. 123-137.
32. RAMAKRISHNAN, C. R., RAMAKRISHNAN, I. V., SMOLKA, S., DONG, Y., Du, X., ROYCHOUDHURY, A. AND VENKATAKRISHNAN, V. 2000. XMC: A Logic-Programming-Based Verification Toolset. In Proceedings 12th International Conference on Computer Aided Verification. Number 1855 in Lecture Notes in Computer Science. Springer-Verlag, Chicago, IL, pp. 576-580.
33. RAMAKRISHNAN, I. V., RAO, P., SAGONAS, K., SWIFT, T. AND WARREN, D. S. 1999. Efficient Access Mechanisms for Tabled Logic Programs. Journal of Logic Programming 38, 1, 31-54.
34. RAO, P., RAMAKRISHNAN, C. R. AND RAMAKRISHNAN, I. V. 1996. A Thread in Time Saves Tabling Time. In Proceedings of the Joint International Conference and Symposium on Logic Programming. MIT Press, Bonn, Germany, pp. 112-126.
35. RAO, P., SAGONAS, K., SWIFT, T., WARREN, D. S. AND FREIRE, J. 1997. XSB: A System for Efficiently Computing Well-Founded Semantics. In Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonie Reasoning. Number 1265 in Lecture Notes in Computer Science. Springer-Verlag, Dagstuhl, Germany, pp. 431-441.
36. ROCHA, R. 2001. On Applying Or-Parallelism and Tabling to Logic Programs. Ph.D. thesis, Computer Science Department, University of Porto.
37. ROCHA, R., SILVA, F. AND SANTOS COSTA, V. 1999a. Or-Parallelism within Tabling. In Proceedings of the First International Workshop on Practical Aspects of Declarative Languages. Number 1551 in Lecture Notes in Computer Science. Springer-Verlag, San Antonio, TX, pp. 137-151.
38. ROCHA, R., SILVA, F. AND SANTOS COSTA, V. 1999b. YapOr: an Or-Parallel Prolog System Based on Environment Copying. In Proceedings of the 9th Portuguese Conference on Artificial Intelligence. Number 1695 in Lecture Notes in Artificial Intelligence. Springer-Verlag, pp. 178-192.
39. ROCHA, R., SILVA, F. AND SANTOS COSTA, V. 2000. YapTab: A Tabling Engine Designed to Support Parallelism. In Proceedings 2nd Conference on Tabulation in Parsing and Deduction. Vigo, Spain, pp. 77-87.
40. ROCHA, R., SILVA, F. AND SANTOS COSTA, V. 2001. On a Tabling Engine that Can Exploit OrParallelism. In Proceedings 17th International Conference on Logic Programming. Number 2237 in Lecture Notes in Computer Science. Springer-Verlag, Paphos, Cyprus, pp. 43-58.
41. SAGONAS, K. 1996. The SLG-WAM: A Search-Efficient Engine for Well-Founded Evaluation of Normal Logic Programs. Ph.D. thesis, Department of Computer Science, State University of New York, Stony Brook, USA.
42. SAGONAS, K. AND SWIFT, T. 1998. An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs. ACM Transactions on Programming Languages and Systems 20, 3, 586-634.
43. SAGONAS, K., SWIFT, T. AND WARREN, D. S. 1994. XSB as an Efficient Deductive Database Engine. In Proceedings ACM SIGMOD International Conference on the Management of Data. ACM Press, Minneapolis, Minnesota, USA, pp. 442-453.
44. SAGONAS, K., SWIFT, T. AND WARREN, D. S. 1996. An Abstract Machine for Computing the Well-Founded Semantics. In Proceedings Joint International Conference and Symposium on Logic Programming. MIT Press, Bonn, Germany, pp. 274-288.
45. SANTOS COSTA, V. 1999. Optimising Bytecode Emulation for Prolog. In Proceedings Principles and Practice of Declarative Programming. Number 1702 in Lecture Notes in Computer Science. Springer-Verlag, Paris, France, pp. 261-267.
46. SANTOS COSTA, V., WARREN, D. H. D. AND YANG, R. 1991. Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism. In Proceedings 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM Press, Williamsburg, VA, pp. 83-93.
47. SHEN, K. 1992. Exploiting Dependent And-parallelism in Prolog: The Dynamic Dependent And-Parallel Scheme (DDAS). In Proceedings Joint International Conference and Symposium on Logic Programming. Press, Washington, DC, pp. 717-731.
48. SHEN, Y.-D., YUAN, L.-Y., You, J.-H. AND ZHOU, N.-F. 2001. Linear Tabulated Resolution Based on Prolog Control Strategy. Theory and Practice of Logic Programming 1, 1, 71-103.
49. SWIFT, T. AND WARREN, D. S. 1994. An abstract machine for SLG resolution: Definite Programs. In Proceedings of the International Logic Programming Symposium. The MIT Press, Ithaca, New York, pp. 633-652.
50. TAMAKI, H. AND SATO, T. 1986. OLDT Resolution with Tabulation. In Proceedings 3rd International Conference on Logic Programming. Number 225 in Lecture Notes in Computer Science. Springer-Verlag, London, pp. 84-98.
51. TARJAN, R. E. 1972. Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing 1, 2, 146-160.
52. THE XSB GROUP. 2003a. LMC: The Logic-Based Model Checking Project. Available from http://www.cs.sunysb.edu/~lmc.
53. THE XSB GROUP. 2003b. The XSB Logic Programming System. Available from http:// xsb.sourceforge.net.
54. TICK, E. 1991. Parallel Logic Programming. MIT Press.
55. VIEILLE, L. 1989. Recursive Query Processing: The Power of Logic. Theoretical Computer Science 69, 1, 1-53.
56. WARREN, D. H. D. 1983. An Abstract Prolog Instruction Set. Technical Note 309, SRI International.
57. ZHOU, N.-F., SHEN, Y.-D., YUAN, L.-Y. AND You, J.-H. 2000. Implementation of a Linear Tabling Mechanism. In Proceedings Practical Aspects of Declarative Languages. Number 1753 in Lecture Notes in Computer Science. Springer-Verlag, Boston, MA, pp. 109-123.