Automated Reencoding of Boolean Formulas

  • Norbert Manthey
  • Marijn J. H. Heule
  • Armin Biere
Conference paper

DOI: 10.1007/978-3-642-39611-3_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7857)
Cite this paper as:
Manthey N., Heule M.J.H., Biere A. (2013) Automated Reencoding of Boolean Formulas. In: Biere A., Nahir A., Vos T. (eds) Hardware and Software: Verification and Testing. HVC 2012. Lecture Notes in Computer Science, vol 7857. Springer, Berlin, Heidelberg

Abstract

We present a novel preprocessing technique to automatically reduce the size of Boolean formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for variables. Similar to other preprocessing techniques, BVA greedily lowers the sum of variables and clauses, a rough measure for the hardness to solve a formula. We show that cardinality constraints (CCs) can efficiently be reencoded: from a naive CC encoding, BVA automatically generates a compact encoding, which is smaller than sophisticated encodings. Experimental results show that applying BVA can improve SAT solving performance.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Norbert Manthey
    • 1
  • Marijn J. H. Heule
    • 2
    • 3
  • Armin Biere
    • 3
  1. 1.Institute of Artificial IntelligenceTechnische Universität DresdenGermany
  2. 2.Department of Computer ScienceThe University of Texas at AustinUSA
  3. 3.Institute for Formal Models and VerificationJohannes Kepler UniversityAustria

Personalised recommendations