scientific article; zbMATH DE number 4041334
From MaRDI portal
Publication:3779786
Recommendations
Cited in
(17)- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- A geometrical approach to multiset orderings
- AC-termination of rewrite systems: a modified Knuth-Bendix ordering
- Automating the Knuth Bendix ordering
- Rational languages defined with a non-associative concatenation
- About the descriptive power of certain classes of finite string-rewriting systems
- Applying term rewriting methods to finite groups
- Generating polynomial orderings
- Orienting rewrite rules with the Knuth-Bendix order.
- Ordered rewriting and confluence
- Extensions and comparison of simplification orderings
- Things to know when implementing KBO
- Proving termination of (conditional) rewrite systems. A semantic approach
- Set of support, demodulation, paramodulation: a historical perspective
- Termination of constructor systems
- Towards automated deduction in cP systems
- Termination proofs and the length of derivations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779786)