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.

A system for distributed simplification-based theorem proving

BONACINA, Maria Paola;
1992

Abstract

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.
9783540554257
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11562/20904
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact