1. G. Alexander and D. Plaisted. Proving equality theorems with hyper-linking. In Proceedings of the 11th International Conference on Automated Deduction, pages 706–710, 1992. system abstract.
2. H. Comon. Solving inequations in term algebras. In Proceedings of 5th IEEE Symposium on Logic in Computer Science, pages 62–69, 1990.
3. G. Huet and D. Lankford. On the uniform halting problem for term rewriting systems. Technical Report Rapport Laboria 283, IRIA, Le Chesnay, France, 1978.
4. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, Cambridge, MA, 1991. To appear.
5. Jean-Pierre Jouannaud and Mitsuhiro Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Proceedings of the Eighteenth EATCS Colloquium on Automata, Languages and Programming, Madrid, Spain, July 1991. Vol. 510 in Lecture Notes in Computer Science, Springer, Berlin.