Solving Boolean Combinations of Generalized 2SAT Constraints

摘要

We consider the satisfiability problem for Boolean combinations of generalized 2 SAT constraints, which are linear constraints with at most two, possibly unbounded, integer variables having coefficients in (-1,1).