A case for simple SAT solvers

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

Volumn 4741 LNCS, Issue , 2007, Pages 839-846

  Huang, Jinbo ^a  

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); OPTIMIZATION; PROBLEM SOLVING;

REAL-WORLD PROBLEMS; SOPHISTICATED IMPLEMENTATIONS;

REAL TIME SYSTEMS;

EID: 38149107610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_62     Document Type: Conference Paper

References (17)

1. Beame, P., Kautz, H., Sabharwal, A.: Understanding the power of clause learning. In: IJCAI, pp. 1194-1201 (2003)
2. Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. JAIR 22, 319-351 (2004)
3. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61-75. Springer, Heidelberg (2005)
4. Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: DATE, pp. 142-149 (2002)
5. Huang, J.: The effect of restarts on the efficiency of clause learning. In: IJCAI, pp. 2318-2323 (2007)
6. Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: IJCAI, pp. 366-371 (1997)
7. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters 47(4), 173-180 (1993)
8. Lynce, I., Silva, J.P.M.: Complete unrestricted backtracking algorithms for satisfiability. In: SAT (2002)
9. Marques-Silva, J., Sakallah, K.: GRASP - A new search algorithm for satisfiability. In: ICCAD, pp. 220-227 (1996)
10. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC, pp. 530-535 (2001)
11. Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: SAT, pp. 294-299 (2007)
12. Pipatsrisawat, T., Darwiche, A.: SAT solver description: Rsat. In: SAT-Race (2006)
13. Sinz, C.: SAT Race (2006), http://fmv.jku.at/sat-race-2006
14. Zarpas, E.: Benchmarking SAT solvers for bounded model checking. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 340-354. Springer, Heidelberg (2005)
15. Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: ICCAD, pp. 279-285 (2001)
16. Zhang, L.: On subsumption removal and on-the-fly CNF simplification. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 482-489. Springer, Heidelberg (2005)
17. Zhang, L., Malik, S.: Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In: DATE, pp. 10880-10885 (2003)