Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
csal
- Bruttomesso, Roberto Università della Svizzera Italiana, Lugano, Switzerland
- Cimatti, Alessandro FBK-Irst, Povo, Trento, Italy
- Franzen, Anders FBK-Irst, Povo, Trento, Italy
- Griggio, Alberto DISI, University of Trento, Povo, Trento, Italy
- Sebastiani, Roberto DISI, University of Trento, Povo, Trento, Italy
-
2009
Published in:
- Annals of Mathematics and Artificial Intelligence. - Springer Netherlands. - 2009, vol. 55, no. 1-2, p. 63-99
English
Most state-of-the-art approaches for Satisfiability Modulo Theories $(SMT(\mathcal{T}))$ rely on the integration between a SAT solver and a decision procedure for sets of literals in the background theory $\mathcal{T} (\mathcal{T}{\text {-}}solver)$ . Often $\mathcal{T}$ is the combination $\mathcal{T}_1 \cup \mathcal{T}_2$ of two (or more) simpler theories $(SMT(\mathcal{T}_1 \cup \mathcal{T}_2))$ , s.t. the specific ${\mathcal{T}_i}{\text {-}}solvers$ must be combined. Up to a few years ago, the standard approach to $SMT(\mathcal{T}_1 \cup \mathcal{T}_2)$ was to integrate the SAT solver with one combined $\mathcal{T}_1 \cup \mathcal{T}_2{\text {-}}solver$ , obtained from two distinct ${\mathcal{T}_i}{\text {-}}solvers$ by means of evolutions of Nelson and Oppen's (NO) combination procedure, in which the ${\mathcal{T}_i}{\text {-}}solvers$ deduce and exchange interface equalities. Nowadays many state-of-the-art SMT solvers use evolutions of a more recent $SMT(\mathcal{T}_1 \cup \mathcal{T}_2)$ procedure called Delayed Theory Combination (DTC), in which each ${\mathcal{T}_i}{\text {-}}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(\mathcal{T}_1 \cup \mathcal{T}_2)$ . 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 ${\mathcal{T}_i}{\text {-}}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 ${\mathcal{T}_i}{\text {-}}solvers$ by NO in order to perform the same tasks: (i) under the same hypotheses of deduction capabilities of the ${\mathcal{T}_i}{\text {-}}solvers$ required by NO, DTC causes no extra Boolean search; (ii) using ${\mathcal{T}_i}{\text {-}}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 $\mathcal{T}$ -conflict sets returned by the ${\mathcal{T}_i}{\text {-}}solvers$
- Collections
- Language
-
- English
- Classification
- Computer science and technology
- License
-
License undefined
Springer Science+Business Media B.V., 2009 - Identifiers
-
- RERO DOC 317826
- SWISSBIB (NATIONALLICENCE)springer-10.1007/s10472-009-9152-7
- DOI 10.1007/s10472-009-9152-7
- Persistent URL
- https://folia.unifr.ch/global/documents/318766
Statistics
Document views: 34
File downloads:
- 10472_2009_Article_9152.pdf: 0