1. Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, chap 8, pp. 445–532. Elsevier, Dordrect, The Netherlands (2001)
2. Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) Ninth Annual Symposium on Theoretical Aspects of Computer Science, vol. 577 of LNCS, pp. 161–171. Springer, Berlin Heidelberg New York (1992)
3. Charatonik, W., Podelski, A.: Set constraints with intersection. Inf. Comput. 179(2), 151–385 (2002)
4. Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA). www.grappa.univ-lille3.fr/tata (1997)
5. Dauchet, M., Tison, S.: Structural complexity of classes of tree languages. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 327–353. North-Holland, Amsterdam, The Netherlands (1992)