This paper describes the new features of the distributed theorem prover Peers-mcd.d for equational logic. They include parallel-search plans that combine distributed search (i.e., the search space is subdivided among the parallel processes) and multi-search (i.e., the processes employ different search plans). Experiments comparing the behavior of different control strategies on the Moufang identities are reported, including instances of super-linear speed-up due to parallel search.
Titolo: | Combination of distributed search and multi-search in Peers-mcd.d |
Autori: | |
Data di pubblicazione: | 2001 |
Serie: | |
Handle: | http://hdl.handle.net/11562/16044 |
ISBN: | 9783540422549 |
Appare nelle tipologie: | 02.01 Contributo in volume (Capitolo o Saggio) |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.