Combination of Distributed Search and Multi-Search in Peers-mcd.d

System Description
  • Maria Paola Bonacina
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2083)


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 (


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    Siva Anantharaman and Jieh Hsiang. Automated proofs of the Moufang identities in alternative rings. Journal of Automated Reasoning, 6(1):76–109, 1990.MathSciNetCrossRefGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Geoff Sutcliffe. The CADE-16 ATP system competition. Journal of Automated Reasoning, 24:371–396, 2000.CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Maria Paola Bonacina
    • 1
  1. 1.Department of Computer ScienceThe University of IowaIowa CityUSA

Personalised recommendations