Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT.
Chu Min LiFelip ManyàJordi PlanesPublished in: AAAI (2006)
Keyphrases
- combinatorial problems
- max sat
- branch and bound algorithm
- lower bound
- constraint satisfaction
- upper bound
- branch and bound
- maximum satisfiability
- exact algorithms
- variable ordering
- randomly generated
- np hard
- optimal solution
- weighted max sat
- boolean satisfiability
- objective function
- sat solvers
- cnf formula
- linear programming
- neural network
- max sat solver
- search algorithm
- stochastic local search
- sat problem
- satisfiability problem
- learning algorithm
- unsatisfiable cores
- information retrieval