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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of IJCAI, pp. 399–404 (2009)
Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research 22, 319–351 (2004)
Biere, A.: (p)lingeling, http://fmv.jku.at/lingeling
Chrabakh, W., Wolski, R.: GrADSAT: A parallel SAT solver for the grid. Technical report, UCSB (2003)
Chu, G., Stuckey, P.J., Harwood, A.: Pminisat: a parallelization of minisat 2.0. Technical report, SAT Race (2008)
Darwiche, A., Pipatsrisawat, K.: Complete Algorithms, ch. 3, pp. 99–130. IOS Press (2009)
Hamadi, Y., Jabbour, S., Piette, C., Saïs, L.: Deterministic parallel DPLL. Journal on Satisfiability, Boolean Modeling and Computation 7(4), 127–132 (2011)
Hamadi, Y., Jabbour, S., Saïs, L.: Control-based clause sharing in parallel SAT solving. In: Proceedings of IJCAI, pp. 499–504 (2009)
Hamadi, Y., Jabbour, S., Saïs, L.: Manysat: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation 6, 245–262 (2009)
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)
Kottler, S., Kaufmann, M.: SArTagnan - a parallel portfolio SAT solver with lockless physical clause sharing. In: Pragmatics of SAT (2011)
Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. In: Proceedings of ISTCS, pp. 128–133 (1993)
Marques-Silva, J., Sakallah, K.: GRASP - A New Search Algorithm for Satisfiability. In: Proceedings of ICCAD, pp. 220–227 (1996)
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)
Roussel, O.: ppfolio, http://www.cril.univ-artois.fr/~roussel/ppfolio
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)
Soos, M.: Cryptominisat, http://www.msoos.org/cryptominisat2/
Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: Proceedings of ICCAD, pp. 279–285 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Audemard, G., Hoessen, B., Jabbour, S., Lagniez, JM., Piette, C. (2012). Revisiting Clause Exchange in Parallel SAT Solving. In: Cimatti, A., Sebastiani, R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-31612-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31611-1
Online ISBN: 978-3-642-31612-8
eBook Packages: Computer ScienceComputer Science (R0)