Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation

Abstract

This paper 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 paper presents a completeness proof and reports on practical experience obtained with the Saturate system.

Dates and versions

inria-00099710 , version 1 (26-09-2006)

Identifiers

Cite

Harald Ganzinger, Jürgen Stuber. Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation. 19th International Conference on Automated Deduction - CADE-19, 2003, Miami Beach, FL, United States. pp.335-349, ⟨10.1007/978-3-540-45085-6_31⟩. ⟨inria-00099710⟩
44 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More