1. Resolution theorem proving;Bachmair,2001
2. Equality and disequality constraints on direct subterms in tree automata;Bogaert,1992
3. Automata and logics for unranked and unordered trees;Boneva,2005
4. A. Bouhoula, J.-P. Jouannaud, Automata-driven automated induction, in: LICS-12, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS’97), IEEE Computer Society Press, 1997, pp. 14–25.
5. Symbolic Logic and Mechanical Theorem Proving;Chang,1973