HaifaSat: A New Robust SAT Solver

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


The popular abstraction/refinement model frequently used in verification, can also explain the success of a SAT decision heuristic like Berkmin. According to this model, conflict clauses are abstractions of the clauses from which they were derived. We suggest a clause-based decision heuristic called Clause-Move-To-Front (CMTF), which attempts to follow an abstraction/refinement strategy (based on the resolve-graph) rather than satisfying the clauses in the chronological order in which they were created, as done in Berkmin. We also show a resolution-based score function for choosing the variable from the selected clause and a similar function for choosing the sign. We implemented the suggested heuristics in our SAT solver HaifaSat. Experiments on hundreds of industrial benchmarks demonstrate the superiority of this method comparing to the Berkmin heuristic. There is still room for research on how to explore better the resolve-graph information, based on the abstraction/refinement model that we propose.


Decision Level Sign Score Decision Event Resolution Algorithm Binary Resolution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Beame., P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research 22, 319–351 (2004)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Goldberg, E., Novikov, Y.: Berkmin: A fast and robust sat-solver. In: Design, Automation and Test in Europe Conference and Exhibition (DATE 2002), Paris, p. 142 (2002)Google Scholar
  3. 3.
    Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Master’s thesis, Simon Fraser University (2004)Google Scholar
  4. 4.
    Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. Design Automation Conference, DAC 2001 (2001)Google Scholar
  5. 5.
    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
  6. 6.
    Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD (2001)Google Scholar
  7. 7.
    Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: Theory and Applications of Satisfiability Testing (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Roman Gershman
    • 1
  • Ofer Strichman
    • 2
  1. 1.Computer ScienceTechnionHaifaIsrael
  2. 2.Information Systems EngineeringTechnionHaifaIsrael

Personalised recommendations