The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1
Ralf Wimmer, Christoph Scholl, Bernd Becker · Journal on Satisfiability Boolean Modeling and Computation · 2019
Preprocessing turned out to be an essential step for SAT, QBF, and DQBF solvers to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. These preprocessing techniques often re