The Clause-Diffusion theorem prover Peers-mcd (system description)
Peers-mcd is a distributed theorem prover for equational logic with associativity and commutativity built-in. It is based on the Clause-Diffusion methodology for distributed deduction and the Argonne prover EQP. New features include ancestor-graph oriented criteria to subdivide the search among the parallel processes. Peers-mcd shows superlinear speed-up in a case study in Robbins algebra.
Unable to display preview. Download preview PDF.
- 1.L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In D. Kapur, editor, Proc. CADE-11, volume 607 of LNAI, pages 462–476. Springer, 1992.Google Scholar
- 2.M. P. Bonacina. On the reconstruction of proofs in distributed theorem proving: a modified Clause-Diffusion method. J. of Symbolic Computation, 21:507–522, 1996.Google Scholar
- 3.M. P. Bonacina and J. Hsiang. The Clause-Diffusion methodology for distributed deduction. Fundamenta Informaticae, 24:177–207, 1995.Google Scholar
- 4.M. P. Bonacina and J. Hsiang. On the representation of dynamic search spaces in theorem proving. In C.-S. Yang, editor, Proc. Int. Computer Symp., Dec. 1996.Google Scholar
- 5.M. P. Bonacina and W. McCune. Distributed theorem proving by Peers. In A. Bundy, editor, Proc. CADE-12, volume 814 of LNAI, pages 841–845. Springer, 1994.Google Scholar
- 6.W. McCune. 33 Basic test problems: a practical evaluation of some paramodulation strategies. MCS Division, Argonne National Laboratory, Pre-print P618, 1996.Google Scholar
- 7.W. McCune. Solution of the Robbins problem. Submitted manuscript, 1996.Google Scholar
- 8.R. Niewenhuis and A. Rubio. Basic superposition is complete. In B. Krieg-Brückner, editor, Proc. ESOP, volume 582 of LNCS, pages 371–389. Springer, 1992.Google Scholar
- 9.S. Winker. Robbins algebra: Conditions that make a near-Boolean algebra Boolean. J. of Automated Reasoning, 6(4):465–489, 1990.Google Scholar