The following pages link to (Q4808733):
Displaying 9 items.
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Zero, successor and equality in BDDs (Q1772774) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Canonization for disjoint unions of theories (Q2486580) (← links)
- Generalizing DPLL and satisfiability for equalities (Q2643080) (← links)
- Programmed Strategies for Program Verification (Q2864527) (← links)
