Pages that link to "Item:Q5709987"
From MaRDI portal
The following pages link to Theoretical Aspects of Computing - ICTAC 2004 (Q5709987):
Displaying 8 items.
- Automatic decidability and combinability (Q549666) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Canonization for disjoint unions of theories (Q2486580) (← links)
- \textsf{CC(X)}: semantic combination of congruence closure with solvable theories (Q2864404) (← links)
- Distributing the workload in a lazy theorem-prover (Q2870323) (← links)
- Automated Deduction – CADE-19 (Q5900719) (← links)