An upper bound on the derivational complexity of Knuth-Bendix orderings

Dieter Hofbauer. An upper bound on the derivational complexity of Knuth-Bendix orderings. Inf. Comput., 183(1):43-56, 2003. [doi]

Abstract

Abstract is missing.