The following pages link to (Q3484358):
Displaying 20 items.
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Term rewriting: Some experimental results (Q757071) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- A categorical critical-pair completion algorithm (Q1300576) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Coloring terms to control equational reasoning (Q1367077) (← links)
- An improved general path order (Q1925013) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- (Q2754042) (← links)
- (Q2778873) (← links)
- Term Rewriting with Logical Constraints (Q2849501) (← links)
- From chemical rules to term rewriting (Q2863876) (← links)
- (Q3719825) (← links)
- (Q4005178) (← links)
- (Q4222988) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Distributing equational theorem proving (Q5055785) (← links)
- Completion for multiple reduction orderings (Q5055819) (← links)
- Some independence results for equational unification (Q5055843) (← links)
- Informational logic for automated reasoning (Q5236445) (← links)