On Probabilistic Generalization of Backdoors in Boolean Satisfiability.
Alexander A. SemenovArtem PavlenkoDaniil ChivilikhinStepan KochemazovPublished in: AAAI (2022)
Keyphrases
- boolean satisfiability
- probabilistic planning
- sat solvers
- sat instances
- boolean optimization
- sat solving
- randomly generated
- sat problem
- orders of magnitude
- heuristic search
- maximum satisfiability
- symmetry breaking
- branch and bound algorithm
- planning under uncertainty
- search space
- integer linear programming
- planning problems
- max sat
- propositional satisfiability
- search strategies
- constraint programming
- search algorithm
- hidden structure