Pages that link to "Item:Q2864524"
From MaRDI portal
The following pages link to Rewrite-Based Satisfiability Procedures for Recursive Data Structures (Q2864524):
Displaying 9 items.
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Polite combination of algebraic datatypes (Q2090130) (← links)
- Politeness for the theory of algebraic datatypes (Q2096449) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Rewrite-Based Decision Procedures (Q2864358) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
