Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
SPASS Current Prototypes and Experiments, http://www.spass-prover.org/prototypes/index.html
Baaz, M., Egly, U., Leitsch, A.: Normal Form Transformations. In: Voronkov, A., Robinson, A. (eds.) Handbook of Automated Reasoning, ch. 5, pp. 273–333
Biere, A., Heule, M., Maaren, H.V., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press (2009)
Thierry Boy de la Tour. An Optimality Result for Clause Form Translation. Journal of Symbolic Computation 14(4), 283–301 (1992)
Henschen, L., Lusk, E., Overbeek, R., Smith, B.T., Veroff, R., Winker, S., Wos, L.: Challenge Problem 1. SIGART Newsletter (72), 30–31 (1980)
Hillenbrand, T., Weidenbach, C.: Superposition for bounded domains. In: Bonacina, M.P., Stickel, M.E. (eds.) McCune Festschrift. LNCS (LNAI), vol. 7788, pp. 68–100. Springer, Heidelberg (2013)
Nonnengart, A., Weidenbach, C.: Computing Small Clause Normal Forms. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 6, pp. 337–367 (2001)
Plaisted, D.A., Greenbaum, S.: A Structure-preserving Clause Form Translation. Journal of Symbolic Computation 2(3), 293–304 (1986)
Sutcliffe, G., Suttner, C.: The TPTP Problem Library for Automated Theorem Provers (September 2010), http://www.tptp.org/
Tseitin, G.S.: On the Complexity of Derivation in Propositional Calculus. Studies in Constructive Mathematics and Mathematical Logic 8(115-125), 234–259 (1968)
Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS Version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol. 5663, pp. 140–145. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azmy, N., Weidenbach, C. (2013). Computing Tiny Clause Normal Forms. In: Bonacina, M.P. (eds) Automated Deduction – CADE-24. CADE 2013. Lecture Notes in Computer Science(), vol 7898. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38574-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-38574-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38573-5
Online ISBN: 978-3-642-38574-2
eBook Packages: Computer ScienceComputer Science (R0)