The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits.
Konrad W. SchwerdtfegerPublished in: CSR (2014)
Keyphrases
- boolean satisfiability
- boolean formula
- unsatisfiable cores
- sat solvers
- branch and bound algorithm
- randomly generated
- probabilistic planning
- boolean optimization
- sat solving
- symmetry breaking
- random sat
- integer linear programming
- maximum satisfiability
- max sat
- sat problem
- cnf formula
- combinatorial problems
- phase transition
- branch and bound
- np complete
- random sat instances
- lower bound
- linear constraints
- global constraints
- satisfiability problem
- traveling salesman problem
- orders of magnitude
- search space