An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound on the derivational complexity of Knuth-Bendix orderings. |
scientific article; zbMATH DE number 1967130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the derivational complexity of Knuth-Bendix orderings. |
scientific article; zbMATH DE number 1967130 |
Statements
An upper bound on the derivational complexity of Knuth-Bendix orderings. (English)
0 references
19 August 2003
0 references
Term rewriting
0 references
Termination proofs
0 references
Knuth-Bendix order
0 references
Derivational complexity
0 references
0 references
