Parallel execution of logic programs in the framework of OR-Forest

  • Authors:
  • Y. Tzu;C. Sun

  • Affiliations:
  • Department of Computer Science, Changsha Institute of Technology, Changsha, China;Department of Computer Science, Changsha Institute of Technology, Changsha, China

  • Venue:
  • ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new framework for parallel execution of logic programs is described in this paper.First, we present the OR-forest description for the execution of logic programs. Then, an algorithm for automatic partition of subgoals and an OR-forest-based process model are given and discussed.All the algorithms and schemes discussed in this paper have been implemented in PROLOG and their correctness and feasibility have been proved by testing a number of benchmark programs. Experiments show that the OR-forest-based execution system, incorporated with an automatic partition algorithm, can efficiently exploit parallelisms in both deterministic and nondeterministic programs, and nearly always achieve optimal AND-OR-parallelism.