Integration of an LP Solver into Interval Constraint Propagation

This paper describes the integration of an LP solver into iSAT, a Satisfiability Modulo Theories solver that can solve Boolean combinations of linear and nonlinear constraints. iSAT is a tight integration of the well-known DPLL algorithm and interval constraint propagation allowing it to reason about linear and nonlinear constraints. As interval arithmetic is known to be less efficient on solving linear programs, we will demonstrate how the integration of an LP solver can improve the overall solving performance of iSAT.

[1]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[2]  Sriram Sankaranarayanan,et al.  Integrating ICP and LRA solvers for deciding nonlinear real arithmetic problems , 2010, Formal Methods in Computer Aided Design.

[3]  Roland Wunderling,et al.  Paralleler und objektorientierter Simplex-Algorithmus , 1996 .

[4]  Ernst Althaus,et al.  Fast and Accurate Bounds on Linear Programs , 2009, SEA.

[5]  Christoph Scholl,et al.  Using Implications for Optimizing State Set Representations of Linear Hybrid Systems , 2009, MBMV.

[6]  Roberto Bruttomesso,et al.  The MathSAT 4 SMT Solver ( Tool Paper ) , 2008 .

[7]  Thorsten Koch.  The final NETLIB-LP results , 2004, Oper. Res. Lett..

[8]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[9]  Bruno Dutertre,et al.  A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[10]  Frédéric Besson.  On using an inexact floating-point LP solver for deciding linear arithmetic in an SMT solver , 2010 .

[11]  Roberto Bruttomesso,et al.  The OpenSMT Solver , 2010, TACAS.

[12]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[13]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[14]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[15]  Kurt Mehlhorn,et al.  Certifying and repairing solutions to large LPs how good are LP-solvers? , 2003, SODA '03.

[16]  Arnold Neumaier,et al.  Safe bounds in linear and mixed-integer linear programming , 2004, Math. Program..

[17]  Frédéric Benhamou,et al.  Continuous and Interval Constraints , 2006, Handbook of Constraint Programming.

[18]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.