Non-Disjoint Unions of Theories and Combinations of Satisfiability Procedures: First Results - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

Non-Disjoint Unions of Theories and Combinations of Satisfiability Procedures: First Results

Abstract

In this paper we outline a theoretical framework for the combination of decision procedures for the satisfiability of constraints with respect to a constrainttheory. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory ${\cal T}_1$ and one that decides constraint satisfiability with respect to a constraint theory ${\cal T}_2$, is able to produce a procedure that (semi-)decides constraint satisfiability with respect to the union of ${\cal T}_1$ and ${\cal T}_2$. We also provide some model-theoretic conditions on the constraint language and the component constraint theories for the method to be sound and complete, with special emphasis on the case in which the signatures of ${\cal T}_1$ and ${\cal T}_2$ are non-disjoint.
Fichier principal
Vignette du fichier
RR-3402.pdf (575.5 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073288 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073288 , version 1

Cite

Cesare Tinelli, Christophe Ringeissen. Non-Disjoint Unions of Theories and Combinations of Satisfiability Procedures: First Results. [Research Report] RR-3402, INRIA. 1998, pp.63. ⟨inria-00073288⟩
67 View
96 Download

Share

Gmail Facebook Twitter LinkedIn More