. Baget, On rules with existential variables: Walking the decidability line, Artificial Intelligence, vol.175, issue.9-10, pp.9-101620, 2011.
DOI : 10.1016/j.artint.2011.03.002

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

. Baget, Walking the complexity lines for generalized guarded existential rules, IJCAI'11, pp.712-717, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

. Beeri, . Vardi, C. Beeri, and M. Vardi, The implication problem for data dependencies, ICALP'81, pp.73-85, 1981.
DOI : 10.1007/3-540-10843-2_7

. Beeri, . Vardi, C. Beeri, and M. Y. Vardi, Formal Systems for Tuple and Equality Generating Dependencies, SIAM Journal on Computing, vol.13, issue.1, pp.76-98, 1984.
DOI : 10.1137/0213006

. Calì, Taming the infinite chase : Query answering under expressive relational constraints, KR'08, pp.70-80, 2008.

. Calì, A general datalog-based framework for tractable query answering over ontologies, PODS'09, pp.77-86, 2009.

. Calì, On the Interaction of Existential Rules and Equality Constraints in Ontology Querying, Correct Reasoning, pp.117-133, 2012.
DOI : 10.1145/320107.320115

. Calì, Query Answering under Non-guarded Rules in Datalog+/-, RR'10, 2010.
DOI : 10.1007/978-3-642-15918-3_1

. Calì, Query rewriting under non-guarded rules, AMW'10, 2010.

. Calvanese, DL-Lite : Tractable description logics for ontologies, AAAI'05, pp.602-607, 2005.

. Chortaras, Optimized Query Rewriting for OWL 2 QL, CADE'11, pp.192-206, 2011.
DOI : 10.1007/978-3-642-04930-9_31

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H

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

B. P. Da-silva, Accès aux données en présence d'ontolo- gies, 2014.

. Deutsch, The chase revisited, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '08, pp.149-158, 2008.
DOI : 10.1145/1376916.1376938

. Eiter, Query rewriting for horn-shiq plus rules, AAAI'12, 2012.

. Fagin, 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 : https://doi.org/10.1016/j.tcs.2004.10.033

. Gottlob, Ontological queries: Rewriting and optimization, 2011 IEEE 27th International Conference on Data Engineering, pp.2-13, 2011.
DOI : 10.1109/ICDE.2011.5767965

. Gottlob, Query Rewriting and Optimization for Ontological Databases, ACM Transactions on Database Systems, vol.39, issue.3, p.14, 2014.
DOI : 10.1007/s13740-012-0017-6

. Gottlob, Expressiveness of guarded existential rule languages, Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '14, pp.27-38, 2014.
DOI : 10.1145/2594538.2594556

G. Gottlob and T. Schwentick, Rewriting ontological queries into small nonrecursive datalog programs, KR'12, 2012.

P. Hell and J. Nesetril, The core of a graph, Discrete Mathematics, vol.109, issue.1-3, pp.1-3117, 1992.
DOI : 10.1016/0012-365X(92)90282-K

. Imprialou, Benchmarking ontology-based query rewriting systems, AAAI'12, 2012.

. Keet, Enhancing web portals with ontology-based data access : The case study of south africa's accessibility portal for people with disabilities, OWLED'08, 2008.

. König, A Sound and Complete Backward Chaining Algorithm for Existential Rules, RR'02, pp.122-138, 2012.
DOI : 10.1007/978-3-642-33203-6_10

. König, On the Exploration of the Query Rewriting Space with Existential Rules, RR'03, pp.123-137, 2013.
DOI : 10.1007/978-3-642-39666-3_10

. Kontchakov, The combined approach to query answering in dl-lite, KR'10, 2010.

. Kontchakov, The combined approach to ontology-based data access, IJCAI'11, pp.2656-2661, 2011.

R. Krötzsch, M. Krötzsch, and S. Rudolph, Extending decidable existential rules by joining acyclicity and guardedness, IJCAI'11, pp.963-968, 2011.

. Lutz, Conjunctive query answering in the description logic el using a relational database system, IJ- CAI'09, pp.2070-2075, 2009.

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

. Pérez-urbina, Efficient Query Answering for OWL 2, ISWC'09, pp.489-504, 2009.
DOI : 10.1007/978-3-642-04930-9_31

. Pérez-urbina, A comparison of query rewriting techniques for dl-lite, DL'09, 2009.

M. Rodriguez-muro and D. Calvanese, High performance query answering over dl-lite ontologies, KR'12, 2012.

. Rodriguez-muro, Query rewriting and optimisation with database dependencies in ontop, DL'13, pp.917-929, 2013.

. Rodriguez-muro, Realizing ontology based data access : A plug-in for protg, ICDE'08, pp.286-289, 2008.

. Rosati, R. Almatelli-]-rosati, and A. Almatelli, Improving query answering over dl-lite ontologies, KR'10, 2010.

M. Salvat, E. Salvat, and M. Mugnier, Sound and complete forward and backward chainingd of graph rules, ICCS'96, pp.248-262, 1996.

M. Thomazo, Compact rewritings for existential rules, IJCAI'13, 2013.

. Thomazo, A generic querying algorithm for greedy sets of existential rules, KR'12, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00763518

. Trivela, Optimising resolution-based rewriting algorithms for dl ontologies, DL'13, pp.464-476, 2013.