On Solving Boolean Combinations of UTVPI Constraints

We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at most two variables with non-zero coefficients, where furthermore those coefficients must

• Type: Journal
• Year: 2007
• Where: JSAT
• Authors: Sanjit A. Seshia, K. Subramani, Randal E. Bryant
• Keywords: Boolean Combinations, JSAT 2007, Linear Constraint, Satisfiability Problem