S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, 1995.

S. Abiteboul, B. Cate, and Y. Katsis, On the equivalence of distributed systems with queries and communication, ICDT, pp.126-137, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00879029

M. Benedikt, P. Bourhis, and P. Senellart, Monadic Datalog Containment, ICALP (2), pp.79-91, 2012.
DOI : 10.1007/978-3-642-31585-5_11

URL : https://hal.archives-ouvertes.fr/hal-00809306

M. Benedikt, W. Fan, and F. Geerts, Xpath satisfiability in the presence of DTDs, J. ACM, vol.55, issue.2, 2008.

H. Björklund, W. Martens, and T. Schwentick, Optimizing Conjunctive Queries over Trees Using Schema Information, MFCS, pp.132-143, 2008.
DOI : 10.1007/978-3-540-85238-4_10

M. Boja´nczykboja´nczyk, Tree-walking automata, Language and Automata Theory and Applications, pp.1-2, 2008.

M. Bojanczyk, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data trees and XML reasoning, J. ACM, vol.56, issue.3, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00151833

S. Chaudhuri and M. Y. Vardi, On the complexity of equivalence between recursive and nonrecursive Datalog programs, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '94, pp.107-116, 1994.
DOI : 10.1145/182591.182604

S. Chaudhuri and M. Y. Vardi, On the Equivalence of Recursive and Nonrecursive Datalog Programs, Journal of Computer and System Sciences, vol.54, issue.1, pp.61-78, 1997.
DOI : 10.1006/jcss.1997.1452

S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi, Decidable optimization problems for database logic programs (preliminary report), STOC, pp.477-490, 1988.

B. Courcelle, Recursive queries and context-free graph grammars, Theoretical Computer Science, vol.78, issue.1, pp.217-244, 1991.
DOI : 10.1016/0304-3975(51)90009-6

C. David, Complexity of Data Tree Patterns over XML Documents, MFCS, pp.278-289, 2008.
DOI : 10.1007/978-3-540-85238-4_22

D. Figueira and L. Segoufin, Bottom-up automata on data trees and vertical XPath, STACS, pp.93-104, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573596

G. Gottlob and C. Koch, Monadic datalog and the expressive power of languages for Web information extraction, Journal of the ACM, vol.51, issue.1, pp.74-113, 2004.
DOI : 10.1145/962446.962450

F. Neven and T. Schwentick, Query automata over finite trees, Theoretical Computer Science, vol.275, issue.1-2, pp.633-674, 2002.
DOI : 10.1016/S0304-3975(01)00301-2

URL : http://doi.org/10.1016/s0304-3975(01)00301-2

O. Shmueli, Decidability and expressiveness of logic queries, PODS, pp.237-249, 1987.