On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming.
Gregory MorseTamás KozsikPublished in: ICACS (2023)
Keyphrases
- max sat
- integer programming
- boolean logic
- max sat solver
- sat solvers
- linear programming
- weighted max sat
- np hard
- lower bound
- sat problem
- tabu search
- branch and bound algorithm
- branch and bound
- satisfiability problem
- search algorithm
- variable ordering
- exact algorithms
- stochastic local search
- optimal solution
- constraint programming
- propositional satisfiability
- dynamic programming
- boolean satisfiability
- column generation
- ai planning
- maximum satisfiability
- cutting plane
- minimum cost
- upper bound
- random sat instances
- np complete
- constraint satisfaction
- cnf formula
- sat encodings
- global constraints
- decision problems