Theory combination: beyond equality sharing
From MaRDI portal
Publication:2185458
DOI10.1007/978-3-030-22102-7_3zbMATH Open1443.68116OpenAlexW2956117566MaRDI QIDQ2185458FDOQ2185458
Authors: Maria Paola Bonacina, Pascal Fontaine, Christophe Ringeissen, Cesare Tinelli 
Publication date: 4 June 2020
Full work available at URL: https://hal.inria.fr/hal-02194001/file/paper.pdf
Recommendations
- Satisfiability modulo theories and assignments
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Combination of disjoint theories: beyond decidability
- scientific article; zbMATH DE number 3898849
- Conflict-driven satisfiability for theory combination: transition system and completeness
Cited In (12)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
- Being careful about theory combination
- Efficient theory combination via Boolean search
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combining satisfiability procedures for unions of theories with a shared counting operator
- Combining theories with shared set operations
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Politeness for the theory of algebraic datatypes
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
- Polite combination of algebraic datatypes
This page was built for publication: Theory combination: beyond equality sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185458)
