The following pages link to (Q3779786):
Displayed 15 items.
- Automating the Knuth Bendix ordering (Q751830) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- A geometrical approach to multiset orderings (Q1119955) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Orienting rewrite rules with the Knuth-Bendix order. (Q1401932) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Rational languages defined with a non-associative concatenation (Q1575941) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Termination proofs and the length of derivations (Q5055719) (← links)
- Extensions and comparison of simplification orderings (Q5055737) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Applying term rewriting methods to finite groups (Q5096205) (← links)
- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering (Q5096208) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)