The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits.
Konrad W. SchwerdtfegerPublished in: Theory Comput. Syst. (2017)
Keyphrases
- boolean satisfiability
- unsatisfiable cores
- boolean formula
- sat solvers
- boolean optimization
- probabilistic planning
- sat solving
- sat problem
- randomly generated
- branch and bound algorithm
- maximum satisfiability
- integer linear programming
- random sat
- symmetry breaking
- max sat
- np complete
- cnf formula
- phase transition
- heuristic search
- sat instances
- satisfiability problem
- search algorithm
- optimal solution
- membership queries
- np hard
- linear constraints
- special case