A comprehensive combination framework
From MaRDI portal
Recommendations
Cited in
(14)- Combination of convex theories: modularity, deduction completeness, and explanation
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- A unified and composable take on ratcheting
- Model completeness, covers and superposition
- Combining WS1S and HOL
- Combining theories: the Ackerman and guarded fragments
- Modular termination and combinability for superposition modulo counter arithmetic
- Satisfiability modulo theories
- Noetherianity and Combination Problems
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
- Data structures with arithmetic constraints: A non-disjoint combination
- Combinable Extensions of Abelian Groups
- Frontiers of Combining Systems
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
This page was built for publication: A comprehensive combination framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277797)