Leveraging linear and mixed integer programming for SMT
By Tim King, Clark W. Barrett, Cesare Tinelli. 2014
22 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Clark W. Barrett
- Guy Katz
- David L. Dill
- Tim King
- Mykel J. Kochenderfer
- Kyle D. Julian
- Cesare Tinelli
- Andrew Reynolds
In Computational Theory and Mathematics
- Clark W. Barrett
- Guy Katz
- David L. Dill
- Tim King
- Mykel J. Kochenderfer
- Cesare Tinelli
- Kyle D. Julian
- Andrew Reynolds
In Computer Networks and Communications
Citations in the corpus
- Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks (2017, background): “Another direction is to provide better soundness guarantees without harming performance, for example by replaying floating-point solutions using precise arithmetic [17], or by producing externally-checkable correctness proofs [15].”
- Effective Algorithms for the Satisfiability of Quantifier-Free Formulas Over Linear Real and Integer Arithmetic (2014, background): “The content of this chapter is to appear in FMCAD’14 [74].”
- cvc5: A Versatile and Industrial-Strength SMT Solver (2022, methodology): “It implements a sum-of-infeasibilities-based heuristic [79], an integration with the external GLPK LP solver [80], and certain heuristics proposed by Griggio [63].”