The following pages link to (Q3338225):
Displayed 12 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Unification problems with one-sided distributivity (Q1099650) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- An improved general \(E\)-unification method (Q1201347) (← links)
- Complete sets of transformations for general E-unification (Q1262754) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- Narrowing directed by a graph of terms (Q5055753) (← links)