Skip to main content
SpringerLink
Log in

Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques

  • Conference paper
Theory and Applications of Satisfiability Testing - SAT 2009 (SAT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5584))

Abstract

The paper develops a new hybrid SAT solver, called MoRsat. The framework of the solver is based on a look-ahead technique, and its core is a conflict-driven search. A look-ahead technique is used to split the original problem to sub-problems, each of them is either solved or aborted by a conflict-driven DPLL. Aborted sub-problems are solved recursively. We present new properties of XOR clauses, which are used to incorporate XOR reasoning into our conflict-driven DPLL. Compared with the latest versions of Rsat and March, the Gold Medal winners in the industrial and handmade SAT category of the SAT 2007 competition, MoRsat achieves remarkable improvements. Moreover, MoRsat can solve some industrial instances that were not solved in the SAT 2007 competition.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pipatssrisawat, K., Darwiche, A.: Rsat 2.0: SAT solver description. In: SAT 2007 competition (2007)

    Google Scholar 

  2. March_ks SAT solver, the version of SAT 2007 competition, http://www.st.ewi.tudelft.nl/sat/download.php

  3. Cook, S.A.: The Complexity of Theorem Proving Procedures. In: 3rd ACM Symp. on Theory of Computing, pp. 151–158 (1971)

    Google Scholar 

  4. Crawford, J.M., Kearns, M.J., Schapire, R.E.: The Minimal Disagreement Parity Problem as a Hard Satisfiability Problem. Draft version (1995)

    Google Scholar 

  5. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L.T., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Design Automation Conference, DAC (2001)

    Google Scholar 

  6. Zhang, H.: SATO: An efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 272–275. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  7. Ryvchin, V., Strichman, O.: Local Restarts. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 271–276. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Li, C.M.: Integrating Equivalency Reasoning into Davis-Putnam Procedure. In: AAAI-2000, Austin, Texas (2000)

    Google Scholar 

  10. Le Berre, D., Simon, L.: The essentials of the SAT 2003 competition. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 452–467. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Simon, L., Le Berre, D., Hirsch, E.: The SAT 2002 competition. Annals of Mathematics and Artificial Intelligence (AMAI) 43, 343–378 (2005)

    Article  Google Scholar 

  12. Velev, M., Bryant, R.: Effective use of Boolean Satisfiability Procedures in the Formal Verification Superscalar and VLIW Microprocessors. In: Design Automation Conferece, DAC (2001)

    Google Scholar 

  13. Eén, N., Sörénsson, N.: Minisat v2.0 (beta) solvers description, SAT-race (2006), http://minisat.se

  14. Rsat SAT solver homepage, http://reasoning.cs.ucla.edu/rsat/

  15. Heule, M., Van Maaren, H.: Aligning CNF- and Equivalence-Reasoning. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 145–156. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Heule, M., Van Maaren, H.: Effective Incorporation of double look-ahead procedures. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 258–271. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. SAT 2007 Competition Homepage, http://www.satcompetition.org/2007/

  18. Heule, M.: March: towards a look-ahead SAT solver for general purposes, Master thesis (2004)

    Google Scholar 

  19. Chen, J.C.: The SAT solver, MoRsat. In: SAT 2009 Competition (2009) (submitted)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, Donghua University, 2999 North Renmin Road, Songjiang District, Shanghai, 201620, P.R. China

    Jingchao Chen

Authors
  1. Jingchao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Swansea University, Faraday Building, Singleton Park, SA2 8PP, Swansea, UK

    Oliver Kullmann

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J. (2009). Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques. In: Kullmann, O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02777-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02777-2_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02776-5

  • Online ISBN: 978-3-642-02777-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation