1. T. Baird, G. Peterson, and R. Wilkerson. Complete sets of reductions modulo Associativity, Commutativity and Identity. In Proc. 3rd Rewriting Techniques and Applications, Chapel Hill, LNCS 355, pages 29–44. Springer-Verlag, Apr. 1989.
2. A. Boudet, E. Contejean, and C. Marché. AC-complete unification and its application to theorem proving. In H. Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, Rutgers University, NJ, USA, July 1996. Springer-Verlag. To appear.
3. B. Buchberger. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Ideal. PhD thesis, University of Innsbruck, Austria, 1965. (in German).
4. B. Buchberger and R. Loos. Algebraic simplification. In Computer Algebra, Symbolic and Algebraic Computation. Computing Supplementum 4. Springer-Verlag, 1982.
5. S. Eker. Improving the efficiency of AC matching and unification. Rapport de DEA, INRIA Lorraine, 1993.