Study of a Parallel Inference Machine for Parallel Execution of Logic Programs

This paper presents a parallel inference machine called RAP/LOP-WAM, which is a parallel extension of the WAM to support Restricted ANDand Limited OR-Parallelism. The RAP/LOP-WAM is based on the OR-forest description. It handles Restricted AND-Parallelism through procedure-level and clause-level analysis at compiler-time, and simple run-time checks to identify independent goals of the body of a clause. It exploits OR-parallelism under the limit of the number of processors.