A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Virtual Substitution for SMT-Solving
[chapter]
2011
Lecture Notes in Computer Science
SMT-solving aims at deciding satisfiability for the existential fragment of a first-order theory. A SAT-solver handles the logical part of a given problem and invokes an embedded theory solver to check consistency of theory constraints. For efficiency, the theory solver should be able to work incrementally and generate infeasible subsets. Currently available decision procedures for real algebra -the first-order theory of the reals with addition and multiplication -do not exhibit these features.
doi:10.1007/978-3-642-22953-4_31
fatcat:66peapiggrfwbesvb53uekibl4