M. Arenas, P. Barceló, L. Libkin, and F. Murlak, Foundations of Data Exchange, 2014.
DOI : 10.1017/CBO9781139060158

M. Arenas, W. Fan, and L. Libkin, On the Complexity of Verifying Consistency of XML Specifications, SIAM Journal on Computing, vol.38, issue.3, pp.841-880, 2008.
DOI : 10.1137/050646895

M. Arenas and L. Libkin, A normal form for XML documents, ACM Transactions on Database Systems, vol.29, issue.1, pp.195-232, 2004.
DOI : 10.1145/974750.974757
URL : http://www.cs.toronto.edu/~libkin/papers/pods02a.ps.gz

M. Arenas and L. Libkin, XML data exchange: Consistency and query answering, J. ACM, vol.55, issue.2, 2008.

M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, J. ACM, vol.55, issue.2, 2008.
DOI : 10.1145/1065167.1065172
URL : https://uhdspace.uhasselt.be/dspace/bitstream/1942/956/1/xpath.pdf

H. Björklund, W. Martens, and T. Schwentick, Conjunctive query containment over trees using schema information, Acta Informatica, vol.2, issue.1, pp.1-40, 2016.
DOI : 10.1007/BFb0055090

F. Mikoo-laj-boja´nczykboja´nczyk, A. Murlak, and . Witkowski, Containment of monadic datalog programs via bounded clique-width, Proc. ICALP 2015, pp.427-439, 2015.

A. Mikoo-laj-boja´nczykboja´nczyk, T. Muscholl, L. Schwentick, and . Segoufin, Twovariable logic on data trees and XML reasoning, J. ACM, vol.5613, issue.3, pp.1-1348, 2009.

K. Ashok, P. M. Chandra, and . Merlin, Optimal implementation of conjunctive queries in relational data bases, Proc. STOC 1977, pp.77-90, 1977.

B. Courcelle, J. A. Makowsky, and U. Rotics, Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width, Theory of Computing Systems, vol.33, issue.2, pp.125-150, 2000.
DOI : 10.1007/s002249910009

B. Courcelle and S. Olariu, Upper bounds to the clique width of graphs, Discrete Applied Mathematics, vol.101, issue.1-3, pp.77-114, 2000.
DOI : 10.1016/S0166-218X(99)00184-5
URL : https://doi.org/10.1016/s0166-218x(99)00184-5

C. David, A. Gheerbrant, L. Libkin, and W. Martens, Containment of pattern-based queries over data trees, Proceedings of the 16th International Conference on Database Theory, ICDT '13, pp.201-212, 2013.
DOI : 10.1145/2448496.2448521
URL : https://hal.archives-ouvertes.fr/hal-00788621

C. David, P. Hofman, F. Murlak, and . Pilipczuk, Synthesizing transformations from XML schema mappings, Proc. ICDT 2014, pp.61-71, 2014.

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange: semantics and query answering, Theoretical Computer Science, vol.336, issue.1, pp.89-124, 2005.
DOI : 10.1016/j.tcs.2004.10.033
URL : http://www.almaden.ibm.com/cs/people/lucian/papers/icdt03-lncs2572.pdf

R. Fagin, P. G. Kolaitis, L. Popa, and W. Tan, Composing schema mappings, ACM Transactions on Database Systems, vol.30, issue.4, pp.994-1055, 2005.
DOI : 10.1145/1114244.1114249

R. Fagin and M. Y. Vardi, The theory of data dependencies???a survey, Mathematics of Information Processing of Proceedings of Symposia in Applied Mathematics, pp.19-71, 1986.
DOI : 10.1090/psapm/034/846853

D. Figueira, Alternating register automata on finite words and trees, Logical Methods in Computer Science, vol.95, issue.2, p.2012
DOI : 10.1007/BF01967649
URL : https://lmcs.episciences.org/907/pdf

T. Gogacz and J. Marcinkowski, All???Instances Termination of Chase is Undecidable, Proc. ICALP 2014, pp.293-304, 2014.
DOI : 10.1007/978-3-662-43951-7_25

T. Gogacz and J. Marcinkowski, Red Spider Meets a Rainworm, Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '16, pp.121-134, 2016.
DOI : 10.1145/1142351.1142404

S. Hartmann and S. Link, More Functional Dependencies for XML, Proc. ADBIS 2003, pp.355-369, 2003.
DOI : 10.1007/978-3-540-39403-7_27

S. Hartmann, S. Link, and T. Trinh, Solving the Implication Problem for XML Functional Dependencies with Properties, Proc. WoLLIC 2010, pp.161-175, 2010.
DOI : 10.1007/978-3-642-13824-9_14

M. Jurdzinski and R. Lazic, Alternating automata on data trees and XPath satisfiability, ACM Transactions on Computational Logic, vol.12, issue.3, pp.1-19, 2011.
DOI : 10.1145/1929954.1929956

M. Lenzerini, Data integration, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.233-246, 2002.
DOI : 10.1145/543613.543644

G. Miklau and D. Suciu, Containment and equivalence for a fragment of XPath, Journal of the ACM, vol.51, issue.1, pp.2-45, 2004.
DOI : 10.1145/962446.962448

F. Neven and T. Schwentick, On the complexity of XPath containment in the presence of disjunction, DTDs, and variables, Logical Methods in Computer Science, vol.2, issue.3, 2006.
DOI : 10.2168/LMCS-2(3:1)2006

M. Niewerth and T. Schwentick, Reasoning About XML Constraints Based on XML-to-Relational Mappings, Proc. ICDT 2014, pp.72-83, 2014.
DOI : 10.1145/1016028.1016029

M. Y. Vardi, Fundamentals of dependency theory, Theoretical Computer Science, pp.171-224, 1987.