J. Baget, M. Leclère, M. Mugnier, and E. Salvat, Extending decidable cases for rules with existential variables, Proc. of IJCAI, pp.677-682, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00410130

J. Baget, M. Bienvenu, M. Mugnier, and S. Rocher, Combining existential rules and transitivity: Next steps, Proc. of IJCAI, pp.2720-2726, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01171846

M. Bienvenu, D. Calvanese, M. Ortiz, and M. , ?imkus: Nested regular path queries in description logics, Proc. of KR, 2014.

M. Bienvenu and M. Ortiz, Ontology-Mediated Query Answering with Data-Tractable Description Logics, pp.218-307, 2015.
DOI : 10.1016/j.websem.2014.11.007

M. Bienvenu, M. Ortiz, and M. Simkus, Regular path queries in lightweight description logics: Complexity and algorithms, J. Artif. Intell. Res. (JAIR), vol.53, pp.315-374, 2015.

P. Bourhis, M. Krötzsch, and S. Rudolph, How to best nest regular path queries, Proc. of DL, pp.404-415, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01098979

A. Calì, G. Gottlob, and M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, Proc. of KR, pp.70-80, 2008.

D. Calvanese, T. Eiter, and M. Ortiz, Answering regular path queries in expressive description logics: An automata-theoretic approach, Proc. of AAAI, pp.391-396, 2007.

D. Calvanese, T. Eiter, and M. Ortiz, Regular path queries in expressive description logics with nominals, Proc. of IJCAI, pp.714-720, 2009.

D. Calvanese, T. Eiter, and M. Ortiz, Answering regular path queries in expressive Description Logics via alternating tree-automata, Information and Computation, vol.237, pp.12-55, 2014.
DOI : 10.1016/j.ic.2014.04.002

D. Florescu, A. Levy, and D. Suciu, Query containment for conjunctive queries with regular expressions, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, 1998.
DOI : 10.1145/275487.275503

G. Gottlob and C. H. Papadimitriou, On the complexity of single-rule datalog queries, Information and Computation, vol.183, issue.1, pp.104-122, 2003.
DOI : 10.1016/S0890-5401(03)00012-9

B. C. Grau, I. Horrocks, M. Krötzsch, C. Kupke, D. Magka et al., Acyclicity notions for existential rules and their application to query answering in ontologies, J

D. S. Johnson and A. C. Klug, Testing containment of conjunctive queries under functional and inclusion dependencies, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems , PODS '82, pp.167-189, 1984.
DOI : 10.1145/588111.588138

E. V. Kostylev, J. L. Reutter, and D. Vrgoc, XPath for DL ontologies, Proc. of AAAI, 2015.

D. Maier, A. O. Mendelzon, and Y. Sagiv, Testing implications of data dependencies, ACM Transactions on Database Systems, vol.4, issue.4, pp.455-469, 1979.
DOI : 10.1145/320107.320115

B. Marnette, Generalized schema-mappings, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.13-22, 2009.
DOI : 10.1145/1559795.1559799

M. Ortiz, S. Rudolph, and M. ?imkus, Query answering in the Horn fragments of the description logics SHOIQ and SROIQ, Proc. of IJCAI, 2011.

G. Stefanoni, B. Motik, M. Krötzsch, and S. Rudolph, The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases, J. of Art. Intell. Res. (JAIR), vol.51, pp.645-705, 2014.