From Hall's Marriage Theorem to Boolean Satisfiability and Back.
Jonathan LenchnerPublished in: CoRR (2019)
Keyphrases
- boolean satisfiability
- sat solvers
- boolean optimization
- probabilistic planning
- sat solving
- symmetry breaking
- branch and bound algorithm
- integer linear programming
- sat problem
- randomly generated
- maximum satisfiability
- combinatorial problems
- max sat
- constraint satisfaction
- phase transition
- domain independent
- heuristic search
- lower bound
- reinforcement learning
- planning problems