Abstract
Peers-mcd.d implements contraction-based strategies for equational logic, modulo associativity and commutativity, with paramodulation, simplification and functional subsumption. It is a new version of Peers-mcd [4], that parallelizes McCune’s prover EQP (version 0.9d), according to the Modified Clause-Diffusion methodology (http://www.cs.uiowa.edu/~bonacina/cd.html).
Supported in part by the National Science Foundation with grants CCR-97-01508 and EIA-97-29807
Acknowledgements
Thanks to Bill McCune for EQP0.9d, to my former student Javeed Chida, for implementing the heuristic functions in his master thesis, and to Gigina Carlucci Aiello of the Dipartimento di Informatica e Sistemistica, Universitè di Roma “La Sapienza,” where part of this work was done.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Siva Anantharaman and Nirina Andrianarivelo. Heuristical criteria in refutational theorem proving. In Alfonso Miola, editor, Proceedings of the 1st DISCO, volume 429 of LNCS, pages 184–193. Springer Verlag, 1990.
Siva Anantharaman and Jieh Hsiang. Automated proofs of the Moufang identities in alternative rings. Journal of Automated Reasoning, 6(1):76–109, 1990.
Jürgen Avenhaus, Thomas Hillenbrand, and Bernd Löchner. On using ground joinable equations in equational theorem proving. In Peter Baumgartner and Hantao Zhang (ed.), Proceedings of FTP 2000, Technical Report 5/2000, Institut für Informatik, Universität Koblenz-Landau, 33–43, 2000.
Maria Paola Bonacina. The Clause-Diffusion theorem prover Peers-mcd. In William W. McCune, editor, Proceedings of CADE-14, volume 1249 of LNAI, pages 53–56. Springer, 1997.
Maria Paola Bonacina. Experiments with subdivision of search in distributed theorem proving. In Markus Hitz and Erich Kaltofen, editors, Proceedings of PASCO97, pages 88–100. ACM Press, 1997.
Maria Paola Bonacina. A taxonomy of parallel strategies for deduction. Ann. Of Math. and AI, in press, 2000. Available as Tech. Rep., Dept. of Computer Science, Univ. of Iowa from http://www.cs.uiowa.edu/~bonacina/distributed.html.
Jörg Denzinger and Matthias Fuchs. Goal-oriented equational theorem proving using Team-Work. In Proceedings of the 18th KI, volume 861 of LNAI, pages 343–354. Springer, 1994.
Jieh Hsiang, Michaёl Rusinowitch, and Ko Sakai. Complete inference rules for the cancellation laws. In Proceedings of the 10th IJCAI, pages 990–992, 1987.
Geoff Sutcliffe. The CADE-16 ATP system competition. Journal of Automated Reasoning, 24:371–396, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonacina, M.P. (2001). Combination of Distributed Search and Multi-Search in Peers-mcd.d. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_37
Download citation
DOI: https://doi.org/10.1007/3-540-45744-5_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42254-9
Online ISBN: 978-3-540-45744-2
eBook Packages: Springer Book Archive