Peers-mcd is a distributed theorem prover for equational logic with associativity and commutativity built-in. It is based on the Clause-Diffusion methodology for distributed deduction and the Argonne prover EQP. New features include ancestor-graph oriented criteria to subdivide the search among the parallel processes. Peers-mcd shows super-linear speed-up in a case study in Robbins algebra.
The Clause-Diffusion theorem prover Peers-mcd
BONACINA, Maria Paola
1997-01-01
Abstract
Peers-mcd is a distributed theorem prover for equational logic with associativity and commutativity built-in. It is based on the Clause-Diffusion methodology for distributed deduction and the Argonne prover EQP. New features include ancestor-graph oriented criteria to subdivide the search among the parallel processes. Peers-mcd shows super-linear speed-up in a case study in Robbins algebra.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CADE1997peersmcd.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
74.69 kB
Formato
Adobe PDF
|
74.69 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
