BAXMC: a CEGAR approach to Max\#SAT.
Thomas VigourouxCristian EneDavid MonniauxLaurent MounierMarie-Laure PotetPublished in: CoRR (2022)
Keyphrases
- max sat
- weighted max sat
- sat solvers
- lower bound
- search algorithm
- tabu search
- branch and bound
- sat problem
- satisfiability problem
- branch and bound algorithm
- constraint satisfaction
- stochastic local search
- variable ordering
- linear programming
- maximum satisfiability
- unsatisfiable cores
- boolean satisfiability
- max sat solver
- cnf formula
- propositional satisfiability
- upper bound
- neural network
- search strategies
- orders of magnitude
- np hard
- information retrieval