O. Shmueli, Equivalence of Datalog queries is undecidable, The Journal of Logic Programming, vol.15, issue.3, 1993.
DOI : 10.1016/0743-1066(93)90040-N

P. A. Bonatti, On the decidability of containment of recursive datalog queries, p.PODS, 2004.

D. Calvanese, G. De-giacomo, and M. Y. Vardi, Decidable containment of recursive queries, Theoretical Computer Science, vol.336, issue.1, 2005.

S. Chaudhuri and M. Y. Vardi, On the equivalence of recursive and nonrecursive Datalog programs, p.PODS, 1992.

S. Chaudhuri and M. Y. Vardi, On the equivalence of recursive and nonrecursive Datalog programs, JCSS, vol.54, issue.1, 1997.

S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi, Decidable optimization problems for database logic programs, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, p.STOC, 1988.
DOI : 10.1145/62212.62259

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, p.PODS, 1994.
DOI : 10.1145/182591.182604

A. Caì-i and D. Martinenghi, Conjunctive Query Containment under Access Limitations, ER 2008, pp.326-340, 2008.

M. Benedikt, G. Gottlob, and P. Senellart, Determining relevance of accesses at runtime, Proceedings of the 30th symposium on Principles of database systems of data, PODS '11, p.PODS, 2011.
DOI : 10.1145/1989284.1989309
URL : https://hal.archives-ouvertes.fr/hal-00603647

D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi, Containment of conjunctive regular path queries with inverse, p.KR, 2000.

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

B. Ten-cate and L. Segoufin, Unary negation, p.STACS, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573634

M. Benedikt, P. Bourhis, and C. Ley, Querying schemas with access paths, PVLDB, 2012.

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

A. Rajaraman, Y. Sagiv, and J. D. Ullman, Answering queries using templates with binding patterns, p.PODS, 1995.

C. Li and E. Y. Chang, Answering queries with useful bindings, ACM Transactions on Database Systems, vol.26, issue.3, 2001.
DOI : 10.1145/502030.502032

A. Caì-i and D. Martinenghi, Querying the deep web, p.EDBT, 2010.

H. Björklund, W. Martens, and T. Schwentick, Validity of Tree Pattern Queries with Respect to Schema Information, 2012.
DOI : 10.1007/978-3-642-40313-2_17