The following pages link to Abstract congruence closure (Q1425161):
Displayed 17 items.
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- Congruence Closure in Intensional Type Theory (Q2817913) (← links)
- Deduction, Strategies, and Rewriting (Q2864357) (← links)
- An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types (Q2864522) (← links)
- Rewrite-Based Satisfiability Procedures for Recursive Data Structures (Q2864524) (← links)
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories (Q3000635) (← links)
- Theorem Proving with Bounded Rigid E-Unification (Q3454123) (← links)
- Modal Tableau Systems with Blocking and Congruence Closure (Q3455760) (← links)
- Efficient Algorithms for Bounded Rigid E-unification (Q3455762) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Compositional Specification in Rewriting Logic (Q5108529) (← links)
- Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (Q6135743) (← links)
- Semantically-guided goal-sensitive reasoning: decision procedures and the Koala prover (Q6156634) (← links)