Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas

  • Roman Gershman
  • Ofer Strichman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3569)


We present an improvement to the Hyper preprocessing algorithm that was suggested by Bacchus and Winter in SAT 2003 [1]. Given the power of modern SAT solvers, Hyper is currently one of the only cost-effective preprocessors, at least when combined with some modern SAT solvers and on certain classes of problems. Our algorithm, although it produces less information than Hyper, is much more efficient. Experiments on a large set of industrial Benchmark sets from previous SAT competitions show that HyperBinFast is always faster than Hyper (sometimes an order of magnitude faster on some of the bigger CNF formulas), and achieves faster total run times, including the SAT solver’s time. The experiments also show that HyperBinFast is cost-effective when combined with three state-of-the-art SAT solvers.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bacchus, F., Winter, J.: Effective preprocessing with hyper-resolution and equality reduction. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 341–355. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Gershman, R., Strichman, O.: Cost-effective hyper-resolution for preprocessing cnf formulas (full version) (2005),
  3. 3.
    Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Master’s thesis, Simon Fraser University (2004)Google Scholar
  4. 4.
    Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. Technical Report TR-CSE-292996, Univerisity of Michigen (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Roman Gershman
    • 1
  • Ofer Strichman
    • 1
  1. 1.TechnionHaifaIsrael

Personalised recommendations