Analysis and Solving SAT and MAX-SAT Problems Using an L-partition Approach.
Alexander A. KolokolovAlexander AdelshinDarya YagofarovaPublished in: J. Math. Model. Algorithms Oper. Res. (2013)
Keyphrases
- weighted max sat
- max sat
- sat solvers
- graph coloring
- sat solving
- stochastic local search
- np complete problems
- propositional satisfiability
- sat problem
- maximum satisfiability
- satisfiability problem
- branch and bound algorithm
- np complete
- combinatorial optimization
- tabu search
- lower bound
- variable ordering
- search algorithm
- boolean satisfiability
- boolean formula
- branch and bound
- probabilistic planning
- randomly generated
- orders of magnitude
- constraint satisfaction problems
- reinforcement learning
- random sat instances