A Taxonomy of Parallel Strategies for Deduction (1999)
| Venue: | Annals of Mathematics and Artificial Intelligence |
| Citations: | 14 - 1 self |
BibTeX
@ARTICLE{Bonacina99ataxonomy,
author = {Maria Paola Bonacina},
title = {A Taxonomy of Parallel Strategies for Deduction},
journal = {Annals of Mathematics and Artificial Intelligence},
year = {1999},
volume = {29},
pages = {223--257}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 subgoalreduction) . We analyze how the di#erent approaches to parallelization a#ect 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 (multi-search) or extend the search plan with the capability of subdividing the search space (distributed search). Precisely because the search plan is modified, the latter methods may produce radically di#erent searches than their sequential base, as exemplified by the first distributed proof of the Robbins theorem generated by the Modified Clause-Di#usion prover Peers-mcd. An overview of the state of the field and directions...
