We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Most state-of-the-art approaches for Satisfiability Modulo Theories (SMT(T)) rely on the integration between a SAT solver and a decision procedure for sets of literals in the background theory T(T-solver) . Often T is the combination T1ββͺT2β of two (or more) simpler theories (SMT(T1ββͺT2β)) , s.t. the specific Tiβ-solvers must be combined. Up to a few years ago, the standard approach to SMT(T1ββͺT2β) was to integrate the SAT solver with one combined T1ββͺT2β-solver , obtained from two distinct Tiβ-solvers by means of evolutions of Nelson and Oppen's (NO) combination procedure, in which the Tiβ-solvers deduce and exchange interface equalities. Nowadays many state-of-the-art SMT solvers use evolutions of a more recent SMT(T1ββͺT2β) procedure called Delayed Theory Combination (DTC), in which each Tiβ-solver interacts directly and only with the SAT solver, in such a way that part or all of the (possibly very expensive) reasoning effort on interface equalities is delegated to the SAT solver itself. In this paper we present a comparative analysis of DTC vs. NO for SMT(T1ββͺT2β) . On the one hand, we explain the advantages of DTC in exploiting the power of modern SAT solvers to reduce the search. On the other hand, we show that the extra amount of Boolean search required to the SAT solver can be controlled. In fact, we prove two novel theoretical results, for both convex and non-convex theories and for different deduction capabilities of the Tiβ-solvers , which relate the amount of extra Boolean search required to the SAT solver by DTC with the number of deductions and case-splits required to the Tiβ-solvers by NO in order to perform the same tasks: (i) under the same hypotheses of deduction capabilities of the Tiβ-solvers required by NO, DTC causes no extra Boolean search; (ii) using Tiβ-solvers with limited or no deduction capabilities, the extra Boolean search required can be reduced down to a negligible amount by controlling the quality of the T -conflict sets returned by the ${\mathcal{T}_i}{\text {-}}solvers
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.