S. Abiteboul, B. Cautis, and T. Milo, Reasoning about XML update constraints, PODS'07, pp.195-204
URL : https://hal.archives-ouvertes.fr/inria-00137171

S. Abiteboul, L. Segoufin, and V. Vianu, Representing and querying XML with incomplete information, ACM Transactions on Database Systems, vol.31, issue.1, pp.208-254, 2006.
DOI : 10.1145/1132863.1132869

S. Amano, L. Libkin, and F. Murlak, XML schema mappings, PODS'09, pp.33-42
DOI : 10.1145/1559795.1559801

S. Amer-yahia, S. Cho, L. Lakshmanan, and D. Srivastava, Tree pattern query minimization, The VLDB Journal The International Journal on Very Large Data Bases, vol.11, issue.4, pp.315-331, 2002.
DOI : 10.1007/s00778-002-0076-7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Arenas, P. Barceló, L. Libkin, and F. Murlak, Relational and XML Data Exchange, Synthesis Lectures on Data Management, vol.2, issue.1, 2010.
DOI : 10.2200/S00297ED1V01Y201008DTM008

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, XML data exchange: consistency and query answering, J. ACM, vol.55, issue.2, 2008.

P. Barceló, L. Libkin, A. Poggi, and C. Sirangelo, XML with incomplete information, Journal of the ACM, vol.58, issue.1, p.1, 2010.
DOI : 10.1145/1870103.1870107

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

H. Björklund, W. Martens, and T. Schwentick, Conjunctive query containment over trees, JCSS, vol.77, issue.3, pp.450-472, 2011.

M. Bojanczyk, L. Kolodziejczyk, and F. Murlak, Solutions in XML data exchange, ICDT 2011, pp.102-113

D. Calvanese, G. De-giacomo, M. Lenzerini, and M. Y. Vardi, Regular XPath: constraints, query containment and view-based answering for XML documents, LID'08

A. Chandra and P. Merlin, Optimal implementation of conjunctive queries in relational data bases, Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77, pp.77-90
DOI : 10.1145/800105.803397

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
DOI : 10.1145/2448496.2448521

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

C. David, L. Libkin, and F. Murlak, Certain answers for XML queries, Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, PODS '10, pp.191-202
DOI : 10.1145/1807085.1807112

W. Fan and L. Libkin, On XML integrity constraints in the presence of DTDs, Journal of the ACM, vol.49, issue.3, pp.368-406, 2002.
DOI : 10.1145/567112.567117

D. Figueira, Satisfiability of downward XPath with data equality tests, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.197-206
DOI : 10.1145/1559795.1559827

P. Genevés and N. Layaida, A system for the static analysis of XPath, ACM Transactions on Information Systems, vol.24, issue.4, pp.475-502, 2006.
DOI : 10.1145/1185877.1185882

A. Gheerbrant, L. Libkin, and T. Tan, On the complexity of query answering over incomplete XML documents, Proceedings of the 15th International Conference on Database Theory, ICDT '12, pp.169-181
DOI : 10.1145/2274576.2274595

G. Gottlob, C. Koch, and K. Schulz, Conjunctive queries over trees, Journal of the ACM, vol.53, issue.2, pp.238-272, 2006.
DOI : 10.1145/1131342.1131345

URL : http://arxiv.org/abs/cs/0602004

T. Imieli´nskiimieli´nski and W. Lipski, Incomplete Information in Relational Databases, Journal of the ACM, vol.31, issue.4, pp.761-791, 1984.
DOI : 10.1145/1634.1886

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

L. Libkin, Incomplete information and certain answers in general data models, Proceedings of the 30th symposium on Principles of database systems of data, PODS '11, pp.59-70
DOI : 10.1145/1989284.1989294

L. Libkin and C. Sirangelo, Reasoning about XML with temporal logics and automata, Journal of Applied Logic, vol.8, issue.2, pp.210-232, 2010.
DOI : 10.1016/j.jal.2009.09.005

URL : http://doi.org/10.1016/j.jal.2009.09.005

W. Martens, F. Neven, and T. Schwentick, Simple off the shelf abstractions for XML schema, ACM SIGMOD Record, vol.36, issue.3, pp.15-22, 2007.
DOI : 10.1145/1324185.1324188

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

Y. Sagiv and M. Yannakakis, Equivalences Among Relational Expressions with the Union and Difference Operators, Journal of the ACM, vol.27, issue.4, pp.633-655, 1980.
DOI : 10.1145/322217.322221

. Th and . Schwentick, XPath query containment, SIGMOD Record, vol.33, issue.1, pp.101-109, 2004.