Foundations of logic programming
Foundations of logic programming
Artificial Intelligence
A data-driven machine for OR-parallel evaluation of logic programs
New Generation Computing
An execution model for exploiting AND-parallelism in logic programs
New Generation Computing
An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs
Proceedings of the Third International Conference on Logic Programming
A parallel execution model of logic programs
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Parallel Logic Programming for Problem Solving
International Journal of Parallel Programming
| Hi-index | 0.00 |
AND-parallel execution of logic programs turns out to be an intricate matter whenever clause literals are linked by shared variables. Shared variable dependencies call for special precautions to prevent processes from computing inconsistent bindings while working on clause literals simultaneously. Therefore, most systems restrict AND-parallelism to its producer/consumer style by allowing only independent literals to run in parallel. These literals then act as producers of variable bindings which will be consumed by dependent literals in subsequent steps. However, to implement producer/consumer parallelism efficiently, appropriate methods must be available for detecting dependencies caused by shared variables. Concerning such dependencies this paper presents a methodology which may serve as a basis for efficient dependency checking by performing compile and run-time analysis of program clauses.