Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
A method for efficiently executing Horn clause programs using multiple processors
New Generation Computing
The Muse Or-parallel Prolog model and its performance
Proceedings of the 1990 North American conference on Logic programming
Parthenon: a parallel theorem prover for non-Horn clauses
Journal of Automated Reasoning
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
OR-Parallel Theorem Proving with Random Competition
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
PARTHEO: A High-Performance Parallel Theorem Prover
Proceedings of the 10th International Conference on Automated Deduction
A Novel Asynchronous Parallelism Scheme for First-Order Logic
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Octopus: Combining Learning and Parallel Search
Journal of Automated Reasoning
| Hi-index | 0.00 |
This paper describes the parallel automated theorem prover SPTHEO, a parallelization of the sequential first-order theorem prover SETHEO. The parallelization is based on the SPS-model (Static Partitioning with Slackness) for parallel search, an approach that minimizes the processor-to-processor communication. This model allows efficient computations on hardware with weak communication performance, such as workstation networks. SPTHEO offers the utilization of both OR- and independent-AND parallelism. In this paper, a detailed description and evaluation of the OR-parallel part are given.