Back to Results
First PageMeta Content
Theoretical computer science / Logic / Mathematics / Constraint programming / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Simplex algorithm / Satisfiability


A Fast Linear-Arithmetic Solver for DPLL(T) Bruno Dutertre and Leonardo de Moura Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, USA {bruno, demoura}@csl.sri.com
Add to Reading List

Document Date: 2015-12-11 18:43:06


Open Document

File Size: 576,37 KB

Share Result on Facebook