Abstract

PARTHEO, a sound and complete or-parallel theorem prover for first-order logic is presented. The proof calculus is model elimination. PARTHEO consists of a uniform network of sequential theorem provers communicating via message passing. Each sequential prover is implemented as an extension of Warren's abstract machine. PARTHEO is written in parallel C and is running on a network of 16 transputers. The paper comprises a description of the system architecture, the theoretical background, details of the implementation, and results of performance measurements.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call