Efficient conflict driven learning in a boolean satisfiability solver

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2001, Pages 279-285

  Zhang, Lintao ^a   Madigan, Conor F ^b   Moskewicz, Matthew H ^c   Malik, Sharad ^a  

^a Princeton University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; LEARNING SYSTEMS; PROBLEM SOLVING;

BOOLEAN SATISFIABILITY PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0035209012     PISSN: 10923152     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICCAD.2001.968634     Document Type: Article

References (19)

1. Combinational test generation using satisfiability
2. Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors
3. Symbolic model checking without BDDs
4. Local search strategies for satisfiability testing
5. GRASP: A search algorithm for propositional satisfiability
6. Using CSP look-back techniques to solve real-world SAT instances
7. SATO: An efficient propositional prover
8. Chaff: Engineering an efficient SAT solver
9. A machine program for theorem proving
10. Chaff: A fast SAT solver for EDA applications
11. The impact of branching heuristics in propositional satisfiability algorithms
12. Heuristics based on unit propagation for satisfiability problems
13. Integrating equivalency reasoning into Davis-Putnam procedure
14. Boosting combinatorial search through randomization
15. A new approach to the maximum flow problem