Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search.
Zhaohui FuSharad MalikPublished in: ICCAD (2006)
Keyphrases
- minimum cost
- satisfiability problem
- branch and bound search
- search algorithm
- np hard
- branch and bound
- network flow problem
- np complete
- search tree
- sat instances
- sat solvers
- network flow
- approximation algorithms
- search heuristics
- arc consistency
- search strategy
- sat problem
- spanning tree
- temporal logic
- lagrangian relaxation
- iterative deepening
- network design problem
- max sat
- phase transition
- constraint satisfaction problems
- boolean satisfiability
- lower bound
- heuristic search
- cutting plane algorithm
- special case
- sat encodings
- optimal solution
- search problems
- constraint satisfaction
- model checking
- randomly generated
- integer programming
- planning problems
- linear programming
- search space
- genetic algorithm