2 citations · 3 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021
On the proof complexity of MCSAT
Gereon Kremer, Erika Abraham, Vijay Ganesh
Satisfiability Modulo Theories (SMT) and SAT solvers are critical components in many formal software tools, primarily due to the fact that they are able to easily solve logical pro…
cs.LO2021
Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic
Erika Abraham, James H. Davenport, Matthew England +1
We discuss the topic of unsatisfiability proofs in SMT, particularly with reference to quantifier free non-linear real arithmetic. We outline how the methods here do not admit triv…