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

1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Keywords :
Type de document :
Rapport
[Research Report] RR-3402, INRIA. 1998, pp.63
Domaine :

Littérature citée [1 références]

https://hal.inria.fr/inria-00073288
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:26:41
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:05:31

### Identifiants

• HAL Id : inria-00073288, version 1

### Citation

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〉

### Métriques

Consultations de la notice

## 134

Téléchargements de fichiers