1. F. Baader and J. Siekmann. Unification theory. In D. Gabbay, C. Hogger, and J. Robinson, eds., Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2 of Handbooks of Logic in Computer Science and of Logic in Artificial Intelligence and Logic Programming, pp. 41–126. Clarendon Press, Oxford, 1994.
2. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed., Formal models and semantics, Handbook of Theoretical Computer Science, vol. B, ch. 6, pp. 243–320. Elsevier — The MIT Press, 1990.
3. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797–821, Oct 1980.
4. J.-P. Jouannaud, H. Kirchner, and J.-L. Rémy. Church-Rosser properties of weakly terminating term rewriting systems. In Proc. 8th IJCAI, vol. 2, pp. 909–915, Aug. 1983.
5. J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, eds., Handbook of Logic in Computer Science, vol. 2, ch. 1, pp. 2–117. Clarendon Press, Oxford, 1992.