by Rong Yang (Manchester)

P-Prolog is put forward as an alternative proposal to the difficulties faced in the main research areas of parallel logic programmings, which have been studied. P-Prolog provides the advantages of guarded Horn clauses while retaining don't know non-determinism where required. This monograph presents also an or-tree model and an implementation scheme for it, to combine and- and or- parallelism with reasonable efficiency. The model and implementation scheme discussed can be applied to P-Prolog and other parallel logic languages.

• Theory of Logic Programming
• A Survey of Parallel Logic Languages
• P-Prolog: A Parallel Logic Programming Language — Basic Concepts of P-Prolog, Syntax and Semantics, Programming Example and Comparison with Other Languages, Programming in P-Prolog, Re-examination of P-Prolog in Terms of Theory
• Binary Tree Expression
• Efficient Memory Management for Multiple Environments
• Combining And-parallelism and Or-parallelism
• Conclusion