Our project consists in the design and implementation of simplification-based strategies for parallel automated deduction, on a multi-processor with distributed memory. For equational logic the basic inference mechanism is an enhanced version of Unfailing Knuth-Bendix completion. Ordered resolution, ordered paramodulation and several contraction inference rules will be featuredfor first order logic with equality. We plan to develop a first prototype of our system, for equational logic, on an Intel hypercube. The extension to first order logic with equality will follow.
Titolo: | A system for distributed simplification-based theorem proving |
Autori: | |
Data di pubblicazione: | 1992 |
Serie: | |
Handle: | http://hdl.handle.net/11562/20904 |
ISBN: | 9783540554257 |
Appare nelle tipologie: | 04.02 Abstract in Atti di convegno |
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.