The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits.
Konrad W. SchwerdtfegerPublished in: CoRR (2013)
Keyphrases
- boolean satisfiability
- boolean formula
- unsatisfiable cores
- sat solvers
- boolean optimization
- probabilistic planning
- branch and bound algorithm
- randomly generated
- symmetry breaking
- sat solving
- maximum satisfiability
- integer linear programming
- sat problem
- random sat
- combinatorial problems
- practical problems
- np complete
- upper bound
- max sat
- search tree
- boolean functions
- phase transition
- planning problems
- lower bound
- cnf formula
- membership queries
- linear constraints
- satisfiability problem