1. F. Baader and C. Tinelli. A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. Technical Report LTCS-Report 96-01, LuFG Theoretical Computer Science, RWTH-Aachen, Germany, 1996. Available via ftp as file Baader-Tinelli-LTCS-96.ps.gz in directory pub/papers/1996 on cantor.informatik.rwth-aachen.de.
2. E. Domenjoud. Undecidability of the word problem in the union of theories sharing constructors. In Proceedings of the 10th International Workshop on Unification, UNIF'96. CIS-Report 96-9, CIS, Universität München, 1996.
3. E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for non-disjoint equational theories. In A. Bundy, editor, Proceedings 12th International Conference on Automated Deduction, Nancy (France), volume 814 of Lecture Notes in Artificial Intelligence, pages 267–281. Springer-Verlag, 1994.
4. H. Kirchner and C. Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113–155, 1994.
5. D. E. Knuth and P. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, 1970.