A SAT-Based Approach to MinSAT.
Carlos AnsóteguiChu Min LiFelip ManyàZhu ZhuPublished in: CCIA (2012)
Keyphrases
- sat problem
- boolean satisfiability
- sat solvers
- sat instances
- satisfiability problem
- unsatisfiable cores
- combinatorial optimization problems
- branch and bound algorithm
- propositional satisfiability
- max sat
- np complete
- constraint satisfaction problems
- randomly generated
- probabilistic planning
- phase transition
- combinatorial auctions
- maximum satisfiability
- integer linear programming
- search strategies
- symmetry breaking
- constraint satisfaction
- orders of magnitude
- lower bound
- graph coloring
- decision problems
- boolean formula
- dynamic programming