Solving MaxSAT and #SAT on Structured CNF Formulas.
Sigve Hortemo SætherJan Arne TelleMartin VatshellePublished in: SAT (2014)
Keyphrases
- sat problem
- cnf formula
- sat solvers
- np complete problems
- sat instances
- max sat
- sat solving
- boolean satisfiability
- boolean optimization
- satisfiability problem
- weighted max sat
- np complete
- stochastic local search
- davis putnam
- maximum satisfiability
- propositional satisfiability
- constraint satisfaction problems
- phase transition
- combinatorial optimization
- randomly generated
- sat encodings
- branch and bound algorithm
- conjunctive normal form
- search algorithm
- propositional formulas
- decision problems
- constraint satisfaction
- upper bound
- orders of magnitude
- pseudo boolean
- graph coloring
- boolean formula
- search strategies
- search space
- cellular automata
- branch and bound