Virtual Substitution for SMT-Solving [chapter]

Florian Corzilius, Erika Ábrahám
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.
more » ... In this paper we present an adaptation of the virtual substitution method, providing these abilities.
doi:10.1007/978-3-642-22953-4_31 fatcat:66peapiggrfwbesvb53uekibl4