Local restarts

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

Volumn 4996 LNCS, Issue , 2008, Pages 271-276

  Ryvchin, Vadim ^a,b   Strichman, Ofer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INTEL CORPORATION   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; PARAMETER ESTIMATION; SET THEORY;

DPLL-BASED SAT SOLVERS; TIME-OUTS;

PROBLEM SOLVING;

EID: 44649200652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79719-7_25     Document Type: Conference Paper

References (8)

1. A. Biere. PicoSAT essentials. JSAT (2008) (to be published)
2. Een, N., Sorensson, N.: Minisat v2.0 (beta). In: Solvers description, SAT-race (2006), http://fmv.jku.at/sat-race-2006/descriptions/27-minisat2.pdf
3. Gomes, C.P., Selman, B., Kautz, H.A.: Boosting combinatorial search through randomization. In: AAAI/IAAI, pp. 431-437 (1998)
4. Huang, J.: The effect of restarts on the efficiency of clause learning. In: IJCAI, pp. 2318-2323 (2007)
5. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. In: ISTCS, pp. 128-133 (1993)
6. Baptista, L.L., Marques Silva, J.P.: Stochastic systematic search algorithms for satisfiability. In: LICS Workshop on Theory and Applications of Satisfiability Testing, pp. 190-204 (2001)
7. Nadel, A., Gordon, M., Palti, A., Hana, Z.: Eureka-2006 SAT solver. In: Solvers description, SAT-race (2006)
8. Pipatsrisawat, K., Darwiche, A.: Rsat 2.0: SAT solver description. In: SAT competition 2007 (2007)