Integration of an LP solver into interval constraint propagation

Authors:
Ernst Althaus;Bernd Becker;Daniel Dumitriu;Stefan Kupferschmid
Affiliations:
Johannes Gutenberg University, Mainz, Germany and Max Planck Institute for Computer Science, Saarbrücken, Germany;Albert Ludwig University, Freiburg, Germany;Johannes Gutenberg University, Mainz, Germany;Albert Ludwig University, Freiburg, Germany
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 10
Cited 0

What's decidable about hybrid automata?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A machine program for theorem-proving

Communications of the ACM
Certifying and repairing solutions to large LPs how good are LP-solvers?

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Safe bounds in linear and mixed-integer linear programming

Mathematical Programming: Series A and B
The MathSAT 4 SMT Solver

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Fast and Accurate Bounds on Linear Programs

SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Integrating ICP and LRA solvers for deciding nonlinear real arithmetic problems

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The OpenSMT solver

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The final NETLIB-LP results

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.