On Solving Boolean Combinations of UTVPI Constraints

Sanjit A. Seshia, K. Subramani, Randal E. Bryant · Journal on Satisfiability Boolean Modeling and Computation · 2007

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 coef

Read the paper · More papers on PaperTik