Towards a better understanding of the functionality of a conflict-driven SAT solver

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

Volumn 4501 LNCS, Issue , 2007, Pages 287-293

  Dershowitz, Nachum ^a,c   Hanna, Ziyad ^b   Nadel, Alexander ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b INTEL CORPORATION   (Israel)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; LEARNING SYSTEMS; PROBLEM SOLVING;

FLIPPED VARIABLES; SAT SOLVERS;

DECISION TREES;

EID: 38049101082     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_27     Document Type: Conference Paper

References (5)

1. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In DAC'01, pages 530-535, 2001.
2. A. Nadel, M. Gordon, A. Palti, and Z. Hanna. Eureka-2006 SAT solver. http://fmv.jku.at/sat-race-2006/descriptions/4-Eureka.pdf.
3. L. O. Ryan. Efficient algorithms for clause learning SAT solvers. Master's thesis, Simon Fraser University, Burnaby, Canada, 2004.
4. J. P. M. Silva and K. A. Sakallah. GRASP - a new search algorithm for satisfiability. In ICCAD'96, pages 220-227. IEEE Computer Society, 1996.
5. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In ICCAD'01, pages 279-285. IEEE Press, 2001.