Inferring Clauses and Formulas in Max-SAT.
Matthieu PyMohamed Sami CherifDjamal HabetPublished in: ICTAI (2021)
Keyphrases
- max sat
- cnf formula
- unsatisfiable cores
- random sat
- lower bound
- sat solvers
- branch and bound algorithm
- weighted max sat
- sat problem
- max sat solver
- propositional formulas
- search algorithm
- boolean formula
- tabu search
- conjunctive normal form
- satisfiability problem
- branch and bound
- boolean satisfiability
- maximum satisfiability
- constraint satisfaction
- linear programming
- stochastic local search
- search space
- propositional satisfiability
- state space
- np complete
- upper bound
- unit propagation
- horn clauses
- computational complexity
- integer programming
- optimal solution