Unions of Non-Disjoint Theories and Combinations of Satisfiability Procedures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2003

Unions of Non-Disjoint Theories and Combinations of Satisfiability Procedures

Abstract

In this paper we outline a theoretical framework for the combination of decision procedures for constraint satisfiability. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory T1 and one that decides constraint satisfiability with respect to a constraint theory T2, produces a procedure that (semi-)decides constraint satisfiability with respect to the union of T1 and T2. We provide a number of 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 the component theories are non-disjoint. We also describe some general classes of theories to which our combination results apply, and relate our approach to some of the existing combination methods in the field.

Dates and versions

inria-00099668 , version 1 (26-09-2006)

Identifiers

Cite

Cesare Tinelli, Christophe Ringeissen. Unions of Non-Disjoint Theories and Combinations of Satisfiability Procedures. Theoretical Computer Science, 2003, 290 (1), pp.291-353. ⟨10.1016/S0304-3975(01)00332-2⟩. ⟨inria-00099668⟩
51 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More