Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results.
Zhengbing BianFabián A. ChudakWilliam G. MacreadyAidan RoyRoberto SebastianiStefano VarottiPublished in: CoRR (2018)
Keyphrases
- boolean satisfiability
- boolean optimization
- sat solvers
- sat encodings
- sat instances
- sat solving
- sat problem
- maximum satisfiability
- branch and bound algorithm
- probabilistic planning
- randomly generated
- orders of magnitude
- symmetry breaking
- np complete problems
- stochastic local search
- combinatorial optimization
- constraint satisfaction
- boolean formula
- weighted max sat
- propositional satisfiability
- satisfiability problem
- max sat
- search space
- combinatorial problems
- np complete
- random sat instances
- constraint satisfaction problems
- integer linear programming
- upper bound
- search tree
- unsatisfiable cores
- computational complexity
- quantum computing
- search algorithm
- linear programming
- pseudo boolean constraints