1. L. Bachmair and N. Dershowitz, “Completion for rewriting modulo a congruence,” Rewriting Techniques and Applications, Lecture Notes in Computer Science
256, Springer-Verlag (1987), pp. 192–203.
2. T. Baird, “Complete sets of reductions modulo a class of equational theories which generate infinite congruence classes,” Ph.D. Dissertation, University of Missouri—Rolla, Rolla, MO, (1988).
3. Technical Report;R. Forgaard,1984
4. J.-P. Jouannaud and H. Kirchner, “Completion of a set of rules modulo a set of equations,” SIAM Journal of Computing, 15 (1986), pp. 1155–1194.
5. D. Knuth and P. Bendix, “Simple word problems in universal algebras,” Computational Problems in Abstract Algebras, J. Leech, ed., Pergamon Press, Oxford, England, (1970), pp. 263–297.