Between restarts and backjumps

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

Volumn 6695 LNCS, Issue , 2011, Pages 216-229

  Ramos, Antonio ^a   Van Der Tak, Peter ^a   Heule, Marijn J H ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CLAUSE LEARNING; COMPUTATIONAL COSTS; NOVEL TECHNIQUES;

FORMAL LOGIC;

EID: 79959392252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21581-0_18     Document Type: Conference Paper

References (15)

1. Biere, A.: P{re,i}coSAT@SC 2009. In: SAT 2009 competitive events booklet: preliminmary version, pp. 41-44 (2009)
2. 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)
3. Ginsberg, M.L.: Dynamic backtracking. J. Artif. Int. Res. 1, 25-46 (1993)
4. Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 121-135. Springer, Heidelberg (1997)
5. Haim, S., Heule, M.J.H.: Towards ultra rapid restarts, Technical report, UNSW and TU Delft (2010), http://www.st.ewi.tudelft.nl/~marijn/publications/ rapid.pdf,
6. Huang, J.: The Effect of Restarts on the Efficiency of Clause Learning. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 2318-2323 (2007)
7. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. In: ISTCS, pp. 128-133 (1993)
8. Marques-Silva, J.P., Lynce, I., Malik, S.: Conflict-Driven Clause Learning SAT Solvers. In: Frontiers in Artificial Intelligence and Applications, vol. 185, ch. 4, pp. 131-153. IOS Press, Amsterdam (February 2009)
9. Marques-Silva, J., Sakallah, K.: Grasp: a search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5), 506-521 (1999)
10. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient sat solver. In: Proceedings of the 38th annual Design Automation Conference, DAC 2001, pp. 530-535. ACM, New York (2001)
11. Nadel, A., Ryvchin, V.: Assignment stack shrinking. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 375-381. Springer, Heidelberg (2010)
12. 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)
13. Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers with restarts. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 654-668. Springer, Heidelberg (2009)
14. Walsh, T.: Search in a small world. In: IJCAI 1999: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 1172-1177 (1999)
15. Zhang, H.: A complete random jump strategy with guiding paths. In: Biere, A., Gomes, C. (eds.) SAT 2006. LNCS, vol. 4121, pp. 96-101. Springer, Heidelberg (2006)