1. H. Chen and J. Hsiang. Logic programming with recurrence domains.Proc. 18th International Colloquium on Automata, Languages, and Programming, Madrid. Lecture Notes in Computer Science, Vol. 510. Springer-Verlag, Berlin, 1991.
2. H. Chen, J. Hsiang, and H.-C. Kong. On finite representations of infinite sequences of terms.Proc. CTRS 90, Montreal, 1990.
3. H. Comon Completion of rewrite systems with membership constraints.Proc. 19th International Colloquium on Automata, Languages, and Programming, Vienna. Lecture Notes in Computer Science, Vol. 623. Springer-Verlag, 1992.
4. E. Contejean. Elements pour la decidabilite de l'unification modulo la distributivité. Thèse de Doctorat, Universite de Paris-Sud, France, April 1992.
5. J. -P. Jouannaud and C. 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.