Advertisement

Revisiting Clause Exchange in Parallel SAT Solving

  • Gilles Audemard
  • Benoît Hoessen
  • Saïd Jabbour
  • Jean-Marie Lagniez
  • Cédric Piette
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7317)

Abstract

Managing learnt clause database is known to be a tricky task in SAT solvers. In the portfolio framework, the collaboration between threads through learnt clause exchange makes this problem even more difficult to tackle. Several techniques have been proposed in the last few years, but practical results are still in favor of very limited collaboration, or even no collaboration at all. This is mainly due to the difficulty that each thread has to manage a large amount of learnt clauses generated by the other workers. In this paper, we propose new efficient techniques for clause exchanges within a parallel SAT solver. In contrast to most of the current clause exchange methods, our approach relies on both export and import policies, and makes use of recent techniques that proves very effective in the sequential case. Extensive experimentations show the practical interest of the proposed ideas.

Keywords

Unit Clause Small Clause Multicore Architecture Sequential Solver Export Strategy 
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.
    Audemard, G., Lagniez, J.-M., Mazure, B., Saïs, L.: On Freezing and Reactivating Learnt Clauses. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 188–200. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of IJCAI, pp. 399–404 (2009)Google Scholar
  3. 3.
    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
  4. 4.
    Biere, A.: (p)lingeling, http://fmv.jku.at/lingeling
  5. 5.
    Chrabakh, W., Wolski, R.: GrADSAT: A parallel SAT solver for the grid. Technical report, UCSB (2003)Google Scholar
  6. 6.
    Chu, G., Stuckey, P.J., Harwood, A.: Pminisat: a parallelization of minisat 2.0. Technical report, SAT Race (2008)Google Scholar
  7. 7.
    Darwiche, A., Pipatsrisawat, K.: Complete Algorithms, ch. 3, pp. 99–130. IOS Press (2009)Google Scholar
  8. 8.
    Hamadi, Y., Jabbour, S., Piette, C., Saïs, L.: Deterministic parallel DPLL. Journal on Satisfiability, Boolean Modeling and Computation 7(4), 127–132 (2011)Google Scholar
  9. 9.
    Hamadi, Y., Jabbour, S., Saïs, L.: Control-based clause sharing in parallel SAT solving. In: Proceedings of IJCAI, pp. 499–504 (2009)Google Scholar
  10. 10.
    Hamadi, Y., Jabbour, S., Saïs, L.: Manysat: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation 6, 245–262 (2009)zbMATHGoogle Scholar
  11. 11.
    Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 385–399. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Kottler, S., Kaufmann, M.: SArTagnan - a parallel portfolio SAT solver with lockless physical clause sharing. In: Pragmatics of SAT (2011)Google Scholar
  13. 13.
    Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. In: Proceedings of ISTCS, pp. 128–133 (1993)Google Scholar
  14. 14.
    Marques-Silva, J., Sakallah, K.: GRASP - A New Search Algorithm for Satisfiability. In: Proceedings of ICCAD, pp. 220–227 (1996)Google Scholar
  15. 15.
    Pipatsrisawat, K., Darwiche, A.: A Lightweight Component Caching Scheme for Satisfiability Solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294–299. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  16. 16.
  17. 17.
    Schubert, T., Lewis, M., Becker, B.: Pamiraxt: Parallel SAT solving with threads and message passing. Journal on Satisfiability, Boolean Modeling and Computation 6(4), 203–222 (2009)zbMATHGoogle Scholar
  18. 18.
    Soos, M.: Cryptominisat, http://www.msoos.org/cryptominisat2/
  19. 19.
    Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: Proceedings of ICCAD, pp. 279–285 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Gilles Audemard
    • 1
  • Benoît Hoessen
    • 1
  • Saïd Jabbour
    • 1
  • Jean-Marie Lagniez
    • 2
  • Cédric Piette
    • 1
  1. 1.Université Lille-Nord de France, CRIL - CNRS UMR 8188LensFrance
  2. 2.Institute for Formal Models and VerificationJohannes Kepler UniversityLinzAustria

Personalised recommendations