The Optimality of a Fast CNF Conversion and its Use with SAT.
Daniel SheridanPublished in: SAT (2004)
Keyphrases
- sat solvers
- sat solving
- propositional satisfiability
- sat problem
- sat instances
- model counting
- conjunctive normal form
- boolean satisfiability
- cnf formula
- stochastic local search
- max sat
- satisfiability problem
- orders of magnitude
- boolean formula
- clause learning
- search tree
- propositional logic
- search strategies
- constraint satisfaction
- sat encodings
- optimal solution
- boolean functions
- knowledge compilation
- np complete
- search space
- weighted model counting
- automated reasoning
- phase transition
- constraint programming
- symmetry breaking
- variable ordering
- functional dependencies
- data conversion
- unit propagation
- evolutionary algorithm
- search algorithm