Computing Tiny Clause Normal Forms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Computing Tiny Clause Normal Forms


Automated reasoning systems which build on resolution or superposition typically operate on formulas in clause normal form (CNF). It is well-known that standard CNF translation of a first-order formula may result in an exponential number of clauses. In order to prevent this effect, renaming techniques have been introduced that replace subformulas by atoms over fresh predicates and introduce definitions accordingly. This paper presents generalized renaming. Given a formula and a set of subformulas to be renamed, it is suggested to use one atom to replace all instances of a generalization of a given subformula. A generalized renaming algorithm and an implementation as part of the SPASS theorem prover are described. The new renaming algorithm is faster than the previous one implemented in SPASS. Experiments on the TPTP show that generalized renaming significantly reduces the number of clauses and the average time taken to solve the problems afterward.

Dates and versions

hal-00931893 , version 1 (16-01-2014)



Noran Azmy, Christoph Weidenbach. Computing Tiny Clause Normal Forms. 24th International Conference on Automated Deduction (CADE-24), Jun 2013, Lake Placid, NY, United States. pp.109-125, ⟨10.1007/978-3-642-38574-2_7⟩. ⟨hal-00931893⟩
115 View
0 Download



Gmail Facebook Twitter LinkedIn More