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

V. Bárány, G. Gottlob, and M. Otto, Querying the guarded fragment, Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, pp.11-14, 2010.

J. Baget, M. Lecì, and M. Mugnier, On rules with existential variables: Walking the decidability line, Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, 2010.
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

[. Baget, M. Lecì-ere, M. Mugnier, and E. Salvat, DL-SR: a lite DL with expressive rules: Preliminary results, Proceedings of the Twenty-First International Workshop on Description Logics (DL2008), 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00394383

[. Baget, M. Lecì-ere, M. Mugnier, and E. Salvat, Extending decidable cases for rules with existential variables The Complexity of Rules and Constraints, Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, pp.677-682425, 2002.

M. [. Beeri and . Vardi, The implication problem for data dependencies, Proceedings of Automata, Languages and Programming, Eigth Colloquium (ICALP 1981), pp.73-85, 1981.
DOI : 10.1007/3-540-10843-2_7

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

D. Calvanese, T. Eiter, and M. Ortiz, Regular path queries in expressive description logics with nominals, Proceedings of the 21st International Conference on Artificial Intelligence (IJCAI'09), pp.714-720, 2009.

G. [. Caì-i, M. Gottlob, and . Kifer, Taming the infinite chase: Query answering under expressive relational constraints, Proceedings of the Eleventh International Conference on the Principles of Knowledge Representation and Reasoning, pp.70-80, 2008.

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

G. Andreacaì-i, T. Gottlob, and . Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, Proceedings of the 28th symposium on Principles of database systems (PODS'09), pp.77-86, 2009.

G. A. Caì-i, T. Gottlob, B. Lukasiewicz, A. Marnette, and . Pieris, Datalog+/-: A family of logical knowledge representation and query languages for new applications, LICS, pp.228-242, 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

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

]. B. Cou90 and . Courcelle, The monadic second-order logic of graphs: I. recognizable sets of finite graphs, Inf. Comput, vol.85, issue.1, pp.12-75, 1990.

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

P. [. Fagin, R. J. Kolaitis, L. Miller, and . 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
URL : http://doi.org/10.1016/j.tcs.2004.10.033

[. Hustadt, B. Motik, and U. Sattler, Data complexity of reasoning in very expressive description logics, Proc. 19th Int. Joint Conf. on Artificial Intelligence (IJCAI'05), pp.466-471, 2005.

A. [. Johnson and . Klug, Testing containment of conjunctive queries under functional and inclusion dependencies, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems , PODS '82, pp.167-189, 1984.
DOI : 10.1145/588111.588138

G. Kerdiles, Saying it with Pictures: a logical landscape of conceptual graphs, 2001.

M. Krötzsch, S. Rudolph, and P. Hitzler, Complexity boundaries for Horn description logics, Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI'07), pp.452-457, 2007.

C. Lutz, D. Toman, and F. Wolter, Conjunctive query answering in the description logic el using a relational database system, Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, pp.2070-2075, 2009.

]. C. Lut07 and . Lutz, Inverse roles make conjunctive queries hard, Proceedings of the 2007 International Workshop on Description Logics (DL2007), CEUR-WS, 2007.