Solving MaxSAT and #SAT on structured CNF formulas.
Sigve Hortemo SætherJan Arne TelleMartin VatshellePublished in: CoRR (2014)
Keyphrases
- sat problem
- cnf formula
- sat solvers
- max sat
- boolean satisfiability
- sat instances
- sat solving
- np complete problems
- boolean optimization
- weighted max sat
- satisfiability problem
- np complete
- stochastic local search
- phase transition
- propositional satisfiability
- maximum satisfiability
- boolean formula
- davis putnam
- conjunctive normal form
- randomly generated
- constraint satisfaction problems
- combinatorial optimization
- sat encodings
- orders of magnitude
- graph coloring
- search space
- propositional formulas
- lower bound
- pseudo boolean
- upper bound
- constraint satisfaction
- search strategies
- branch and bound
- integer linear programming
- computational complexity
- evolutionary algorithm
- symmetry breaking
- simulated annealing
- knowledge compilation
- automated reasoning
- branch and bound algorithm
- decision problems