The following pages link to (Q4385439):
Displaying 36 items.
- Combining decision procedures by (model-)equality propagation (Q436376) (← links)
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- An efficient SMT solver for string constraints (Q518402) (← links)
- Automatic decidability and combinability (Q549666) (← links)
- Model-theoretic methods in combined constraint satisfiability (Q556677) (← links)
- Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
- Combining nonstably infinite theories (Q851136) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
- Modular instantiation schemes (Q1944184) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Combination of uniform interpolants via Beth definability (Q2090132) (← links)
- Combined covers and Beth definability (Q2096445) (← links)
- Politeness and combination methods for theories with bridging functions (Q2303236) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Modular proof systems for partial functions with Evans equality (Q2432764) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Decision procedures for term algebras with integer constraints (Q2432767) (← links)
- Being careful about theory combination (Q2441773) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Canonization for disjoint unions of theories (Q2486580) (← links)
- Modularity results for interpolation, amalgamation and superamalgamation (Q2636527) (← links)
- Optimization Modulo Theories with Linear Rational Costs (Q2946768) (← links)
- Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← 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)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- Constraint solving for finite model finding in SMT solvers (Q4593094) (← links)
- Quantifier Elimination and Provers Integration (Q4916219) (← links)
- Combining Non-Stably Infinite Theories (Q4916220) (← links)
- Combining Decision Procedures by (Model-)Equality Propagation (Q5179357) (← links)
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method (Q5234683) (← links)
- Quantifier-free interpolation in combinations of equality interpolating theories (Q5410332) (← links)
- Conflict-free electric vehicle routing problem: an improved compositional algorithm (Q6544788) (← links)
