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

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

H. Andréka, I. Németi, and J. Van-benthem, Modal Languages and Bounded Fragments of Predicate Logic, Journal of Philosophical Logic, vol.60, issue.5, pp.217-274, 1998.
DOI : 10.1023/A:1004275029985

K. R. Apt, H. A. Blair, and A. Walker, Towards a Theory of Declarative Knowledge, Foundations of Deductive Databases and Logic Programming, pp.89-148, 1988.
DOI : 10.1016/B978-0-934613-40-8.50006-3

F. Baader, Terminological cycles in a description logic with existential restrictions, IJCAI, pp.325-330, 2003.

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

F. Baader, D. Calvanese, D. Mcguinness, D. Nardi, and P. Patel-schneider, The Description Logic Handbook: Theory, Implementation, and Applications, 2007.
DOI : 10.1017/CBO9780511711787

F. Baader, C. Lutz, and A. , Turhan : Small is again beautiful in description logics, pp.25-33, 2010.

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

J. Baget, Private communication, 2012

J. Baget, M. Leclère, and M. Mugnier, On rules with existential variables: Walking the decidability line, KR, 2010.
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

J. Baget, M. Leclère, 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. Leclère, 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, M. Mugnier, S. Rudolph, and M. Thomazo, Walking the complexity lines for generalized guarded existential rules, IJCAI, pp.712-717, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

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

C. Baral, Knowledge Representation, Reasoning, and Declarative Problem Solving, 2003.
DOI : 10.1017/CBO9780511543357

C. Beeri and M. Y. , A Proof Procedure for Data Dependencies, Journal of the ACM, vol.31, issue.4, pp.718-741, 1984.
DOI : 10.1145/1634.1636

M. Bienvenu, Inconsistency-tolerant conjunctive query answering for simple ontologies, Description Logics, 2012.

A. Calì, G. Gottlob, and M. Kifer, Taming the Infinite Chase: Query Answering under Expressive Relational Constraints, KR, pp.70-80, 2008.

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

A. Calì, G. Gottlob, and T. Lukasiewicz, Datalog extensions for tractable query answering over ontologies Fausto Giunchiglia and Letizia Tanca, éditeurs : Semantic Web Information Management, pp.249-279, 2010.

A. Calì, G. Gottlob, and T. Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, J. Web Sem, vol.14, p.2012

A. Calì, G. Gottlob, and A. Pieris, Query Answering under Non-guarded Rules in Datalog+/-, RR, pp.1-17, 2010.
DOI : 10.1007/978-3-642-15918-3_1

A. Calì, G. Gottlob, and A. , Pieris : Query rewriting under non-guarded rules, AMW, 2010b, pp.34-40

D. Calvanese, G. De-giacomo, D. Lembo, M. Lenzerini, and R. Rosati, Dl-lite: Tractable description logics for ontologies, AAAI, pp.602-607, 2005.

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

D. Calvanese, G. De-giacomo, M. Lenzerini, and M. Y. Vardi, Reasoning on regular path queries, ACM SIGMOD Record, vol.32, issue.4, pp.83-92, 2003.
DOI : 10.1145/959060.959076

A. K. Chandra, H. R. Lewis, and J. A. , Makowsky : Embedded implicational dependencies and their inference problem, STOC, pp.342-354, 1981.

M. Chein and M. , Mugnier : Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs, p.9781848002852, 2008.

J. Chomicki, Consistent Query Answering: Five Easy Pieces, ICDT, pp.1-17, 2007.
DOI : 10.1007/11965893_1

A. Chortaras, D. Trivela, and G. B. , Stamou : Optimized query rewriting for OWL 2 QL, CADE, pp.192-206, 2011.

C. Civili and R. Rosati, A Broad Class of First-Order Rewritable Tuple-Generating Dependencies, Datalog, pp.68-80, 2012.
DOI : 10.1007/978-3-642-32925-8_8

C. Civili and R. Rosati, Query Patterns for Existential Rules, RR, pp.42-57, 2012.
DOI : 10.1007/978-3-642-33203-6_5

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

E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov, Complexity and expressive power of logic programming, ACM Computing Surveys, vol.33, issue.3, pp.374-425, 2001.
DOI : 10.1145/502807.502810

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, 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

C. Farré, W. Nutt, E. Teniente, and T. Urpí, Containment of Conjunctive Queries over Databases with Null Values, ICDT, pp.389-403, 2007.
DOI : 10.1007/11965893_27

M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, ICLP/SLP, pp.1070-1080, 1988.

G. Gottlob and C. Koch, Monadic datalog and the expressive power of languages for Web information extraction, Journal of the ACM, vol.51, issue.1, pp.74-113, 2004.
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, KR, pp.23-108, 2012.

B. , C. Grau, I. Horrocks, M. Krötzsch, C. Kupke et al., Acyclicity conditions and their application to query answering in description logics, KR, pp.37-39, 2012.

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

S. Kikot, R. Kontchakov, and M. Zakharyaschev, Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies, RR, pp.124-138, 2011.
DOI : 10.1007/978-3-540-71070-7_16

M. König, M. Leclère, 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. Leclère, 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

R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev, The combined approach to query answering in dl-lite, KR, pp.83-109, 2010.

R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev, The combined approach to ontology-based data access, IJCAI, pp.2656-2661, 2011.

M. Krötzsch, Private communication, 2012

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

M. Krötzsch, S. Rudolph, and P. Hitzler, Conjunctive Queries for a Tractable Fragment of OWL??1.1, ISWC/ASWC, pp.310-323, 2007.
DOI : 10.1007/978-3-540-76298-0_23

M. Leclère, M. Mugnier, and S. Rocher, Kiabora: An Analyzer of Existential Rule Bases, RR, 2013.
DOI : 10.1007/978-3-642-39666-3_22

D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, and D. F. Savo, Inconsistency-Tolerant Semantics for Description Logics, RR, pp.103-117, 2010.
DOI : 10.1007/978-3-642-15918-3_9

D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, and D. F. Savo, Inconsistency-tolerant firstorder rewritability of dl-lite with identification and denial assertions, Description Logics, 2012.

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

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

C. Lutz, I. Seylan, D. Toman, and F. Wolter, The Combined Approach to OBDA: Taming Role Hierarchies Using Filters, SSWS+HPCSW, 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

M. Mugnier, G. Simonet, and M. Thomazo, On the complexity of entailment in existential conjunctive first-order logic with atomic negation, Information and Computation, vol.215, pp.8-31, 2012.
DOI : 10.1016/j.ic.2012.03.001
URL : https://hal.archives-ouvertes.fr/lirmm-00681914

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

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

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

R. Rosati, On the complexity of dealing with inconsistency in description logic ontologies, IJCAI, pp.1057-1062, 2011.

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

S. Rudolph, Private communication, 2012

S. Rudolph and M. Krötzsch, Flag & check, Proceedings of the 32nd symposium on Principles of database systems, PODS '13, pp.23-110, 2013.
DOI : 10.1145/2463664.2465227

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

J. F. Sowa, On conceptual structures, Artificial Intelligence, vol.34, issue.3, 1984.
DOI : 10.1016/0004-3702(88)90069-0

G. Stefanoni and B. , Motik and I. Horrocks : Small datalog query rewritings for EL, Description Logics, 2012.

M. Thomazo, From EL to tractable existential rules with complex role inclusions, Description Logics, pp.44-110, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00763586

M. Thomazo, Compact rewriting for existential rules, IJCAI, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00839422

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

F. Van-harmelen, V. Lifschitz, and B. Porter, Handbook of Knowledge Representation, p.9780444522115, 2007.

T. Venetis, G. Stoilos, and G. B. , Stamou : Incremental query rewriting for OWL 2 QL, Description Logics, pp.104-107, 2012.