Conflict driven learning in a quantified Boolean Satisfiability solver.
Lintao ZhangSharad MalikPublished in: ICCAD (2002)
Keyphrases
- driven learning
- boolean satisfiability
- sat solving
- boolean formula
- sat solvers
- clause learning
- symmetry breaking
- branch and bound algorithm
- probabilistic planning
- randomly generated
- sat problem
- integer linear programming
- semi supervised learning
- np complete
- max sat
- constraint satisfaction
- practical problems
- phase transition
- combinatorial problems
- sat instances
- satisfiability problem
- word alignment
- domain theory
- propositional satisfiability
- search tree
- binary decision diagrams
- branch and bound
- constraint programming
- np hard