Automated Reasoning

Volume 7364 of the series Lecture Notes in Computer Science pp 355-370

Inprocessing Rules

  • Matti JärvisaloAffiliated withCarnegie Mellon UniversityDepartment of Computer Science & HIIT, University of Helsinki
  • , Marijn J. H. HeuleAffiliated withCarnegie Mellon UniversityDepartment of Software Technology, Delft University of TechnologyInstitute for Formal Models and Verification, Johannes Kepler University
  • , Armin BiereAffiliated withCarnegie Mellon UniversityInstitute for Formal Models and Verification, Johannes Kepler University

* Final gross prices may vary according to local VAT.

Get Access


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.