Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures

  • Authors:

  • Maria Paola Bonacina;Silvio Ghilardi;Enrica Nicolini;Silvio Ranise;Daniele Zucchelli

  • Affiliations:

  • Dipartimento di Informatica, Universitá degli Studi di Verona, Italia;Dipartimento di Informatica, Universitá degli Studi di Milano, Italia;Dipartimento di Matematica, Universitá degli Studi di Milano, Italia;,Dipartimento di Informatica, Universitá degli Studi di Milano, Italia;,Dipartimento di Informatica, Universitá degli Studi di Milano, Italia

  • Venue:
  • IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.