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

[. 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

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

G. [. Caì-i, M. Gottlob, and . Kifer, Taming the Infinite Chase: Query Answering under Expressive Relational Constraints, KR'08, pp.70-80, 2008.

]. D. Cgl-+-07, G. Calvanese, D. De-giacomo, M. Lembo, R. Lenzerini et al., Tractable reasoning and efficient query answering in description logics: The DL-Lite family, J. Autom. Reasoning, issue.3, pp.39385-429, 2007.

G. [. Caì-i, T. Gottlob, and . Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, PODS'09, pp.77-86, 2009.

G. [. Caì-i, T. Gottlob, and . Lukasiewicz, A general Datalog-based framework for tractable query answering over ontologies, J. Web Sem, vol.14, 2012.

G. [. Caì-i, A. Gottlob, and . Pieris, Query Answering under Non-guarded Rules in Datalog+, RR'10, pp.1-17, 2010.

H. [. Chandra, J. A. Lewis, and . 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

A. Caì-i, D. Lembo, and R. Rosati, On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases, PODS'03, pp.260-271, 2003.

M. Chein and M. Mugnier, Graph-based Knowledge Representation and Reasoning?Computational Foundations of Conceptual Graphs. Advanced Information and Knowledge Processing, 2009.

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

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

[. 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. Artif. Intell. Res, vol.47, pp.741-808, 2013.

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'12, 2012.

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

M. Imprialou, G. Stoilos, and B. Grau, Benchmarking Ontology- Based Query Rewriting Systems, AAAI'12, 2012.

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

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

. Klt-+-11-]-r, C. Kontchakov, D. Lutz, F. Toman, M. Wolter et al., The Combined Approach to Ontology-Based Data Access, IJCAI'11, pp.2656-2661, 2011.

M. Krötzsch and S. Rudolph, Extending Decidable Existential Rules by Joining Acyclicity and Guardedness, IJCAI'11, pp.963-968, 2011.

M. [. Leone, G. Manna, P. Terracina, and . Veltri, Efficiently computable datalog programs, KR'12, 2012.

D. [. Lutz, F. Toman, and . Wolter, Conjunctive Query Answering in the Description Logic EL Using a Relational Database System, IJCAI'09, pp.2070-2075, 2009.

M. Mugnier, Ontological Query Answering with Existential Rules, RR'11, pp.2-23, 2011.
DOI : 10.1007/3-540-61534-2_16
URL : https://hal.archives-ouvertes.fr/lirmm-00618296

G. Orsi and A. Pieris, Optimizing query answering under ontological constraints, PVLDB, vol.4, issue.11, pp.1004-1015, 2011.

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

A. [. Rosati and . Almatelli, Improving query answering over DL-Lite ontologies, KR'10, 2010.

M. Rodriguez-muro and D. Calvanese, High Performance Query Answering over DL-Lite Ontologies, KR'12, 2012.

E. Salvat and M. Mugnier, Sound and complete forward and backward chainings of graph rules, ICCS'96, pp.248-262, 1996.
DOI : 10.1007/3-540-61534-2_16

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

M. [. Thomazo, G. Venetis, G. B. Stoilos, and . Stamou, Compact Rewriting for Existential Rules Query Extensions and Incremental Query Rewriting for OWL 2 QL Ontologies, IJCAI'13, pp.1-23, 2013.