And-Or Parallel Implementation of Prolog

Most models that have been proposed (or implemented) so far for exploiting both or-parallelism and independent and-parallelism have only considered pure logic programs (pure Prolog). We present an abstract model, called the Composition-tree, for representing and-or parallelism in full Prolog. The Binding Array scheme is extended for and-or parallel execution based on the Composition-tree. We also show how extra-logical predicates, such as cuts and side-effects, can be supported in this model.