Skip to main content
SpringerLink
Log in

Diversification and Intensification in Parallel SAT Solving

  • Conference paper
Principles and Practice of Constraint Programming – CP 2010 (CP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6308))

Abstract

In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an important role in several search algorithms including local search, and appear to be a key point in modern parallel SAT solvers. To study their tradeoff, we define two roles for the computational units. Some of them classified as Masters perform an original search strategy, ensuring diversification. The remaining units, classified as Slaves are there to intensify their master’s strategy. Several important questions have to be answered. The first one is what information should be given to a slave in order to intensify a given search effort? The second one is, how often, a subordinated unit has to receive such information? Finally, the question of finding the number of subordinated units and their connections with the search efforts has to be answered. Our results lead to an original intensification strategy which outperforms the best parallel SAT solver ManySAT, and solves some open SAT instances.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)

    MATH  Google Scholar 

  2. Lewis, M.D.T., Schubert, T., Becker, B.: Multithreaded sat solving. In: ASP-DAC, pp. 926–931 (2007)

    Google Scholar 

  3. Zhang, H., Bonacina, M.P., Hsiang, J.: Psato: a distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation 21, 543–560 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation - JSAT 6, 245–262 (2009)

    MATH  Google Scholar 

  5. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530–535 (2001)

    Google Scholar 

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

    Chapter  Google Scholar 

  7. Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Communications of the ACM 5(7), 394–397 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gomes, C.P., Selman, B., Kautz, H.A.: Boosting combinatorial search through randomization. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 1998), Madison, Wisconsin, pp. 431–437 (1998)

    Google Scholar 

  9. Kautz, H.A., Horvitz, E., Ruan, Y., Gomes, C.P., Selman, B.: Dynamic restart policies. In: AAAI/IAAI, pp. 674–681 (2002)

    Google Scholar 

  10. Marques-Silva, J.P., Sakallah, K.A.: GRASP - A New Search Algorithm for Satisfiability. In: Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 220–227 (November 1996)

    Google Scholar 

  11. Gomes, C.P., Selman, B., Crato, N., Kautz, H.A.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reasoning 24(1/2), 67–100 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Brisoux, L., Grégoire, É., Sais, L.: Improving backtrack search for SAT by means of redundancy. In: Raś, Z.W., Skowron, A. (eds.) ISMIS 1999. LNCS, vol. 1609, pp. 301–309. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279–285 (2001)

    Google Scholar 

  14. Audemard, G., Bordeaux, L., Hamadi, Y., Jabbour, S., Sais, L.: A generalized framework for conflict analysis. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 21–27. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Biere, A.: Adaptive restart strategies for conflict driven sat solvers. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 28–33. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Pipatsrisawat, K., Darwiche, A.: Width-based restart policies for clause-learning satisfiability solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 341–355. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Sutcliffe, G., Suttner, C.B.: Evaluating general purpose automated theorem proving systems. Artificial Intelligence 131(1-2), 39–54 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. Jurkowiak, B., Li, C.M., Utard, G.: A parallelization scheme based on work stealing for a class of sat solvers. Journal of Automated Reasoning 34(1), 73–101 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  19. Chrabakh, W., Wolski, R.: GrADSAT: A parallel sat solver for the grid. Technical report, UCSB Computer Science Technical Report Number 2003-05 (2003)

    Google Scholar 

  20. Blochinger, W., Sinz, C., Küchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing 29(7), 969–994 (2003)

    Article  Google Scholar 

  21. Böhm, M., Speckenmeyer, E.: A fast parallel sat-solver - efficient workload balancing. Annals of Mathematics and Artificial Intelligence 17(3-4), 381–400 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  22. Gil, L., Flores, P., Silveira, L.M.: PMSat: a parallel version of minisat. Journal on Satisfiability, Boolean Modeling and Computation 6, 71–98 (2008)

    MathSciNet  Google Scholar 

  23. Chu, G., Stuckey, P.J.: Pminisat: a parallelization of minisat 2.0. Technical report, Sat-race 2008, solver description (2008)

    Google Scholar 

  24. Ohmura, K., Ueda, K.: c-sat: A parallel sat solver for clusters. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 524–537. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Wei, W., Li, C.M., Zhang, H.: A switching criterion for intensification and diversification in local search for sat. Journal on Satisfiability, Boolean Modeling and Computation - JSAT 4(2-4), 219–237 (2008)

    MATH  Google Scholar 

  26. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for sat. Journal of Artificial Intelligence Research (JAIR) 32, 565–606 (2008)

    MATH  Google Scholar 

  27. O’Mahony, E., Hebrard, E., Holland, A., Nugent, C., O’Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, AICS 2008 (2008)

    Google Scholar 

  28. Hamadi, Y., Jabbour, S., Sais, L.: Control-based clause sharing in parallel sat solving. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 499–504 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIL - CNRS UMR 8188, Université Lille-Nord de France, Artois, F-62307, Lens

    Long Guo & Lakhdar Sais

  2. Microsoft Research, 7 J J Thomson Avenue, Cambridge, United Kingdom

    Youssef Hamadi

  3. LIX École Polytechnique, F-91128, Palaiseau, France

    Youssef Hamadi

  4. INRIA-Microsoft Research Joint Centre, 28 rue Jean Rostand, 91893, Orsay Cedex, France

    Said Jabbour

Authors
  1. Long Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Youssef Hamadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Said Jabbour
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lakhdar Sais
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Royal Holloway, University of London, Egham, TW20 0EX, Surrey, United Kingdom

    David Cohen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, L., Hamadi, Y., Jabbour, S., Sais, L. (2010). Diversification and Intensification in Parallel SAT Solving. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15396-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15395-2

  • Online ISBN: 978-3-642-15396-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation