Superposition with Equivalence Reasoning andDelayed Clause Normal Form Transformation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Superposition with Equivalence Reasoning andDelayed Clause Normal Form Transformation

Abstract

This report describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The report presents a completeness proof and reports on practical experience obtained with the Saturate system.
Fichier principal
Vignette du fichier
RR-4835.pdf (343.53 Ko) Télécharger le fichier

Dates and versions

inria-00071750 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071750 , version 1

Cite

Harald Ganzinger, Jürgen Stuber. Superposition with Equivalence Reasoning andDelayed Clause Normal Form Transformation. [Research Report] RR-4835, INRIA. 2003, pp.23. ⟨inria-00071750⟩
87 View
190 Download

Share

Gmail Facebook Twitter LinkedIn More