Parallel implementation of logic languages

Abstract

Concurrent execution of logic programs entails parallel traversal of the underlying And-Or graph. This paper essentially reports an implementation approach in which, a logic program is translated to obtain processes that are look-alike Occam programs implementable on any platform that supports extended Occam. Besides the use of an intermediate language, the other main features of this implementation are 1. Weighted Or-Parallel execution to overcome the incompleteness of Prolog. 2. Parallel execution of mutually independent sub-goals (Restricted And-Parallelism). 3. Semi-intelligent backtracking and the use of bit-vectors for efficient execution.