Computing Max-SAT Refutations using SAT Oracles.
Matthieu PyMohamed Sami CherifDjamal HabetPublished in: ICTAI (2021)
Keyphrases
- max sat
- sat solvers
- sat problem
- weighted max sat
- satisfiability problem
- lower bound
- branch and bound algorithm
- branch and bound
- tabu search
- search algorithm
- graph coloring
- boolean satisfiability
- maximum satisfiability
- stochastic local search
- constraint satisfaction
- propositional satisfiability
- sat solving
- variable ordering
- max sat solver
- sat instances
- np complete
- orders of magnitude
- unsatisfiable cores
- random sat instances
- search strategies
- cnf formula
- linear programming
- decision problems
- constraint satisfaction problems
- unit propagation
- np hard
- genetic algorithm
- neural network