On the Combination of Congruence Closure and Completion - Artificial Intelligence and Symbolic Computation - page 117

7. Knuth, D. E., Bendix, P. B.: Simple word problems in universal algebras. Compu-
tational Problems in Abstract Algebra, Pergamon Press, Oxford (1970) 263-297.
8. Kozen, D.: Complexity of Finitely Presented Algebras. PhD. thesis. Cornell Uni-
versity (1977).
9. Lynch, C., Strogova, P.: SOUR graphs for ecient completion. Journal of Discrete
Mathematics and Theoretical Computer Science 2(1) (1998) 1-25.
10. Nelson, C. G., Oppen, D. C.: Fast Decision Procedures based on Congruence Clo-
sure. Journal of the ACM 27(2) (1980) 356-364.
11. Plaisted, D.A., Sattler-Klein, A.: Proof lengths for equational completion. Journal
of Inf. Comput., Academic Press, Inc. 125(2) (1996) 154-170.
12. Shostak, R.E.: Deciding Combinations of Theories. Journal of the ACM 31 (1984)
1-12.
13. Snyder, W.: A Fast Algorithm for Generating Reduced Ground Rewriting Systems
from a Set of Ground Equations. Journal of Symbolic Computation 15 (1993)
415-450.