Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers.
Florent AvellanedaRémi MorinPublished in: ACSD (2011)
Keyphrases
- sat solvers
- orders of magnitude
- sat solving
- constraint satisfaction
- propositional satisfiability
- search tree
- max sat
- boolean satisfiability
- search space
- lower bound
- sat instances
- search strategies
- sat problem
- boolean formula
- upper bound
- weighted max sat
- symmetry breaking
- sat encodings
- clause learning sat solvers
- clause learning