G. Ajtai, Y. Ajtai, and . Gurevich, Datalog vs first-order logic, Journal of Computer and System Sciences, vol.49, issue.3, pp.562-588, 1994.
DOI : 10.1016/S0022-0000(05)80071-6

. Baader, Pushing the EL envelope On rules with existential variables: Walking the decidability line, Proc. of IJ- CAI, pp.364-3699, 2005.

. Benedikt, Monadic Datalog Containment Balder ten Cate, Thomas Colcombet, and Michael Vanden Boom. The Complexity of Boundedness for Guarded Logics, Proc. of ICALP Proc. of LICS, pp.79-91, 2012.

. Bienvenu, . Ortiz, M. Bienvenu, and . Ortizbienvenu, Ontology-mediated query answering with datatractable description logics Query answering in the description logic S Query containment in description logics reconsidered First order-rewritability of atomic queries in Horn description logics, Proc. of Reasoning Web Proc. of DL Proc of KR Proc. of IJCAI Balder ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data access: a study through disjunctive datalog, CSP, and MM- SNP. Proc. of TODS, pp.218-307, 2010.

L. Bourhis, P. Bourhis, and C. Lutz, Containment in monadic disjunctive datalog, MMSNP, and expressive description logics Tractable reasoning and efficient query answering in description logics: The DL-Lite family Ontologies and databases: The DL-Lite approach, Proc. of KRCalvanese Proc. of Reasoning Web, pp.385-429, 2007.

V. Chaudhuri, M. Y. Chaudhuri, and . Vardi, On the complexity of equivalence between recursive and nonrecursive Datalog programs, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '94, pp.107-116, 1994.
DOI : 10.1145/182591.182604

. Civili, C. Rosati, R. Civili, and . Rosaticosmadakis, On the first-order rewritability of conjunctive queries over binary guarded existential rules Decidable optimization problems for database logic programs (preliminary report) Query rewriting for Horn-SHIQ plus rules, Proc. of CILC Proc. of STOC Proc. of AAAI, 2012. [Gottlob et al., 2013] Georg Gottlob, Andreas Pieris, and Lidia Tendera. Querying the guarded fragment with transitivity Proc. of ICALP, pp.25-30, 1988.

. Hansen, Efficient query rewriting in the description logic EL and beyond, Proc. of IJCAI, pp.3034-3040, 2015.

. Kaminski, Computing datalog rewritings for disjunctive datalog programs and description logic ontologies Ontologybased data access with databases: A short course, Proc. of RR Proc. of Reasoning Web, pp.76-91, 2013.

. Lutz, C. Wolter, F. Lutz, and . Wolter, Nonuniform data complexity of query answering in description logics, Proc. of KR, 2012.