Resolution for Stochastic Boolean Satisfiability.
Tino TeigeMartin FränzlePublished in: LPAR (Yogyakarta) (2010)
Keyphrases
- boolean satisfiability
- clause learning
- sat solvers
- boolean optimization
- probabilistic planning
- sat solving
- branch and bound algorithm
- integer linear programming
- randomly generated
- symmetry breaking
- sat problem
- maximum satisfiability
- max sat
- search space
- combinatorial problems
- phase transition
- branch and bound
- constraint satisfaction
- domain independent
- orders of magnitude