A taxonomy of parallel strategies for deduction

  • Authors:

  • Maria Paola Bonacina

  • Affiliations:

  • Department of Computer Science, The University of Iowa, Iowa City, IA 52242-1419, USA E-mail: bonacina@cs.uiowa.edu

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a taxonomy of parallel theorem-proving methods based on the control of search (e.g., master–slaves versus peer processes), the granularity of parallelism (e.g., fine, medium and coarse grain) and the nature of the method (e.g., ordering-based versus subgoal-reduction). We analyze how the different approaches to parallelization affect the control of search: while fine and medium–grain methods, as well as master-slaves methods, generally do not modify the sequential search plan, parallel-search methods may combine sequential search plans (imulti-search) or extend the search plan with the capability of subdividing the search space (idistributed search). Precisely because the search plan is modified, the latter methods may produce radically different searches than their sequential base, as exemplified by the first distributed proof of the iRobbins theorem generated by the iModified Clause-Diffusion prover iPeers-mcd. An overview of the state of the field and directions for future research conclude the paper.