Clause Elimination for SAT and QSAT.
Marijn HeuleMatti JärvisaloFlorian LonsingMartina SeidlArmin BierePublished in: J. Artif. Intell. Res. (2015)
Keyphrases
- boolean formula
- sat solvers
- boolean satisfiability
- sat problem
- np complete
- boolean variables
- practical problems
- satisfiability testing
- linear constraints
- conjunctive normal form
- membership queries
- binary decision diagrams
- sat instances
- davis putnam
- propositional satisfiability
- boolean functions
- orders of magnitude
- sat solving
- cnf formula
- search space
- max sat
- constraint satisfaction
- computational complexity
- satisfiability problem
- phase transition
- search strategies
- equivalence queries
- clause learning
- efficient learning