Inprocessing Rules

  • Matti Järvisalo
  • Marijn J. H. Heule
  • Armin Biere
Conference paper

DOI: 10.1007/978-3-642-31365-3_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7364)
Cite this paper as:
Järvisalo M., Heule M.J.H., Biere A. (2012) Inprocessing Rules. In: Gramlich B., Miller D., Sattler U. (eds) Automated Reasoning. IJCAR 2012. Lecture Notes in Computer Science, vol 7364. Springer, Berlin, Heidelberg

Abstract

Decision procedures for Boolean satisfiability (SAT), especially modern conflict-driven clause learning (CDCL) solvers, act routinely as core solving engines in various real-world applications. Preprocessing, i.e., applying formula rewriting/simplification rules to the input formula before the actual search for satisfiability, has become an essential part of the SAT solving tool chain. Further, some of the strongest SAT solvers today add more reasoning to search by interleaving formula simplification and CDCL search. Such inprocessing SAT solvers witness the fact that implementing additional deduction rules in CDCL solvers leverages the efficiency of state-of-the-art SAT solving further. In this paper we establish formal underpinnings of inprocessing SAT solving via an abstract inprocessing framework that covers a wide range of modern SAT solving techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Matti Järvisalo
    • 1
  • Marijn J. H. Heule
    • 2
    • 3
  • Armin Biere
    • 3
  1. 1.Department of Computer Science & HIITUniversity of HelsinkiFinland
  2. 2.Department of Software TechnologyDelft University of TechnologyThe Netherlands
  3. 3.Institute for Formal Models and VerificationJohannes Kepler UniversityLinzAustria

Personalised recommendations