A New Encoding from MinSAT into MaxSAT.
Zhu ZhuChu Min LiFelip ManyàJosep ArgelichPublished in: CP (2012)
Keyphrases
- unsatisfiable cores
- branch and bound algorithm
- boolean satisfiability
- sat problem
- combinatorial optimization problems
- sat solvers
- combinatorial optimization
- maximum satisfiability
- hidden structure
- max sat
- combinatorial auctions
- lower bound
- upper bound
- branch and bound
- sat instances
- randomly generated
- metaheuristic
- integer linear programming
- probabilistic planning
- satisfiability problem
- phase transition
- search tree
- np complete
- np hard
- search space
- objective function
- neural network
- constraint satisfaction
- tabu search
- orders of magnitude
- special case