Logo image
Theory Combination: Beyond Equality Sharing
Book chapter   Open access   Peer reviewed

Theory Combination: Beyond Equality Sharing

Maria Paola Bonacina, Pascal Fontaine, Christophe Ringeissen and Cesare Tinelli
Description Logic, Theory Combination, and All That, pp.57-89
Lecture Notes in Computer Science, Springer International Publishing
06/01/2019
DOI: 10.1007/978-3-030-22102-7_3
url
https://orbi.uliege.be/handle/2268/256528View
Open Access

Abstract

Satisfiability is the problem of deciding whether a formula has a model. Although it is not even semidecidable in first-order logic, it is decidable in some first-order theories or fragments thereof (e.g., the quantifier-free fragment). Satisfiability modulo a theory is the problem of determining whether a quantifier-free formula admits a model that is a model of a given theory. If the formula mixes theories, the considered theory is their union, and combination of theories is the problem of combining decision procedures for the individual theories to get one for their union. A standard solution is the equality-sharing method by Nelson and Oppen, which requires the theories to be disjoint and stably infinite. This paper surveys selected approaches to the problem of reasoning in the union of disjoint theories, that aim at going beyond equality sharing, including: asymmetric extensions of equality sharing, where some theories are unrestricted, while others must satisfy stronger requirements than stable infiniteness; superposition-based decision procedures; and current work on conflict-driven satisfiability (CDSAT).

Details

Metrics

23 Record Views
Logo image