Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

JSAT
2007

favoriteEmaildiscussreport

47views more JSAT 2007»

On Solving Boolean Combinations of UTVPI Constraints

13 years 4 months ago

On Solving Boolean Combinations of UTVPI Constraints

Download jsat.ewi.tudelft.nl

We consider the satisﬁability 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 coeﬃcients, where furthermore those coeﬃcients must

Sanjit A. Seshia, K. Subramani, Randal E. Bryant

Real-time Traffic

Boolean Combinations | JSAT 2007 | Linear Constraint | Satisﬁability Problem |

claim paper

Related Content

» clpB Combining Simplicity and Efficiency in Boolean Constraint Solving

» Lazy Clause Generation Combining the Power of SAT and CP and MIP Solving

» A SATBased Decision Procedure for the Boolean Combination of Difference Constraints

» Solving topological constraints for declarative families of objects

» Solving MAXrSAT Above a Tight Lower Bound

» Flexible TwoLevel Boolean Minimizer BOOMII and Its Applications

» Pueblo A Hybrid PseudoBoolean SAT Solver

» ConstraintBased Approach for Analysis of Hybrid Systems

» Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	JSAT
Authors	Sanjit A. Seshia, K. Subramani, Randal E. Bryant

Comments (0)