D. A. Acciarri, G. Calvanese, D. De-giacomo, M. Lembo, M. Lenzerini et al., Quonto: Querying ontologies, AAAI, pp.1670-1671, 2005.

A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev, The DL- Lite family and relations, J. Artif. Intell. Res. (JAIR), vol.36, pp.1-69, 2009.

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

J. Baget, Improving the forward chaining algorithm for conceptual graphs rules, KR'04, pp.407-414, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00918126

F. Baader, S. Brandt, and C. Lutz, Pushing the EL envelope, IJCAI, pp.364-369, 2005.

M. Bienvenu, On the complexity of consistent query answering in the presence of simple ontologies, AAAI, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00789141

J. Baget, M. Lecì-ere, M. Mugnier, and E. Salvat, Extending Decidable Cases for Rules with Existential Variables, IJCAI, pp.677-682, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00410130

J. Baget, M. Lecì-ere, M. Mugnier, and E. Salvat, 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

J. Baget and M. Mugnier, The Complexity of Rules and Constraints, J. Artif. Intell. Res. (JAIR), vol.16, pp.425-465, 2002.
URL : https://hal.archives-ouvertes.fr/lirmm-00268460

J. Baget, M. Mugnier, and M. Thomazo, Towards Farsighted Dependencies for Existential Rules, RR, pp.30-45, 2011.
DOI : 10.1007/3-540-61534-2_16

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

M. Bienvenu and R. Rosati, Tractable approximations of consistent query answering for robust ontology-based data access, IJCAI, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00947531

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

A. Caì-i, G. Gottlob, M. Kifer, D. Calvanese, G. De-giacomo et al., Taming the Infinite Chase: Query Answering under Expressive Relational Constraints Dl-lite: Tractable description logics for ontologies Tractable reasoning and efficient query answering in description logics: The DL-lite family, KRCGL + 05] AAAI, pp.70-80, 2005.

A. Caì-i, G. Gottlob, and T. Lukasiewicz, A General Datalog-Based Framework for Tractable Query Answering over Ontologies, PODS, pp.77-86, 2009.

A. Caì-i, G. Gottlob, and A. Pieris, Query rewriting under non-guarded rules, AMW, 2010.

A. K. Chandra, H. R. Lewis, and J. A. Makowsky, Embedded implicational dependencies and their inference problem, Proceedings of the thirteenth annual ACM symposium on Theory of computing , STOC '81, pp.342-354, 1981.
DOI : 10.1145/800076.802488

M. Chein and M. Mugnier, Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00355336

A. Chortaras, D. Trivela, and G. B. Stamou, Optimized Query Rewriting for OWL 2 QL, CADE, pp.192-206, 2011.
DOI : 10.1007/978-3-642-04930-9_31

T. Eiter, M. Ortiz, M. Simkus, T. Tran, and G. Xiao, Query rewriting for horn-shiq plus rules, AAAI, 2012.

R. Fagin, P. G. Kolaitis, R. J. Miller, L. Popa, B. C. Grau et al., Data exchange, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.89-124741, 2005.
DOI : 10.1145/773153.773163

G. Gottlob, M. Manna, and A. Pieris, Abstract, Theory and Practice of Logic Programming, vol.13, issue.4-5, pp.877-892, 2013.
DOI : 10.1145/962446.962450

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

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

M. Imprialou, G. Stoilos, and B. Grau, Benchmarking ontology-based query rewriting systems, AAAI, 2012.

S. Kikot, R. Kontchakov, V. V. Podolskii, and M. Zakharyaschev, Long rewritings, short rewritings, Description Logics, 2012.

M. König, M. Lecì-ere, M. Mugnier, and M. Thomazo, A Sound and Complete Backward Chaining Algorithm for Existential Rules, RR, pp.122-138, 2012.
DOI : 10.1007/978-3-642-33203-6_10

M. König, M. Lecì-ere, M. Mugnier, and M. Thomazo, On the Exploration of the Query Rewriting Space with Existential Rules, RR, 2013.
DOI : 10.1007/978-3-642-39666-3_10

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

]. D. Llr-+-10, M. Lembo, R. Lenzerini, M. Rosati, D. F. Ruzzi et al., Inconsistencytolerant semantics for description logics, RR, pp.103-117, 2010.

T. Lukasiewicz, M. V. Martinez, and G. I. Simari, Inconsistency handling in datalog+/-ontologies, ECAI, 2012.

N. Leone, M. Manna, G. Terracina, and P. Veltri, Efficiently computable datalog; programs, 2012.

C. Lutz, I. Seylan, D. Toman, and F. Wolter, The Combined Approach to OBDA: Taming Role Hierarchies Using Filters, 2012.
DOI : 10.1007/978-3-642-41335-3_20

C. Lutz, D. Toman, and F. Wolter, Conjunctive Query Answering in the Description Logic EL Using a Relational Database System, IJCAI, 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

J. Mora and . Corcho, Engineering optimisations in query rewriting for OBDA, Proceedings of the 9th International Conference on Semantic Systems, I-SEMANTICS '13, pp.41-48, 2009.
DOI : 10.1145/2506182.2506188

H. Pérez-urbina, I. Horrocks, and B. Motik, Efficient Query Answering for OWL 2, International Semantic Web Conference, pp.489-504, 2009.
DOI : 10.1007/978-3-642-04930-9_31

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

M. Rodriguez-muro and D. Calvanese, High performance query answering over DL-lite ontologies, 2012.

R. Rosati, Prexto: Query Rewriting under Extensional Constraints in DL?????????Lite, ESWC, pp.360-374, 2012.
DOI : 10.1007/978-3-642-30284-8_31

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

M. Thomazo, J. Baget, M. Mugnier, and S. Rudolph, A generic querying algorithm for greedy sets of existential rules, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00675560

M. Thomazo, Compact rewriting for existential rules Optimising resolution-based rewriting algorithms for dl ontologies, IJCAI, 2013. [TSCS13] Despoina Trivela Description Logics, pp.464-476, 2013.

T. Venetis, G. Stoilos, and G. B. Stamou, Incremental query rewriting for OWL 2 QL, Description Logics, 2012.