Decomposing SAT Problems into Connected Components
Armin Biere, Carsten Sinz · Journal on Satisfiability Boolean Modeling and Computation · 2006
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This observation allows components to be solved individually. We present a te