Coverage-Based Clause Reduction Heuristics for CDCL Solvers.
Hidetomo NabeshimaKatsumi InouePublished in: SAT (2017)
Keyphrases
- unit propagation
- clause learning
- sat solvers
- sat encodings
- search tree
- max sat
- propositional satisfiability
- sat problem
- search space
- conjunctive normal form
- sat solving
- davis putnam
- search strategies
- boolean formula
- orders of magnitude
- constraint satisfaction
- heuristic search
- satisfiability problem
- sat instances
- search algorithm
- truth values
- branch and bound algorithm
- np complete
- cnf formula
- branch and bound
- variable ordering
- propositional logic
- temporal logic
- combinatorial problems
- randomly generated