Peers is a prototype for parallel theorem proving in a distributed environment. It implements a number of strategies for refutational, contraction-based theorem proving in equational theories, whose signatures may include associative-commutative (AC) function symbols. "Contraction-based" strategies is a more general term for "simplification-based", "rewriting-based" or "(Knuth-Bendix) completion-based" strategies. Such strategies are parallelized in Peers according to the Clause-Diffusion methodology for distributed deduction.
Distributed theorem proving by Peers
BONACINA, Maria Paola
;
1994-01-01
Abstract
Peers is a prototype for parallel theorem proving in a distributed environment. It implements a number of strategies for refutational, contraction-based theorem proving in equational theories, whose signatures may include associative-commutative (AC) function symbols. "Contraction-based" strategies is a more general term for "simplification-based", "rewriting-based" or "(Knuth-Bendix) completion-based" strategies. Such strategies are parallelized in Peers according to the Clause-Diffusion methodology for distributed deduction.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
CADE1994peers.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
88.41 kB
Formato
Adobe PDF
|
88.41 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.