S. Abiteboul and R. Hull,

A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances (Extended Version), 2015.

M. Benedikt, P. Bourhis, and C. Ley, Querying Schemas with Access Paths, PVLDB, 2012.

M. Benedikt, P. Bourhis, and C. Ley, Analysis of Schemas with Access Restrictions, ACM Trans. Database Syst, vol.40, p.5, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01211288

M. Benedikt, P. Bourhis, and P. Senellart, Monadic Datalog Containment, ICALP, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00809306

M. Benedikt, G. Gottlob, and P. Senellart, Determining relevance of accesses at runtime, PODS, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00591793

M. Benedikt, T. Balder-ten-cate, M. Colcombet, and . Boom, The Complexity of Boundedness for Guarded Logics, LICS, 2015.

H. Björklund, W. Martens, and T. Schwentick, Optimizing Conjunctive Queries over Trees Using Schema Information, MFCS, 2008.

H. Björklund, W. Martens, and T. Schwentick, Validity of tree pattern queries with respect to schema information, MFCS, 2013.

H. Björklund, W. Martens, and T. Schwentick, Conjunctive query containment over trees using schema information, Acta Informatica, 2016.

A. Piero and . Bonatti, On the decidability of containment of recursive datalog queries, PODS, 2004.

A. Calì and D. Calvanese, Containment of Conjunctive Queries under Access Limitations, SEBD, 2006.

A. Calì and D. Martinenghi, Conjunctive Query Containment under Access Limitations, 2008.

D. Calvanese, G. D. Giacomo, and M. Y. Vardi, Decidable containment of recursive queries, Theoretical Computer Science, vol.336, p.1, 2005.

D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi, Containment of Conjunctive Regular Path Queries with Inverse, KR, 2000.

K. Ashok, D. Chandra, L. J. Kozen, and . Stockmeyer, Alternation. J. ACM, vol.28, p.1, 1981.

S. Chaudhuri and M. Y. Vardi, On the Equivalence of Recursive and Nonrecursive Datalog Programs, PODS, 1992.

S. Chaudhuri and M. Y. Vardi, On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs, PODS, 1994.

S. Chaudhuri and M. Y. Vardi, On the Equivalence of Recursive and Nonrecursive Datalog Programs, JCSS, vol.54, p.1, 1997.

S. Bogdan and . Chlebus, Domino-Tiling Games, J. Comput. Syst. Sci, vol.32, issue.86, p.90036, 1986.

H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez et al., Tree Automata Techniques and Applications. Available at, 2002.

S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi, Decidable Optimization Problems for Database Logic Programs, STOC, 1988.

. Bruno-courcelle, Recursive queries and context-free graph grammars, Theoretical Computer Science, vol.78, p.1, 1991.

M. Oliver, A. Y. Duschka, and . Levy, Recursive Plans for Information Gathering, IJCAI, 1997.

F. Gécseg and M. Steinby, Tree Languages, Handbook of Formal Languages, vol.3, pp.1-68, 1997.

C. Li and E. Chang, Answering Queries with Useful Bindings, TODS, vol.26, pp.313-343, 2001.

T. D. Millstein, A. Y. Halevy, and M. Friedman, Query containment for data integration systems, J. Comput. System Sci, vol.66, pp.20-39, 2003.

F. Neven, Automata Theory for XML Researchers, SIGMOD Record, vol.31, pp.39-46, 2002.

A. Rajaraman, Y. Sagiv, and J. D. Ullman, Answering Queries Using Templates with Binding Patterns, PODS, 1995.

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, vol.7, p.3, 1986.

O. Shmueli, Equivalence of datalog queries is undecidable, J. Log. Program, vol.15, issue.93, p.90040, 1993.

M. Takahashi, Generalizations of Regular Sets and Their Application to a Study of Context-Free Languages, Information and Control, vol.27, pp.1-36, 1975.

C. Balder-ten and L. Segoufin, Unary negation, STACS, 2011.