| Abstract | This paper is to make the similarity between Knuth-Bendix completion and the Buchberger algorithm explicit, by describing a general algorithm
called S-normalized completion where S is a parameter, such that both
algorithms are Normalized Rewriting: an alternative to Rewriting modulo a Set of Equations 3 instances of this general algorithm for a particular choice of S. This has been achieved in two steps. |
