The following pages link to Abstract congruence closure (Q1425161):
Displaying 27 items.
- Fast congruence closure and extensions (Q876046) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- On the relationship of congruence closure and unification (Q1124338) (← links)
- Computing congruent closures on terms (Q1280915) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Congruent closure algorithms for finite automata and some applications (Q1842442) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Congruence classes with logic variables (Q2708308) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- Congruence Closure in Intensional Type Theory (Q2817913) (← links)
- Deduction, strategies, and rewriting (Q2864357) (← links)
- \textsf{CC(X)}: semantic combination of congruence closure with solvable theories (Q2864404) (← 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)
- Automatic Abstraction for Congruences (Q3656884) (← links)
- (Q4518873) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Compositional Specification in Rewriting Logic (Q5108529) (← links)
- Artificial Intelligence and Symbolic Computation (Q5464694) (← links)
- Term Rewriting and Applications (Q5703869) (← 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)