E. Thus, R (1 ? m ? 4) so V d (a i1 ) / 2 R (1 ? d ? 3) Let X = ({A(y, a i )} [ {E m (a i1 , ' i ) | 1 ? m ? 4}) \ R and Y = {S g (' i )

|. ?-5, |. |. , Y. ?. A\r, and |. |. |x|, R\ X) [ Y is T -consistent so R is not a ?-repair. In both cases, there exists j such that F r, pp.2-3

. Altwaijry, Query-driven approach to entity resolution, Proceedings of the VLDB Endowment, vol.6, issue.14, pp.1846-1857, 2013.
DOI : 10.14778/2556549.2556567

&. Amgoud and . Vesic, A new approach for preference-based argumentation frameworks, Annals of Mathematics and Artificial Intelligence, vol.28, issue.10???15, pp.149-183, 2011.
DOI : 10.1007/s10472-011-9271-9

. Arenas, Consistent query answers in inconsistent databases, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '99, 1999.
DOI : 10.1145/303976.303983

&. Arioua, M. Croitoru-2016a-]-abdallah-arioua, and . Croitoru, Dialectical Characterization of Consistent Query Explanation with Existential Rules, Proceedings of FLAIRS, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01328679

&. Arioua, M. Croitoru-2016b-]-abdallah-arioua, and . Croitoru, A Dialectical Proof Theory for Universal Acceptance in Coherent Logic-based Argumentation Frameworks, Proceedings of ECAI, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01333368

. Arioua, On Conceptual Graphs and Explanation of Query Answering under Inconsistency, Proceedings of ICCS, 2014.
DOI : 10.1007/978-3-319-08389-6_6

. Arioua, Query Failure Explanation in Inconsistent Knowledge Bases Using Argumentation, Proceedings of COMMA, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01089146

. Arioua, Abdallah Arioua, Nouredine Tamani et Madalina Croitoru Query Answering Explanation in Inconsistent Datalog +/-Knowledge Bases, Proceedings of DEXA, 2015.

. Artale, The DL-Lite Family and Relations, Journal Artif. Intell. Res. (JAIR), vol.36, pp.1-69, 2009.

. References and . Baader, The description logic handbook: Theory, implementation and applications, 2003.

. Baader, Pinpointing in the Description Logic EL +, Proceedings of KI, 2007.

. Baget, On rules with existential variables: Walking the decidability line, Artificial Intelligence, vol.175, issue.9-10, pp.9-10, 2011.
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

. Baget, Walking the Complexity Lines for Generalized Guarded Existential Rules, Proceedings of IJCAI, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

S. Bail, B. Parsia, and U. Sattler, The logical diversity of explanations in OWL ontologies, Proceedings of the 22nd ACM international conference on Conference on information & knowledge management, CIKM '13, 2013.
DOI : 10.1145/2505515.2505536

. Benferhat, Zied Bouraoui et Karim Tabia. Non Defeated- Based Repair in Possibilistic DL-Lite Knowledge Bases, Proceedings of FLAIRS, 2015.

. Bergman, QOCO, Proceedings of the VLDB Endowment, vol.8, issue.12, pp.1900-1911, 2015.
DOI : 10.14778/2824032.2824096

. Bertossi, Inconsistency Tolerance [result from a Dagstuhl seminar, Lecture Notes in Computer Science, vol.3300, 2005.

E. Leopoldo and . Bertossi, Consistent query answering in databases, SIGMOD Record, vol.35, issue.2, pp.68-76, 2006.

E. Leopoldo and . Bertossi, Database repairing and consistent query answering. Synthesis Lectures on Data Management, 2011.

. Bidoit, Query-Based Why-Not Provenance with NedExplain, Proceedings of EDBT, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00962157

]. Bienvenu and M. Ortiz, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Lecture Notes of the 11th International Reasoning Web Summer School, pp.218-307, 2015.
DOI : 10.1016/j.websem.2014.11.007

. Springer, References [Bienvenu & Rosati 2013] Meghyn Bienvenu et Riccardo Rosati Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access, Proceedings of IJCAI, 2013.

. Bienvenu, Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics, Proceedings of AAAI, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01007557

. Bienvenu, Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases, Proceedings of AAAI, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01277086

. Bienvenu, Querydriven Repairing of Inconsistent DL-Lite Knowledge Bases, Proceedings of IJCAI, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01367864

. Borgida, Alexander Borgida, Enrico Franconi et Ian Horrocks. Explaining ALC Subsumption, Proceedings of ECAI, 2000.

. Borgida, Explanation in the DL-Lite Family of Description Logics, Proceedings of OTM, 2008.
DOI : 10.1007/978-3-540-88873-4_35

. Brewka, Gerhard Brewka, Ilkka Niemelä et Miroslaw Truszczynski, Preferences and Nonmonotonic Reasoning. AI Magazine, pp.69-78, 2008.

. Bursztyn, Damian Bursztyn, François Goasdoué et Ioana Manolescu. Efficient Query Answering in DL-Lite through FOL Reformulation (Extended Abstract), Proceedings of DL, 2015.

. Bursztyn, Teaching an RDBMS about ontological constraints, Proceedings of the VLDB Endowment, vol.9, issue.12, 2016.
DOI : 10.14778/2994509.2994532
URL : https://hal.archives-ouvertes.fr/hal-01354592

R. Samuel, L. Buss, and . Hay, On Truth-Table Reducibility to SAT, Information and Computation, vol.91, issue.1, pp.86-102, 1991.

A. Calì, D. Lembo, and R. Rosati, On the decidability and complexity of query answering over inconsistent and incomplete databases, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, 2003.
DOI : 10.1145/773153.773179

A. Calì, G. Gottlob, and T. Lukasiewicz, A general Datalog-based framework for tractable query answering over ontologies, Web Semantics: Science, Services and Agents on the World Wide Web, vol.14, pp.57-83, 2012.
DOI : 10.1016/j.websem.2012.03.001

. Calvanese, 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

. References and . Calvanese, Evolution of DL-Lite Knowledge Bases, Proceedings of ISWC, 2010.

. Calvanese, The MASTRO system for ontology-based data access, Semantic Web, pp.43-53, 2011.

. Calvanese, Reasoning about Explanations for Negative Query Answers in DL-Lite, Journal of Artificial Intelligence Research (JAIR), vol.48, pp.635-669, 2013.

. Calvanese, Diego Calvanese, Marco Montali et Ario Santoso Verification of Generalized Inconsistency-Aware Knowledge and Action Bases, Proceedings of IJCAI, 2015.

. Cheney, Provenance in Databases: Why, How, and Where, Foundations and Trends in Databases, vol.1, issue.4, pp.379-474, 2009.
DOI : 10.1561/1900000006

. Chomicki, Computing consistent query answers using conflict hypergraphs, Proceedings of the Thirteenth ACM conference on Information and knowledge management , CIKM '04, 2004.
DOI : 10.1145/1031171.1031254

. Chomicki, Hippo: A System for Computing Consistent Answers to a Class of SQL Queries, Proceedings of EDBT, 2004.
DOI : 10.1007/978-3-540-24741-8_53

. Chomicki, Consistent Query Answering: Five Easy Pieces, Proceedings of ICDT, 2007.
DOI : 10.1007/11965893_1

. Chortaras, Alexandros Chortaras, Despoina Trivela et Giorgos Stamou. Optimized Query Rewriting for OWL 2 QL, Proceedings of CADE, 2011.

G. De, On Instance-level Update and Erasure in Description Logic Ontologies, Journal of Logic and Computation, vol.19, issue.5, pp.745-770, 2009.

. Du, Weight-based consistent query answering over inconsistent $${\mathcal {SHIQ}}$$ knowledge bases, Knowledge and Information Systems, vol.25, issue.2, pp.335-371, 2013.
DOI : 10.1007/s10115-012-0478-9

. Du, A Tractable Approach to ABox Abduction over Description Logic Ontologies, Proceedings of AAAI, 2014.

. Du, Towards Tractable and Practical ABox Abduction over Inconsistent Description Logic Ontologies, Proceedings of AAAI, 2015. References [Eiter & Gottlob 1992] Thomas Eiter et Georg Gottlob. On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals, pp.227-270, 1992.

&. Eiter, G. Eiter, and . Gottlob, The complexity of logic-based abduction, Journal of the ACM, vol.42, issue.1, pp.3-42, 1995.
DOI : 10.1145/200836.200838

&. Eiter, G. Eiter, and . Gottlob, The Complexity Class ? P 2 : Recent Results and Applications in AI and Modal Logic, Proceedings of FCT, 1997.

. Eiter, Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$, Proceedings of JELIA, 2008.
DOI : 10.1007/978-3-540-87803-2_15

. Eiter, Query Rewriting for Horn-SHIQ Plus Rules, Proceedings of AAAI, 2012.

T. Eiter, T. Lukasiewicz, and L. Predoiu, Generalized Consistent Query Answering under Existential Rules, Proceedings of KR, 2016.

. Fagin, On the semantics of updates in databases, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems , PODS '83, 1983.
DOI : 10.1145/588058.588100

&. Fuxman and . Miller, Ariel Fuxman et Renée Journal Miller. First-Order Query Rewriting for Inconsistent Databases, Proceedings of ICDT, 2005.

. Fuxman, ConQuer, Proceedings of the 2005 ACM SIGMOD international conference on Management of data , SIGMOD '05, 2005.
DOI : 10.1145/1066157.1066176

. Garcia, Pan et Achille Fokoue Handling uncertainty: An extension of DL-Lite with Subjective Logic, Proceedings of DL, 2015.

. Gottlob, Query Rewriting and Optimization for Ontological Databases, ACM Transactions on Database Systems, vol.39, issue.3, p.25, 2014.
DOI : 10.1145/2638546

. Guo, LUBM: A benchmark for OWL knowledge base systems, Zhengxiang Pan et Jeff Heflin, pp.158-182, 2005.
DOI : 10.1016/j.websem.2005.06.005

. Gutierrez, RDFS Update: From Theory to Practice, Proceedings of ESWC, 2011.
DOI : 10.1007/3-540-45810-7_33

. Haase, Peter Haase, Frank van Harmelen, Zhisheng Huang, Heiner Stuckenschmidt et York Sure. A Framework for Handling Inconsistency in Changing Ontologies, Proceedings of ISWC, 2005.

R. Herschel and M. A. Hernández, Explaining missing answers to SPJUA queries, Proceedings of the VLDB Endowment, vol.3, issue.1-2, pp.185-196, 2010.
DOI : 10.14778/1920841.1920869

. Horridge, The Cognitive Complexity of OWL Justifications, Proceedings of ISWC, 2011.
DOI : 10.1093/cercor/11.10.954

. Horridge, Extracting Justifications from BioPortal Ontologies, Proceedings of ISWC, 2012.
DOI : 10.1007/978-3-642-35173-0_19

. Huang, Zhisheng Huang, Frank van Harmelen et Annette ten Teije. Reasoning with Inconsistent Ontologies, Proceedings of IJCAI, 2005.

. Hustadt, Reasoning in Description Logics by a Reduction to Disjunctive Datalog, Journal of Automated Reasoning, vol.2, issue.3, pp.351-384, 2007.
DOI : 10.1007/s10817-007-9080-3

M. Jaeger, Probabilistic Reasoning in Terminological Logics, Proceedings of KR, 1994.
DOI : 10.1016/B978-1-4832-1452-8.50124-X

. Jiménez-ruiz, Ontology Integration Using Mappings: Towards Getting the Right Logical Consequences, Proceedings of ESWC, 2009.
DOI : 10.1007/978-3-642-02121-3_16

. Jiménez-ruiz, Supporting concurrent ontology development: Framework, algorithms and tool, Data & Knowledge Engineering, vol.70, issue.1, pp.146-164, 2011.
DOI : 10.1016/j.datak.2010.10.001

&. Jung, C. Lutz-2012-]-jean, C. Jung, and . Lutz, Ontology-Based Access to Probabilistic Data with OWL QL, Proceedings of ISWC, 2012.
DOI : 10.1007/978-3-642-35176-1_12

. Kalyanpur, Debugging unsatisfiable classes in OWL ontologies, Web Semantics: Science, Services and Agents on the World Wide Web, vol.3, issue.4, pp.268-293, 2005.
DOI : 10.1016/j.websem.2005.09.005

D. Kontokostas, P. Westphal, S. Auer, S. Hellmann, J. Lehmann et al., Test-driven evaluation of linked data quality, Proceedings of the 23rd international conference on World wide web, WWW '14, 2014.
DOI : 10.1145/2566486.2568002

W. Mark and . Krentel, The Complexity of Optimization Problems, Journal of Computer and System Sciences, vol.36, issue.3, pp.490-509, 1988.

&. Krötzsch, S. Krötzsch, and . Rudolph, Extending Decidable Existential Rules by Joining Acyclicity and Guardedness, Proceedings of IJCAI, 2011.

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

. References and . Lembo, Query Rewriting for Inconsistent DL-Lite Ontologies, Proceedings of RR, 2011.

. 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

&. Lopatenko, A. Bertossi, L. E. Lopatenko, and . Bertossi, Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics, Proceedings of ICDT, 2007.
DOI : 10.1007/11965893_13

. Lukasiewicz, Inconsistency Handling in Datalog+/-Ontologies, Proceedings of ECAI, 2012.

. Lukasiewicz, Complexity of Inconsistency-Tolerant Query Answering in Datalog+/???, Proceedings of OTM, 2013.
DOI : 10.1007/978-3-642-41030-7_35

. Lukasiewicz, Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris et Gerardo I. Simari. From Classical to Consistent Query Answering under Existential Rules, Proceedings of AAAI, 2015.

C. Lutz and L. Schröder, Probabilistic Description Logics for Subjective Uncertainty, Proceedings of KR, 2010.

. Lutz, The Combined Approach to OBDA: Taming Role Hierarchies Using Filters, Proceedings of ISWC, 2013.
DOI : 10.1007/978-3-642-41335-3_20

C. Mónica, L. E. Marileo, and . Bertossi, The consistency extractor system: Answer set programs for consistent query answering in databases, Data Knowl. Eng, vol.69, issue.6, pp.545-572, 2010.

&. Mcguinness, L. Deborah, A. Mcguinness, and . Borgida, Explaining Subsumption in Description Logics, Proceedings of IJCAI, 1995.

. Meilicke, Christian Meilicke, Heiner Stuckenschmidt et Andrei Tamilin Supporting Manual Mapping Revision using Logical Reasoning, Proceedings of AAAI, 2008.

A. Meliou, W. Gatterbauer, K. F. Moore, and D. Suciu, The complexity of causality and responsibility for query answers and non-answers, Proceedings of the VLDB Endowment, vol.4, issue.1, pp.34-45, 2010.
DOI : 10.14778/1880172.1880176

. Nikitina, Interactive ontology revision, Web Semantics: Science, Services and Agents on the World Wide Web, vol.12, issue.13, pp.118-130, 2012.
DOI : 10.1016/j.websem.2011.12.002

&. Peñaloza and . Sertkaya, Rafael Peñaloza et Baris Sertkaya Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics, Proceedings of ECAI, 2010.

. Pérez-urbina, Héctor Pérez-Urbina, Ian Horrocks et Boris Motik. Efficient Query Answering for OWL 2, Proceedings of ISWC, 2009.

&. Pfandler and . Sallinger, Andreas Pfandler et Emanuel Sallinger. Distance-Bounded Consistent Query Answering, Proceedings of IJCAI, 2015.

. Qi, A Possibilistic Extension of Description Logics, Proceedings of DL, 2007.

. Rodriguez-muro, Ontology-Based Data Access: Ontop of Databases, Proceedings of ISWC, 2013.
DOI : 10.1007/978-3-642-41335-3_35

&. Rosati, R. Rosati, and A. Almatelli, Improving Query Answering over DL-Lite Ontologies, Proceedings of KR, 2010.

. Rosati, Evaluation of Techniques for Inconsistency Handling in OWL 2 QL Ontologies, Proceedings of ISWC, 2012.
DOI : 10.1007/978-3-642-35173-0_23

R. Rosati, On the Complexity of Dealing with Inconsistency in Description Logic Ontologies, Proceedings of IJCAI, 2011.

&. Sebastiani, R. Vescovi, M. Sebastiani, and . Vescovi, Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis, Proceedings of CADE, 2009.
DOI : 10.1016/j.jbi.2006.02.013

. References and . Staworko, Slawek Staworko Prioritized repairing and consistent query answering in relational databases, Annals of Mathematics and Artificial Intelligence, vol.64, issue.2-3, pp.209-246, 2012.

. Venetis, Tassos Venetis, Giorgos Stoilos et Giorgos B. Stamou. Incremental Query Rewriting for OWL 2 QL, Proceedings of DL, 2012.

W. Klaus and . Wagner, More Complicated Questions About Maxima and Minima, and Some Closures of NP, Theoretical Computer Science, vol.51, pp.53-80, 1987.

. Wang, Zhe Wang, Mahsa Chitsaz, Kewen Wang et Jianfeng Du. Towards Scalable and Complete Query Explanation with OWL 2 EL Ontologies, Proceedings of CIKM, 2015.

S. If and H. Are, C k }, a subset M ? S is a minimal unsatisfiable subset (MUS) of S w.r.t. H if M [ H is unsatisfiable, and M 0 [ H is satisfiable for every M 0 ( M . A minimal correction subset (MCS) of S w.r.t. H is a subset M ? S such that (S\M ) [ H is satisfiable and (S\M 0 ) [ H is unsatisfiable for every M 0 ( M . The sets of MUSes and MCSes are hitting set duals of one another: the MUSes are the minimal hitting sets of the MCSes and vice versa, The maximal satisfiable subsets (MSSes) are the complements of the MCSes in S