The following pages link to Implementing contextual rewriting (Q5881200):
Displaying 4 items.
- Observational proofs by rewriting. (Q1607227) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Automated Induction with Constrained Tree Automata (Q3541728) (← links)
- Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (Q6135743) (← links)
