1. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In D. Kapur, editor, Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, Lecture Notes in Computer Science, vol. 607, pages 462–476. Springer-Verlag, June 1992.
2. A. Boudet and H. Comon. About the theory of tree embedding. In M. C. Gaudel and J.-P. Jouannaud, editors, Proc. Int. Joint Conf. on Theory and Practice of Software Development, Lecture Notes in Computer Science, vol. 668, pages 376–390, Orsay, France, Apr. 1993. Springer-Verlag.
3. A.-C. Caron, J.-L. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proc. 5th. Int. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 690, pages 328–342, Montreal, Canada, 1993. Springer-Verlag.
4. H. Comon. Equational formulas in order-sorted algebras. In Proc. 17th Int. Coll. on Automata, Languages and Programming, Warwick, Lecture Notes in Computer Science, vol. 443, pages 674–688, Warwick, July 1990. Springer-Verlag.
5. H. Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387–411, 1990.