Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees.
Stephen H. BachBert HuangLise GetoorPublished in: AISTATS (2015)
Keyphrases
- max sat
- linear programming
- lower bound
- linear programming relaxation
- weighted max sat
- branch and bound
- search algorithm
- branch and bound algorithm
- maximum satisfiability
- upper bound
- sat solvers
- sat problem
- tabu search
- stochastic local search
- integer programming
- linear program
- satisfiability problem
- np hard
- unsatisfiable cores
- objective function
- variable ordering
- approximation algorithms
- optimal solution
- bayesian networks
- constraint satisfaction
- boolean satisfiability
- random sat instances
- column generation
- orders of magnitude
- dynamic programming
- search space