The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisfiability modulo theory (SMT), using a mixture of a SAT solver and a simplex-based decision procedure for conjunctions. State-of-the-art SMT solvers use simplex implementations over rational numbers, which perform well for typical problems arising from model-checking and program analysis (sparse inequalities, smallarXiv:0904.3525v1 fatcat:vgmwnfhd7ngz7ey43tmi5a6qra