Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability.
Shaowei CaiZhendong LeiPublished in: Artif. Intell. (2020)
Keyphrases
- max sat
- maximum satisfiability
- sat solvers
- boolean satisfiability
- lower bound
- graph coloring
- tabu search
- branch and bound algorithm
- sat problem
- constraint satisfaction
- branch and bound
- satisfiability problem
- linear programming
- search tree
- cnf formula
- variable ordering
- search algorithm
- orders of magnitude
- logic programs
- combinatorial problems
- upper bound