Or-Parallelism within Tabling

Authors:
Ricardo Rocha;Fernando M. A. Silva;Vítor Santos Costa
Affiliations:
-;-;-
Venue:
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Year:
1999

Citing 7
Cited 4

Full Prolog and scheduling or-parallelism in muse

International Journal of Parallel Programming
Query evaluation under the well-founded semantics

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
XSB as an efficient deductive database engine

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An abstract machine for tabled execution of fixed-order stratified logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Exploiting Parallelism in Tabled Evaluations

PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies

PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
CAT: The Copying Approach to Tabling

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming

A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives

Proceedings of the 17th International Conference on Logic Programming
On a Tabling Engine That Can Exploit Or-Parallelism

Proceedings of the 17th International Conference on Logic Programming
Achieving Scalability in Parallel Tabled Logic Programs

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Novel Models for Or-Parallel Logic Programs: A Performance Analysis

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficiently exploited in tabling systems and propose two alternative approaches, Or-Parallelism within Tabling (OPT) and Tabling within Or-Parallelism (TOP). We concentrate on the fundamental concepts of an environment copying based model to implement the OPT approach and introduce the data structures and algorithms necessary to extend the YapOr Or-Parallel system, in order to obtain a parallel tabling system.