A nonbacktracking restricted AND-parallel, and OR-parallel Prolog execution model, PPEM, is introduced. The execution monitor of PPEM, automatically generates the solution tree incrementally for a given program, using restricted AND-parallelism. A new representation, the Active Processes Tree, used for tracing the parallel execution of Prolog programs, is introduced. A set- based algorithm controls restricted AND-parallel execution of and-terms in PPEM. All solutions are searched in trying an and- term. If an and-term fails, the subtree of the solution tree emanating from its parent is discarded. No processes are created for facts, and rules with single and-terms. The execution mechanism of PPEM is introduced, and illustrated with examples.<<ETX>>
[1]
Laxmikant V. Kalé,et al.
The Reduce-Or Process Model for Parallel Execution of Logic Programs
,
1991,
J. Log. Program..
[2]
Philippe Robert,et al.
The PEPSys Model: Combining Backtracking, AND- and OR-Parallelism
,
1987,
SLP.
[3]
Mats Carlsson.
Design and implementation of an or-parallel Prolog engine
,
1990,
RIT / KTH / TRITA-CS.
[4]
Doug DeGroot,et al.
Restricted AND-Parallelism
,
1984,
FGCS.
[5]
John S. Conery,et al.
The and/or process model for parallel interpretation of logic programs
,
1983
.