Automated proofs of the Moufang identities in alternatives rings
Journal of Automated Reasoning
Handbook of theoretical computer science (vol. B)
Equational reasoning and term rewriting systems
Handbook of logic in artificial intelligence and logic programming (vol. 1)
Towards a foundation of completion procedures as semidecision procedures
Theoretical Computer Science
Strategy compliant multi-threaded term completion
Journal of Symbolic Computation - Special issue on parallel symbolic computation
On the reconstruction of proofs in distributed theorem proving: a modified clause-diffusion method
Journal of Symbolic Computation - Special issue on parallel symbolic computation
Recording and analysing knowledge-based distributed deduction processes
Journal of Symbolic Computation - Special issue on parallel symbolic computation
The resolution calculus
Experiments with subdivision of search in distributed theorem proving
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
On the modeling of search in theorem proving—towards a theory of strategy analysis
Information and Computation
Solution of the Robbins Problem
Journal of Automated Reasoning
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
An Overview of Rewrite Rule Laboratory (RRL)
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Fine-Grained Concurrent Completion
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
An Application of Automated Equational Reasoning to Many-valued Logic
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
| Hi-index | 0.00 |
We present a model of parallel search in theorem proving for forward-reasoning strategies, with contraction and distributed search. We extend to parallel search the bounded-search-spaces approach to the measurement of infinite search spaces, capturing both the advantages of parallelization, e.g., the subdivision of work, and its disadvantages, e.g., the cost of communication, in terms of search space. These tools are applied to compare the search space of a distributed-search contraction-based strategy with that of the corresponding sequential strategy.