The following pages link to Frontiers of Combining Systems (Q5491892):
Displaying 19 items.
- Automatic decidability and combinability (Q549666) (← links)
- Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Politeness and stable infiniteness: stronger together (Q2055852) (← links)
- Polite combination of algebraic datatypes (Q2090130) (← links)
- Politeness for the theory of algebraic datatypes (Q2096449) (← links)
- Reasoning about vectors using an SMT theory of sequences (Q2104504) (← links)
- Politeness and combination methods for theories with bridging functions (Q2303236) (← links)
- Being careful about theory combination (Q2441773) (← links)
- Weakly Equivalent Arrays (Q2964457) (← links)
- A Rewriting Approach to the Combination of Data Structures with Bridging Theories (Q2964468) (← links)
- Sharing Is Caring: Combination of Theories (Q3172894) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (Q3454111) (← links)
- Sort It Out with Monotonicity (Q5200026) (← links)
- Reasoning about vectors: satisfiability modulo a theory of sequences (Q6053845) (← links)
- Combining stable infiniteness and (strong) politeness (Q6053847) (← links)
- On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework (Q6649524) (← links)
