Advertisement

A Clause-Based Heuristic for SAT Solvers

  • Nachum Dershowitz
  • Ziyad Hanna
  • Alexander Nadel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3569)

Abstract

We propose a new decision heuristic for DPLL-based propositional SAT solvers. Its essence is that both the initial and the conflict clauses are arranged in a list and the next decision variable is chosen from the top-most unsatisfied clause. Various methods of initially organizing the list and moving the clauses within it are studied. Our approach is an extension of one used in Berkmin, and adopted by other modern solvers, according to which only conflict clauses are organized in a list, and a literal-scoring-based secondary heuristic is used when there are no more unsatisfied conflict clauses. Our approach, implemented in the 2004 version of zChaff solver and in a generic Chaff-based SAT solver, results in a significant performance boost on hard industrial benchmarks.

Keywords

Satisfying Assignment Partial Assignment Conjunctive Normal Form Formula Decision Heuristic Empty Clause 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alfredsson, J.: The SAT solver Oepir, http://www.lri.fr/~simon/contest/results/ONLINEBOOKLET/OepirA.ps (viewed January 16, 2005)
  2. 2.
    Bayardo Jr., R., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the National Conference on Artificial Intelligence, pp. 203–208 (1997)Google Scholar
  3. 3.
    Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM (5), 394–397 (1962)Google Scholar
  4. 4.
    Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: Design, Automation, and Test in Europe (DATE 2002), March 2002, pp. 142–149 (2002)Google Scholar
  6. 6.
    Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the National Conference on Artificial Intelligence (July 1998)Google Scholar
  7. 7.
    Jeroslaw, R.G., Wang, J.: Solving propositional satisfiability problems. Annals of mathematics and Artificial Intelligence (1), 167–187 (1990)Google Scholar
  8. 8.
    Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European conference on Artificial intelligence (1992)Google Scholar
  9. 9.
    Le Berre, D., Simon, L.: Fifty-five solvers in Vancouver: The SAT 2004 competition. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 321–344. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Mahajan, Y.S., Fu, Z., Malik, S.: ZChaff2004: an efficient SAT solver. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 360–375. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Marques-Silva, J.P.: The impact of branching heuristics in propositional satisfiability algorithms. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol. 1695, pp. 62–74. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  12. 12.
    Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers (48), 506–521 (1999)Google Scholar
  13. 13.
    Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the Design Automation Conference (2001)Google Scholar
  14. 14.
    Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in SAT-based formal verification. Intl. Journal on Software Tools for Technology Transfer (STTT) (7), 156–173 (2005)Google Scholar
  15. 15.
    Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Masters thesis, Simon Fraser University (February 2004)Google Scholar
  16. 16.
    Hoos, H.H., Mitchell, D.G. (eds.): SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005), http://satlive.org/SATCompetition/2004/ (viewed September 1, 2004)zbMATHGoogle Scholar
  17. 17.
    Zabih, R., McAllester, D.A.: A rearrangement search strategy for determining propositional satisfiability. In: Proceedings of National Conference on Artificial Intelligence, pp. 155–160 (1988)Google Scholar
  18. 18.
    Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: International Conference on Computer-Aided Design (ICCAD 2001), November 2001, pp. 279–285 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Nachum Dershowitz
    • 1
  • Ziyad Hanna
    • 2
  • Alexander Nadel
    • 1
    • 2
  1. 1.School of Computer ScienceTel Aviv UniversityRamat AvivIsrael
  2. 2.Design Technology GroupIntel CorporationHaifaIsrael

Personalised recommendations