Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report.
Zhengbing BianFabián A. ChudakWilliam G. MacreadyAidan RoyRoberto SebastianiStefano VarottiPublished in: FroCoS (2017)
Keyphrases
- sat solvers
- boolean satisfiability
- boolean optimization
- sat problem
- sat solving
- sat instances
- np complete problems
- combinatorial optimization
- variable ordering
- sat encodings
- branch and bound algorithm
- pseudo boolean
- maximum satisfiability
- propositional satisfiability
- solving hard
- graph coloring
- quantum mechanics
- stochastic local search
- upper bound
- phase transition
- satisfiability problem
- artificial intelligence
- search strategies
- solving problems
- combinatorial problems
- np complete
- search algorithm
- quantum computation
- quantum computing
- search space
- randomly generated
- np hard
- boolean formula
- search problems
- heuristic search
- integer linear programming