Theory combination: beyond equality sharing

DOI10.1007/978-3-030-22102-7_3zbMath1443.68116OpenAlexW2956117566MaRDI QIDQ2185458

Cesare Tinelli, Maria Paola Bonacina, Christophe Ringeissen, Pascal Fontaine

Publication date: 4 June 2020

Full work available at URL: https://hal.inria.fr/hal-02194001/file/paper.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational aspects of satisfiability (68R07)

Related Items (4)

Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Polite combination of algebraic datatypes ⋮ Politeness for the theory of algebraic datatypes

This page was built for publication: Theory combination: beyond equality sharing