Pages that link to "Item:Q2864524"
From MaRDI portal
The following pages link to Rewrite-based satisfiability procedures for recursive data structures (Q2864524):
Displaying 13 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)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- Polite combination of algebraic datatypes (Q2090130) (← links)
- Politeness for the theory of algebraic datatypes (Q2096449) (← links)
- Syntax-guided rewrite rule enumeration for SMT solvers (Q2181939) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Rewrite-based decision procedures (Q2864358) (← links)
- An abstract decision procedure for satisfiability in the theory of recursive data types (Q2864522) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
- On Variable-inactivity and Polynomial Formula-Satisfiability Procedures (Q5450569) (← links)