A Sharp Leap from Quantified Boolean Formula to Stochastic Boolean Satisfiability Solving.
Pei-Wei ChenYu-Ching HuangJie-Hong R. JiangPublished in: AAAI (2021)
Keyphrases
- boolean formula
- boolean satisfiability
- sat solvers
- practical problems
- sat instances
- np complete
- sat problem
- linear constraints
- branch and bound algorithm
- randomly generated
- membership queries
- max sat
- constraint satisfaction
- binary decision diagrams
- orders of magnitude
- probabilistic planning
- integer linear programming
- boolean functions
- phase transition
- genetic algorithm
- stochastic local search
- computational complexity