SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
SPTHEO - A Parallel Theorem Prover
Journal of Automated Reasoning
OR-Parallel Theorem Proving with Random Competition
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A taxonomy of parallel strategies for deduction
Annals of Mathematics and Artificial Intelligence
SPTHEO - A Parallel Theorem Prover
Journal of Automated Reasoning
Parallelization of a Hyper-Linking–Based Theorem Prover
Journal of Automated Reasoning
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Octopus: Combining Learning and Parallel Search
Journal of Automated Reasoning
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
A multi-agent framework for distributed theorem proving
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
SPTHEO v3.3 is a parallelization of the sequential first-order theorem prover SETHEO v3.3. 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 article, a detailed description and evaluation of the OR-parallel part used in the CADE-13 ATP System Competition are given.