Automated proofs of the Moufang identities in alternatives rings
Journal of Automated Reasoning
PARTHEO: a high-performance parallel theorem prover
CADE-10 Proceedings of the tenth international conference on Automated deduction
Implementing an irregular application on a distributed memory multiprocessor
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Distributed automated deduction
Distributed automated deduction
Exploitation of parallel processing for implementing high-performance deduction systems
Journal of Automated Reasoning
Parthenon: a parallel theorem prover for non-Horn clauses
Journal of Automated Reasoning
Towards a foundation of completion procedures as semidecision procedures
Theoretical Computer Science
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
The computation of Gröbner bases on a shared memory multiprocessor
DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Distributed Deduction by Clause-Diffusion: The Aquarius Prover
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
On Fairness in Distributed Automated Deduction
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Distributing Equational Theorem Proving
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
On the Correctness of a Distributed Memory Gröbner basis Algorithm
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A Buchberger Algorithm for Distributed Memory Multiprocessors
Proceedings of the First International ACPC Conference on Parallel Computation
Experiments with ROO: A Parallel Automated Deduction System
Proceedings of the International Workshop on Parallelization in Inference Systems
RRL: A Rewrite Rule Laboratory
Proceedings of the 9th International Conference on Automated Deduction
A Parallel Completion Procedure for Term Rewriting Systems
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Distributed Theorem Proving by Peers
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
High-performance permutative completion
High-performance permutative completion
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
DARES: a distributed automated reasoning system
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Experiments with subdivision of search in distributed theorem proving
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
A model and a first analysis of distributed-search contraction-based strategies
Annals of Mathematics and Artificial Intelligence
A taxonomy of parallel strategies for deduction
Annals of Mathematics and Artificial Intelligence
Requirement-Based Cooperative Theorem Proving
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Cooperation between top-down and bottom-up theorem provers
Journal of Artificial Intelligence Research
On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi
Fundamenta Informaticae
Hi-index | 0.00 |
This paper describes a methodology for parallel theorem proving in a distributed environment, called deduction by Clause-Diffusion. This methodology utilizes parallelism at the search level, by having concurrent, asynchronous deductive processes searching in parallel the search space of the problem. The search space is partitioned among the processes by distributing the clauses and by subdividing certain classes of inferences. The processes communicate by exchanging data. Policies for distributing the clauses and for scheduling inference and communication steps complete the picture. A distributed derivation is made of the collection of the derivations computed by the concurrent deductive processes and it halts successfully as soon as one of them does. While the Clause-Diffusion methodology applies to theorem proving in general, it has been designed to provide solutions to the problems in the parallelization of contraction-based strategies, such as rewriting-based methods. We identify backward contraction, i.e. the task of maintaining clauses reduced in a dynamically changing data base, as the main obstacle in parallel theorem proving with contraction. In parallel implementations of contraction-based strategies in shared memory, this difficulty appears as a write-bottleneck, which we have termed the backward contraction bottleneck. The Clause-Diffusion approach avoids this problem by adopting a mostly distributed memory and distributed global contraction schemes. We conclude by reporting some of our results with an implementation of Clause-Diffusion.