Clause Simplifications in Search-Space Decomposition-Based Sat Solvers.
Tobias PhilippPublished in: STAIRS (2014)
Keyphrases
- sat solvers
- search space
- clause learning
- search tree
- max sat
- sat solving
- propositional satisfiability
- boolean satisfiability
- heuristic search
- sat instances
- search strategy
- boolean formula
- sat problem
- search algorithm
- metaheuristic
- branch and bound
- unit propagation
- constraint satisfaction
- optimal solution
- constraint satisfaction problems
- cnf formula
- clause learning sat solvers
- orders of magnitude
- state space
- theorem prover
- answer sets
- data structure