In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisfiability problems in arbitrary and in infinite models, respectively. We exhibit a theory T1 such that satisfiability is decidable, but satisfiability in infinite models is undecidable. It follows that satisfiability in T1 ∪ T2 is undecidable, whenever T2 has only infinite models, even if signatures are disjoint and satisfiability in T2 is decidable. In the second part of the paper we strengthen the Nelson-Oppen decidability transfer result, by showing that it applies to theories over disjoint signatures, whose satisfiability problem, in either arbitrary or infinite models, is decidable. We show that this result covers decision procedures based on rewriting, complementing recent work on combination of theories in the rewrite-based approach to satisfiability. © Springer-Verlag Berlin Heidelberg 2006.
Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures / Bonacina, M. P.; Ghilardi, S.; Nicolini, E.; Ranise, S.; Zucchelli, D.. - 4130:(2006), pp. 513-527. (Intervento presentato al convegno Third International Joint Conference on Automated Reasoning, IJCAR 2006 tenutosi a Seattle, WA, usa nel 2006) [10.1007/11814771_42].
Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures
Ranise S.;
2006-01-01
Abstract
In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisfiability problems in arbitrary and in infinite models, respectively. We exhibit a theory T1 such that satisfiability is decidable, but satisfiability in infinite models is undecidable. It follows that satisfiability in T1 ∪ T2 is undecidable, whenever T2 has only infinite models, even if signatures are disjoint and satisfiability in T2 is decidable. In the second part of the paper we strengthen the Nelson-Oppen decidability transfer result, by showing that it applies to theories over disjoint signatures, whose satisfiability problem, in either arbitrary or infinite models, is decidable. We show that this result covers decision procedures based on rewriting, complementing recent work on combination of theories in the rewrite-based approach to satisfiability. © Springer-Verlag Berlin Heidelberg 2006.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
