. Bienvenu, . Ortiz, M. Bienvenu, and . Ortiz, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Reasoning Web, pp.218-307, 2015.
DOI : 10.1016/j.websem.2014.11.007

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

. Bienvenu, First order-rewritability of atomic queries in Horn description logics, Proc. of IJCAI, pp.754-760, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00947535

. Bienvenu, Tractable queries for lightweight description logics, Proc. of IJCAI, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00947533

. Bienvenu, Querying inconsistent description logic knowledge bases under preferred repair semantics Ontology-based data access: a study through Disjunctive Datalog, CSP, and MMSNP, Proc. of AAAI, 2014.

. Bienvenu, Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015.
DOI : 10.1109/LICS.2015.38

. Bienvenu, Explaining inconsistency-tolerant query answering over description logic knowledge bases, Proc. of AAAI, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01277086

. Bienvenu, Query-driven repairing of inconsistent DL-Lite knowledge bases, Proc. of IJCAI, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01367864

. Bienvenu, First order-rewritability of conjunctive queries in Horn description logics Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity, Proc. of IJCAI, 2016.

. Bienvenu, Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries On the complexity of consistent query answering in the presence of simple ontologies, Proc. of DL, 2016. [Bienvenu, 2012] Meghyn Bienvenu Proc. of AAAI, 2012.

. Calvanese, Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family, Journal of Automated Reasoning, vol.104, issue.1,2, pp.39385-429, 2007.
DOI : 10.1007/s10817-007-9078-x

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

. Kikot, Exponential Lower Bounds and Separation for Query Rewriting, Proc. of ICALP, 2012.
DOI : 10.1007/978-3-642-31585-5_26

. Kikot, On the succinctness of query rewriting over shallow ontologies Ontologybased data access with databases: A short course, Proc. of LICS Reasoning WebLembo and Ruzzi, 2007] Domenico Lembo and Marco Ruzzi. Consistent query answering over description logic ontologies Proc. of RR, pp.194-229, 2007.

. Lembo, Inconsistency-tolerant query answering in ontology-based data access, Web Semantics: Science, Services and Agents on the World Wide Web, vol.33, pp.3-29, 2015.
DOI : 10.1016/j.websem.2015.04.002