On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers.
Rohan FosséLaurent SimonPublished in: CP (2018)
Keyphrases
- sat solvers
- max sat
- clause learning
- clause learning sat solvers
- orders of magnitude
- weighted max sat
- sat problem
- propositional satisfiability
- boolean satisfiability
- lower bound
- sat instances
- satisfiability problem
- search space
- graph coloring
- constraint satisfaction
- search strategies
- search tree
- sat solving
- branch and bound algorithm
- stochastic local search
- tabu search
- cnf formula
- theorem prover
- branch and bound
- search algorithm
- propositional formulas
- max sat solver
- vector space
- propositional logic
- constraint satisfaction problems
- np complete
- linear programming
- sat encodings
- answer sets