Diversification and intensification in parallel SAT solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6308 LNCS, Issue , 2010, Pages 252-265

  Guo, Long ^a   Hamadi, Youssef ^b,c   Jabbour, Said ^d   Sais, Lakhdar ^a  

^a UNIV LILLE   (France)

^b MICROSOFT RESEARCH   (United Kingdom)

^c ÉCOLE POLYTECHNIQUE   (France)

^d Parc Orsay Université   (France)

Author keywords

SAT and CSP; Satisfiability; Search

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; DECISION THEORY;

COMPUTATIONAL UNITS; SAT AND CSP; SAT INSTANCES; SATISFIABILITY; SEARCH; SEARCH ALGORITHMS; SEARCH EFFORTS; SEARCH STRATEGIES;

MODEL CHECKING;

EID: 78149260369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15396-9_22     Document Type: Conference Paper

References (28)

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)
2. Lewis, M.D.T., Schubert, T., Becker, B.: Multithreaded sat solving. In: ASP-DAC, pp. 926-931 (2007)
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) (Pubitemid 126159673)
4. Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation - JSAT 6, 245-262 (2009)
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)
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)
7. Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Communications of the ACM 5(7), 394-397 (1962)
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)
9. Kautz, H.A., Horvitz, E., Ruan, Y., Gomes, C.P., Selman, B.: Dynamic restart policies. In: AAAI/IAAI, pp. 674-681 (2002)
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)
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)
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)
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)
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)
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)
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)
17. Sutcliffe, G., Suttner, C.B.: Evaluating general purpose automated theorem proving systems. Artificial Intelligence 131(1-2), 39-54 (2001) (Pubitemid 32798577)
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) (Pubitemid 40609506)
19. Chrabakh, W., Wolski, R.: GrADSAT: A parallel sat solver for the grid. Technical report, UCSB Computer Science Technical Report Number 2003-05 (2003)
20. Blochinger, W., Sinz, C., Küchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing 29(7), 969-994 (2003)
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)
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)
23. Chu, G., Stuckey, P.J.: Pminisat: a parallelization of minisat 2.0. Technical report, Sat-race 2008, solver description (2008)
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)
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)
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)
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)
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)