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

Dieter Hofbauer

Published in: Inf. Comput. (2003)

Keyphrases

upper bound
worst case
knuth bendix
lower bound
term rewriting
machine learning
space complexity
rewrite systems
databases