S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, 1995.

A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev, The DL-Lite family and relations, Journal of Artificial Intelligence Research (JAIR), vol.36, pp.1-69, 2009.

M. Bienvenu, B. Ten-cate, C. Lutz, and F. Wolter, Ontology-Based Data Access, ACM Transactions on Database Systems, vol.39, issue.4, pp.1-44, 2014.
DOI : 10.2168/LMCS-8(1:12)2012

URL : https://hal.archives-ouvertes.fr/lirmm-01367812

M. Bienvenu, S. Kikot, R. Kontchakov, V. V. Podolskii, V. Ryzhikov et al., The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , PODS '17, pp.201-216, 2017.
DOI : 10.1016/0022-0000(91)90020-6

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

M. Bienvenu, S. Kikot, and V. V. Podolskii, Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.317-328, 2015.
DOI : 10.1109/LICS.2015.38

URL : http://www.dcs.bbk.ac.uk/%7Ekikot/papers/lics15_main.pdf

M. Calautti, G. Gottlob, and A. Pieris, Chase Termination for Guarded Existential Rules, Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS '15, pp.91-103, 2015.
DOI : 10.14778/1687627.1687737

D. Calvanese, G. De-giacomo, D. Lembo, M. Lenzerini, and R. Rosati, Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family, Journal of Automated Reasoning, vol.104, issue.1,2, pp.385-429, 2007.
DOI : 10.1007/s10817-007-9078-x

C. Grau, B. Horrocks, I. Krötzsch, M. Kupke, C. Magka et al., Acyclicity notions for existential rules and their application to query answering in ontologies, Journal of Artificial Intelligence Research, vol.47, pp.741-808, 2013.

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity, 2013.
DOI : 10.1007/978-1-4471-5559-1

URL : Downey/maindoc.pdf

C. Feier, A. Kuusisto, and C. Lutz, Rewritability in monadic disjunctive datalog, MMSNP, and expressive description logics, p.2231, 2017.

J. Flum and M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science, An EATCS Series, 2006.

T. Gogacz and J. Marcinkowski, All???Instances Termination of Chase is Undecidable, Proc. of the 41st Int. Colloquium Automata, Languages, and Programming Part II, pp.293-304, 2014.
DOI : 10.1007/978-3-662-43951-7_25

G. Gottlob, N. Leone, and F. Scarcello, The complexity of acyclic conjunctive queries, Journal of the ACM, vol.48, issue.3, pp.431-498, 2001.
DOI : 10.1145/382780.382783

A. Hernich, C. Lutz, A. Ozaki, and F. Wolter, Schema.org as a description logic, Proc. of the 28th Int. Workshop on Description Logics (DL 2015). CEUR Workshop Proceedings, 2015.

S. Kikot, R. Kontchakov, and M. Zakharyaschev, On (in)tractability of OBDA with OWL 2 QL, Proc. of the 24th Int. Workshop on Description Logics (DL 2011). CEUR Workshop Proceedings, pp.224-234, 2011.

S. Kikot, R. Kontchakov, V. V. Podolskii, and M. Zakharyaschev, On the succinctness of query rewriting over shallow ontologies, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-5710, 2014.
DOI : 10.1145/2603088.2603131