Pages that link to "Item:Q3613431"
From MaRDI portal
The following pages link to Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures (Q3613431):
Displaying 13 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- An instantiation scheme for satisfiability modulo theories (Q438578) (← links)
- Automatic decidability and combinability (Q549666) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Decision procedures for extensions of the theory of arrays (Q2457800) (← links)
- (Q4219024) (← links)
- Superposition for Bounded Domains (Q4913861) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
- Combinable Extensions of Abelian Groups (Q5191096) (← links)
- On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework (Q6649524) (← links)
