The Proof Complexity of SMT Solvers
Open Access
- 18 July 2018
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Tractability and Modern Satisfiability Modulo Theories SolversPublished by Cambridge University Press (CUP) ,2014
- On the power of clause-learning SAT solvers as resolution enginesArtificial Intelligence, 2011
- Resolution over linear equations and multilinear proofsAnnals of Pure and Applied Logic, 2008
- The Time Complexity of Constraint SatisfactionPublished by Springer Science and Business Media LLC ,2008
- A Decision Procedure for Bit-Vectors and ArraysPublished by Springer Science and Business Media LLC ,2007
- Solving SAT and SAT Modulo TheoriesJournal of the ACM, 2006
- DPLL(T): Fast Decision ProceduresLecture Notes in Computer Science, 2004
- Discretely ordered modules as a first-order extension of the cutting planes proof systemThe Journal of Symbolic Logic, 1998
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979