L. Amgoud and C. Cayrol, Inferring from inconsistency in preference-based argumentation frameworks, J. Autom. Reasoning, vol.29, issue.2, pp.125-169, 2002.

L. Amgoud and S. Vesic, Rich preferencebased argumentation frameworks, Int. J. Approx. Reasoning, vol.55, issue.2, pp.585-606, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01123723

A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev, The DL-Lite family and relations, J. Artif. Intell. Res, vol.36, pp.1-69, 2009.

F. Baader, I. Horrocks, C. Lutz, and U. Sattler, An Introduction to Description Logic, 2017.

J. Baget, S. Benferhat, Z. Bouraoui, M. Croitoru, M. Mugnier et al., Inconsistency-tolerant query answering: Rationality properties and computational complexity analysis, JELIA, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01412864

S. Belabbes and S. Benferhat, Inconsistency handling for partially preordered ontologies: Going beyond Elect, KSEM, 2019.

S. Belabbes, S. Benferhat, and J. Chomicki, Elect: An inconsistency handling approach for partially preordered lightweight ontologies, LPNMR, 2019.

S. Benferhat, Z. Bouraoui, and K. Tabia, How to select one preferred assertional-based repair from inconsistent and prioritized DL-Lite knowledge bases, IJCAI, 2015.

M. Bienvenu and C. Bourgaux, Inconsistencytolerant querying of description logic knowledge bases, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01633000

M. Bienvenu and C. Bourgaux, Querying and repairing inconsistent prioritized knowledge bases: Complexity analysis and links with abstract argumentation, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02947251

M. Bienvenu and M. Ortiz, Ontology-mediated query answering with data-tractable description logics, 2015.

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

M. Bienvenu, C. Bourgaux, and F. Goasdoué, Querying inconsistent description logic knowledge bases under preferred repair semantics, AAAI, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01007557

M. Bienvenu, C. Bourgaux, and F. Goasdoué, Computing and explaining query answers over inconsistent DL-Lite knowledge bases, J. Artif. Intell. Res, vol.64, pp.563-644, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02066288

M. Bienvenu, Inconsistency handling in ontologymediated query answering: A progress report, DL, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02342174

E. Boros, K. M. Elbassioni, V. Gurvich, and L. Khachiyan, An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension, Parallel Processing Letters, vol.10, issue.4, pp.253-266, 2000.

C. Bourgaux, Inconsistency Handling in Ontology-Mediated Query Answering, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01378723

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, J. Autom. Reasoning, vol.39, issue.3, pp.385-429, 2007.

S. Coste-marquis, C. Devred, and P. Marquis, Symmetric argumentation frameworks, ECSQARU, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00014624

M. Croitoru and S. Vesic, What can argumentation do for inconsistent ontology query answering? In SUM, 2013.

M. Croitoru, R. Thomopoulos, and S. Vesic, Introducing preference-based argumentation to inconsistent ontological knowledge bases, PRIMA, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01242937

M. Diller, A. Keshavarzi-zafarghandi, T. Linsbichler, and S. Woltran, Investigating subclasses of abstract dialectical frameworks, Argument & Computation, vol.11, issue.1-2, pp.191-219, 2020.

J. Du, G. Qi, and Y. Shen, Weight-based consistent query answering over inconsistent SHIQ knowledge bases, Knowl. Inf. Syst, vol.34, issue.2, pp.335-371, 2013.

P. M. Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games, Artif. Intell, vol.77, issue.2, pp.321-358, 1995.

T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput, vol.24, issue.6, pp.1278-1304, 1995.

R. Fagin, B. Kimelfeld, F. Reiss, S. Vansummeren, R. Fagin et al., A comprehensive study of argumentation frameworks with sets of attacking arguments, PODS. Flouris, vol.41, pp.55-86, 2015.

N. Gorogiannis and A. Hunter, Instantiating abstract argumentation with classical logic arguments: Postulates and properties, Artif. Intell, vol.175, issue.9, pp.1479-1497, 2011.

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, On generating all maximal independent sets, Inf. Process. Lett, vol.27, issue.3, pp.119-123, 1988.

S. Kaci, L. W. Van-der-torre, and S. Villata, Preference in abstract argumentation, COMMA, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01876481

S. Kaci, L. W. Van-der-torre, and E. Weydert, Acyclic argumentation: Attack = conflict + preference, ECAI, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00121169

B. Kimelfeld, E. Livshits, and L. Peterfreund, Detecting ambiguity in prioritized database repairing, ICDT, 2017.

D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, and D. F. Savo, Inconsistency-tolerant semantics for description logics, RR, 2010.

D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, and D. F. Savo, Inconsistency-tolerant query answering in ontology-based data access, Journal Web Sem, vol.33, pp.3-29, 2015.

E. Livshits and B. Kimelfeld, Counting and enumerating (preferred) database repairs, PODS, 2017.

A. Lopatenko and L. E. Bertossi, Complexity of consistent query answering in databases under cardinalitybased and incremental repair semantics, ICDT, 2007.

T. Lukasiewicz, E. Malizia, and A. Vaicenavicius, Complexity of inconsistency-tolerant query answering in Datalog+/-under cardinality-based repairs, AAAI, 2019.

M. V. Martinez, F. Parisi, A. Pugliese, G. I. Simari, and V. S. Subrahmanian, Policy-based inconsistency management in relational databases, Int. J. Approx. Reason, vol.55, issue.2, pp.501-528, 2014.

B. Motik, B. Cuenca-grau, I. Horrocks, Z. Wu, A. Fokoue et al., OWL 2 Web Ontology Language profiles. W3C Recommendation, 2012.

S. H. Nielsen and S. Parsons, A generalization of Dung's abstract framework for argumentation: Arguing with sets of attacking arguments, ArgMAS. OWL Working Group, 2006.

A. Poggi, D. Lembo, D. Calvanese, G. De-giacomo, M. Lenzerini et al., Linking data to ontologies, Journal of Data Semantics, vol.10, pp.133-173, 2008.

P. Rao, K. Sagonas, T. Swift, D. S. Warren, and J. Freire, XSB: A system for effciently computing WFS, LPNMR, 1997.

S. Staworko, J. Chomicki, and J. Marcinkowski, Prioritized repairing and consistent query answering in relational databases, Ann. Math. Artif. Intell, vol.64, issue.2-3, pp.209-246, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00643104

T. P. Tanon, C. Bourgaux, and F. M. Suchanek, Learning how to correct a knowledge base from the edit history, WWW, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02066041

D. Trivela, G. Stoilos, and V. Vassalos, A framework and positive results for IAR-answering, AAAI, 2018.

E. Tsalapati, G. Stoilos, G. B. Stamou, and G. Koletsos, Efficient query answering over expressive inconsistent description logics, IJCAI, 2016.

G. Xiao, D. Calvanese, R. Kontchakov, D. Lembo, A. Poggi et al., Ontologybased data access: A survey, IJCAI, 2018.