F. Baader, R. Küsters, A. Borgida, and D. Mcguinness, Matching in description logics, Journal of Logic and Computation, vol.9, issue.3, pp.411-447, 1999.

F. Baader and P. Narendran, Unification of concept terms in description logics, ECAI'98, pp.331-335, 1998.

F. Baader, Terminological cycles in a description logic with existential restrictions, IJCAI, pp.325-330, 2003.

F. Baader, S. Borgwardt, and B. Morawska, Extending unification in EL towards general TBoxes, KR'12, pp.568-572, 2012.

W. Belkhir, Y. Chevalier, and M. Rusinowitch, Guarded Variable Automata over Infinite Alphabets, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00914779

F. Baader and R. Küsters, Matching in description logics with existential restrictions, DL'99, 1999.

G. Gottlob, G. Orsi, and A. Pieris, Ontological queries: Rewriting and optimization (extended version), 2011.

O. Grumberg, O. Kupferman, and S. Sheinvald, Variable automata over infinite alphabets, LATA, pp.561-572, 2010.

J. E. Hopcroft and J. D. Ullman, Formal languages and their relation to automata, ACM Classic Books Series, 1969.

M. Kaminski and D. Zeitlin, Finite-memory automata with nondeterministic reassignment, Int. J. Found. Comput. Sci, vol.21, issue.5, pp.741-760, 2010.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, 1972.

R. Küsters, Characterizing the Semantics of Terminological Cycles in ALN using Finite Automata, KR'98, pp.499-510, 1998.

L. Akroun, L. Nourine, and F. Toumani, Reasoning in description logics with variables: preliminary results (extended version), Blaise Pascal University, 2015.