Width-based restart policies for clause-learning satisfiability solvers

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

Volumn 5584 LNCS, Issue , 2009, Pages 341-355

  Pipatsrisawat, Knot ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL PROBLEM; RESTART POLICY; SAT PROBLEMS; SAT SOLVERS; SATISFIABILITY SOLVERS; SPECIAL CLASS;

EID: 70350646576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02777-2_32     Document Type: Conference Paper

References (28)

1. Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Principles and Practice of Constraint Programming, pp. 121-135 (1997)
2. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an effcient sat solver. In: Proc. of DAC 2001, pp. 530-535 (2001)
3. Eeń, 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)
4. Goldberg, E., Novikov, Y.: Berkmin: A fast and robust sat-solver. In: DATE 2002, pp. 142-149 (2002)
5. Huang, J.: The effect of restarts on the effciency of clause learning. In: Proc. of IJCAI 2007, pp. 2318-2323 (2007)
6. 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)
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)
8. Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. JAIR 22, 319-351 (2004)
9. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. J. ACM 48(2), 149-169 (2001)
10. Ryan, L.: Effcient Algorithms for Clause-Learning SAT Solvers. Master's thesis, Simon Fraser University (2004)
11. Zhang, L., Malik, S.: Validating sat solvers using an independent resolution-based checker: Practical implementations and other applications. In: DATE 2003, pp. 880-885 (2003)
12. Galil, Z.: On resolution with clauses of bounded size. SIAM Journal on Computing 6(3), 444-459 (1977)
13. Beame, P., Pitassi, T.: Simplified and improved resolution lower bounds. In: Annual IEEE Symposium on Foundations of Computer Science, p. 274 (1996)
14. Mahajan, Y.S., Fu, Z., Malik, S.: Zchaff2004: An effcient sat solver. In: Proc. of SAT 2005, pp. 360-375 (2005)
15. Nadel, A., Gordon, M., Patti, A., Hanna, Z.: Eureka-2006 sat solver Solver description for SAT-Race 2006 (2006)
16. Biere, A.: Picosat essentials. JSAT, 75-97 (2008)
17. Huang, J.: A case for simple SAT solvers. In: Bessiére, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 839-846. Springer, Heidelberg (2007)
18. Pipatsrisawat, K., Darwiche, A.: Rsat 2.0: Sat solver description. Technical Report D-153, Automated Reasoning Group, Computer Science Department, UCLA (2007)
19. Sörensson, N., Eeń, N.: Minisat 2.1 and minisat++ 1.0-sat race 2008 editions (2008)
20. Ben-Sasson, E., Impagliazzo, R., Wigderson, A.: Near optimal separation of tree-like and general resolution. Combinatorica 24(4), 585-603 (2004)
21. Babíc, D., Hu, A.J.: Structural Abstraction of Software Verification Conditions. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 371-383. Springer, Heidelberg (2007)
22. Babíc, D., Hu, A.J.: Calysto: Scalable and Precise Extended Static Checking. In: Proc. of ICSE 2008, pp. 211-220 (2008)
23. Hertel, A., Urquhart, A.: Comments on eccc report tr06-133: The resolution width problem is exptime-complete. Technical Report TR09-003, ECCC (2009)
24. 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)
25. Dechter, R.: Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell. 41(3), 273-312 (1990)
26. Bayardo, R.J., Miranker, D.P.: A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In: AAAI 1996, pp. 298-304 (1996)
27. Bayardo, R.J.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proc. of AAAI 1997, Providence, Rhode Island, pp. 203-208 (1997)
28. Nadel, A.: Backtrack search algorithms for propositional logic satisfiability: Review and innovations. Master's thesis, The Hebrew University (2002)