1. C. Bourely, R. Caferra, and N. Peltier. A method for building models automatically. Experiments with an extension of otter. In Alan Bundy, editor, 12th International Conference on Automated Deduction, pages 72–86, Nancy/France, June 1994. Springer Verlag, LNAI 814.
2. B. Bogaert and Sophie Tison. Equality and disequality constraints on direct subterms in tree automata. In A. Finkel, editor, Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science, volume 577 of LNCS, pages 161–172, Cachan, 1992. Springer.
3. Anne-Cécile Caron, Jean-Luc Coquidé, and Max Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proc. 5th RTA, volume 690 of LNCS, pages 328–342. Springer, June 1993.
4. H. Chen, J. Hsiang, and H.-C. Kong. On finite representations of infinite sequences of terms. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, volume 516 of LNCS, pages 100–114, Montreal, Canada, June 1990. Springer.
5. C.-L. Chang and R. C. T. Lee. Symbolic Logic an Mechanical Theorem Proving. Academic Press, New York, 1973.