It’s All about the Support: A New Perspective on the Satisfiability Problem
Dan Vilenchik · Journal on Satisfiability Boolean Modeling and Computation · 2007
We study a new approach to the satisfiability problem, which we call the Support Paradigm . Given a CNF formula F and an assignment to its variables we say that a literal x supports a clause C in F w.r.t. ψ if x is the only literal that evaluates to