Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection.
Nian-Ze LeeYen-Shi WangJie-Hong R. JiangPublished in: IJCAI (2018)
Keyphrases
- boolean satisfiability
- boolean optimization
- random sat instances
- boolean formula
- sat solving
- randomly generated
- sat solvers
- sat problem
- branch and bound algorithm
- random sat
- probabilistic planning
- integer linear programming
- search space
- sat instances
- stochastic local search
- symmetry breaking
- clause learning
- np complete
- satisfiability problem
- combinatorial problems
- cnf formula
- orders of magnitude
- davis putnam logemann loveland
- practical problems
- phase transition
- constraint satisfaction
- constraint satisfaction problems
- upper bound
- np hard
- lower bound