{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T13:58:44Z","timestamp":1782741524644,"version":"3.54.5"},"reference-count":46,"publisher":"Maximum Academic Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["KER"],"published-print":{"date-parts":[[2026]]},"DOI":"10.48130\/ker-0026-0006","type":"journal-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T07:36:46Z","timestamp":1782718606000},"page":"0-0","source":"Crossref","is-referenced-by-count":0,"title":["Inconsistent databases and argumentation frameworks with collective attacks"],"prefix":"10.48130","volume":"41","author":[{"given":"Yasir","family":"Mahmood","sequence":"first","affiliation":[{}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonni","family":"Virtema","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timon","family":"Barlag","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Axel-Cyrille Ngonga","family":"Ngomo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"27968","reference":[{"key":"key-10.48130\/ker-0026-0006-1","unstructured":"<p>Abiteboul S, Hull R, Vianu V. 1995. <i>Foundations of databases<\/i>. Boston, USA: Addison-Wesley. <ext-link ext-link-type=\"uri\" xlink:href=\"http:\/\/webdam.inria.fr\/Alice\/\">http:\/\/webdam.inria.fr\/Alice<\/ext-link><\/p>"},{"key":"key-10.48130\/ker-0026-0006-2","doi-asserted-by":"crossref","unstructured":"<p>ten Cate B, Fontaine G, Kolaitis PG. 2012. On the data complexity of consistent query answering. <i>ICDT\u201912: Proceedings of the 15th International Conference on Database Theory, Berlin, Germany, 26\u201329 March 2012<\/i>. New York, NY, USA: Association for Computing Machinery. pp. 22\u201333 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1145\/2274576.2274580\">10.1145\/2274576.2274580<\/ext-link><\/p>","DOI":"10.1145\/2274576.2274580"},{"key":"key-10.48130\/ker-0026-0006-3","doi-asserted-by":"publisher","unstructured":"<p>Barcel\u00f3 P, Fontaine G. 2017. On the data complexity of consistent query answering over graph databases. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/j.jcss.2017.03.015\">Journal of Computer and System Sciences<\/ext-link><\/i> 88:164\u2212194<\/p>","DOI":"10.1016\/j.jcss.2017.03.015"},{"key":"key-10.48130\/ker-0026-0006-4","doi-asserted-by":"crossref","unstructured":"<p>Wijsen J. 2003. Condensed representation of database repairs for consistent query answering. <i>Proceedings of the 9th International Conference on Database Theory<\/i>, ICDT'03. Berlin, Heidelberg: Springer-Verlag. pp. 378\u2013393 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.5555\/645505.656435\">10.5555\/645505.656435<\/ext-link><\/p>","DOI":"10.1007\/3-540-36285-1_25"},{"key":"key-10.48130\/ker-0026-0006-5","doi-asserted-by":"crossref","unstructured":"<p>Lopatenko A, Bertossi LE. 2007. Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. <i>ICDT 2007: Proceedings of the 11th International Conference on Database Theory, Barcelona, Spain, 10\u201312 January 2007<\/i>, <i>Lecture Notes in Computer Science<\/i>, eds. Schwentick T, Suciu D. Berlin, Vol. 4353. Heidelberg: Springer. pp. 179\u2013193 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/11965893_13\">10.1007\/11965893_13<\/ext-link><\/p>","DOI":"10.1007\/11965893_13"},{"key":"key-10.48130\/ker-0026-0006-6","doi-asserted-by":"publisher","unstructured":"<p>Dung PM. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/0004-3702(94)00041-X\">Artificial Intelligence<\/ext-link><\/i> 77(2):321\u2212357<\/p>","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"key-10.48130\/ker-0026-0006-7","doi-asserted-by":"crossref","unstructured":"<p>Nielsen SH, Parsons S. 2006. A generalization of Dung\u2019s abstract framework for argumentation: arguing with sets of attacking arguments. <i>Argumentation in Multi-Agent Systems, Third International Workshop, ArgMAS 2006, Hakodate, Japan, 8 May 2006, Revised Selected and Invited Papers, Lecture Notes in Computer Science<\/i>, eds. Maudet N, Parsons S, Rahwan I. Vol. 4766. Berlin, Heidelberg: Springer. pp. 54\u201373 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/978-3-540-75526-5_4\">10.1007\/978-3-540-75526-5_4<\/ext-link><\/p>","DOI":"10.1007\/978-3-540-75526-5_4"},{"key":"key-10.48130\/ker-0026-0006-8","unstructured":"<p>Arioua A, Croitoru M. 2016. Dialectical characterization of consistent query explanation with existential rules. <i>Proceedings of the Twenty-Ninth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2016, Key Largo, Florida, USA, 16\u201318 May 2016<\/i>, eds. Markov Z, Russell I. Washington D.C., USA: AAAI Press. pp. 621\u2013625. <ext-link ext-link-type=\"uri\" xlink:href=\"http:\/\/www.aaai.org\/ocs\/index.php\/FLAIRS\/FLAIRS16\/paper\/view\/12800\">www.aaai.org\/ocs\/index.php\/FLAIRS\/FLAIRS16\/paper\/view\/12800<\/ext-link><\/p>"},{"key":"key-10.48130\/ker-0026-0006-9","doi-asserted-by":"publisher","unstructured":"<p>Arioua A, Croitoru M, Vesic S. 2017. Logic-based argumentation with existential rules. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/j.ijar.2017.07.004\">International Journal of Approximate Reasoning<\/ext-link><\/i> 90:76\u2212106<\/p>","DOI":"10.1016\/j.ijar.2017.07.004"},{"key":"key-10.48130\/ker-0026-0006-10","doi-asserted-by":"crossref","unstructured":"<p>Arioua A, Tamani N, Croitoru M. 2015. Query answering explanation in inconsistent datalog +\/- knowledge bases. <i>Database and Expert Systems Applications - 26th International Conference, DEXA 2015, Valencia, Spain, 1\u20134 September 2015, Proceedings, Part I. Lecture Notes in Computer Science<\/i>, eds. Chen Q, Hameurlain A, Toumani F, Wagner RR, Decker H. Vol. 9261. Cham: Springer. pp. 203\u2013219 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/978-3-319-22849-5_15\">10.1007\/978-3-319-22849-5_15<\/ext-link><\/p>","DOI":"10.1007\/978-3-319-22849-5_15"},{"key":"key-10.48130\/ker-0026-0006-11","doi-asserted-by":"crossref","unstructured":"<p>Young AP, Modgil S, Rodrigues O. 2016. Prioritised default logic as argumentation with partial order default priorities. arXiv:1609.05224<\/p>","DOI":"10.65109\/CLWH5700"},{"key":"key-10.48130\/ker-0026-0006-12","doi-asserted-by":"crossref","unstructured":"<p>Yun B, Vesic S, Croitoru M. 2020. Sets of attacking arguments for inconsistent datalog knowledge bases. <i>Computational Models of Argument - Proceedings of COMMA 2020, Perugia, Italy, 4\u201311 September 2020. Frontiers in Artificial Intelligence and Applications<\/i>, eds. Prakken H, Bistarelli S, Santini F, Taticchi C. Vol. 326. Amsterdam, NL: IOS Press. pp. 419\u2013430 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.3233\/FAIA200526\">10.3233\/FAIA200526<\/ext-link><\/p>","DOI":"10.3233\/FAIA200526"},{"key":"key-10.48130\/ker-0026-0006-13","doi-asserted-by":"crossref","unstructured":"<p>Bienvenu M, Bourgaux C. 2020. Querying and repairing inconsistent prioritized knowledge bases: complexity analysis and links with abstract argumentation. <i>Proceedings of the 17<sup>th<\/sup> International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, 12\u201318 September 2020<\/i>, eds. Calvanese D, Erdem E, Thielscher M. California: IJCAI. pp. 141\u2013151 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.24963\/KR.2020\/15\">10.24963\/KR.2020\/15<\/ext-link><\/p>","DOI":"10.24963\/kr.2020\/15"},{"key":"key-10.48130\/ker-0026-0006-14","doi-asserted-by":"publisher","unstructured":"<p>Arieli O, Borg A, Heyninck J. 2019. A review of the relations between logical argumentation and reasoning with maximal consistency. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1007\/s10472-019-09629-7\">Annals of Mathematics and Artificial Intelligence<\/ext-link><\/i> 87(3):187\u2212226<\/p>","DOI":"10.1007\/s10472-019-09629-7"},{"key":"key-10.48130\/ker-0026-0006-15","doi-asserted-by":"crossref","unstructured":"<p>Afrati FN, Kolaitis PG. 2009. Repair checking in inconsistent databases: algorithms and complexity. <i>Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, 23\u201325 March 2009, Proceedings. ACM International Conference Proceeding Series<\/i>, ed. Fagin R. Vol. 361. New York, NY, USA: ACM. pp. 31\u201341 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1145\/1514894.1514899\">10.1145\/1514894.1514899<\/ext-link><\/p>","DOI":"10.1145\/1514894.1514899"},{"key":"key-10.48130\/ker-0026-0006-16","doi-asserted-by":"crossref","unstructured":"<p>Arenas M, Bertossi LE, Chomicki J. 2001. Scalar aggregation in FD-inconsistent databases. <i>Database Theory - ICDT 2001, 8th International Conference, London, UK, 4\u20136 January 2001, Proceedings, Vol. 1973 of Lecture Notes in Computer Science<\/i>, eds. Van den Bussche J, Vianu V. Berlin, Heidelberg: Springer. pp. 39\u201353 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/3-540-44503-X_3\">10.1007\/3-540-44503-X_3<\/ext-link><\/p>","DOI":"10.1007\/3-540-44503-X_3"},{"key":"key-10.48130\/ker-0026-0006-17","doi-asserted-by":"crossref","unstructured":"<p>Chomicki J, Marcinkowski J. 2005. Minimal-change integrity maintenance using tuple deletions. <i>Information and Computation<\/i> 197(1):90\u2013121<\/p>","DOI":"10.1016\/j.ic.2004.04.007"},{"key":"key-10.48130\/ker-0026-0006-18","doi-asserted-by":"crossref","unstructured":"<p>Hannula M, Wijsen J. 2022. A dichotomy in consistent query answering for primary keys and unary foreign keys. <i>PODS \u201922: International Conference on Management of Data, Philadelphia, PA, USA, 12\u201317 June 2022<\/i>, eds. Libkin L, Barcel\u00f3 New York, NY, USA: ACM. pp. 437\u2013449 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1145\/3517804.3524157\">10.1145\/3517804.3524157<\/ext-link><\/p>","DOI":"10.1145\/3517804.3524157"},{"key":"key-10.48130\/ker-0026-0006-19","doi-asserted-by":"crossref","unstructured":"<p>Livshits E, Kimelfeld B, Roy S. 2020. Computing optimal repairs for functional dependencies. <i>ACM Transactions on Database Systems<\/i> 45(1):1\u201346<\/p>","DOI":"10.1145\/3360904"},{"key":"key-10.48130\/ker-0026-0006-20","doi-asserted-by":"publisher","unstructured":"<p>Staworko S, Chomicki J. 2010. Consistent query answers in the presence of universal constraints. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/J.IS.2009.03.004\">Information Systems<\/ext-link><\/i> 35(1):1\u221222<\/p>","DOI":"10.1016\/J.IS.2009.03.004"},{"key":"key-10.48130\/ker-0026-0006-21","doi-asserted-by":"publisher","unstructured":"<p>Bertossi L. 2006. Consistent query answering in databases. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1145\/1147376.1147391\">SIGMOD Record<\/ext-link><\/i> 35:68\u221276<\/p>","DOI":"10.1145\/1147376.1147391"},{"key":"key-10.48130\/ker-0026-0006-22","doi-asserted-by":"crossref","unstructured":"<p>Bertossi LE. 2019. Database repairs and consistent query answering: origins and further developments. <i>Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, 30 June\u20135 July 2019<\/i>, eds. Suciu D, Skritek S, Koch C. New York, NY, USA: ACM. pp. 48\u201358 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1145\/3294052.3322190\">10.1145\/3294052.3322190<\/ext-link><\/p>","DOI":"10.1145\/3294052.3322190"},{"key":"key-10.48130\/ker-0026-0006-23","unstructured":"<p>Kimelfeld B, Livshits E, Peterfreund L. 2017. Detecting ambiguity in prioritized database repairing. <i>20th International Conference on Database Theory (ICDT 2017), Leibniz International Proceedings in Informatics (LIPIcs)<\/i>, eds. Benedikt M, Orsi G. Vol. 68. Dagstuhl, Germany: Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik. pp. 17:1\u201317:20 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2017.17\">10.4230\/LIPIcs.ICDT.2017.17<\/ext-link><\/p>"},{"key":"key-10.48130\/ker-0026-0006-24","doi-asserted-by":"publisher","unstructured":"<p>Kimelfeld B, Livshits E, Peterfreund L. 2020. Counting and enumerating preferred database repairs. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/J.TCS.2020.05.016\">Theoretical Computer Science<\/ext-link><\/i> 837:115\u2212157<\/p>","DOI":"10.1016\/J.TCS.2020.05.016"},{"key":"key-10.48130\/ker-0026-0006-25","doi-asserted-by":"publisher","unstructured":"<p>Staworko S, Chomicki J, Marcinkowski J. 2012. Prioritized repairing and consistent query answering in relational databases. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1007\/S10472-012-9288-8\">Annals of Mathematics and Artificial Intelligence<\/ext-link><\/i> 64(2-3):209\u2212246<\/p>","DOI":"10.1007\/S10472-012-9288-8"},{"key":"key-10.48130\/ker-0026-0006-26","doi-asserted-by":"crossref","unstructured":"<p>Bienvenu M, Bourgaux C. 2023. Inconsistency handling in prioritized databases with universal constraints: complexity analysis and links with active integrity constraints. <i>Proceedings of the 20<sup>th<\/sup> International Conference on Principles of Knowledge Representation and Reasoning, Rhodes, Greece. 2\u20138 September 2023<\/i>. California: IJCAI Organization. pp. 97\u2013106 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.24963\/kr.2023\/10\">10.24963\/kr.2023\/10<\/ext-link><\/p>","DOI":"10.24963\/kr.2023\/10"},{"key":"key-10.48130\/ker-0026-0006-27","unstructured":"<p>V\u00e4\u00e4n\u00e4nen J. 2007. <i>Dependence logic<\/i>. Cambridge, England: Cambridge University Press. <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/home.hvl.no\/prosjekter\/easllc2012\/docs\/vaananen\/dependence_logic_short_version.pdf\">https:\/\/home.hvl.no\/prosjekter\/easllc2012\/docs\/vaananen\/dependence_logic_short_version.pdf<\/ext-link><\/p>"},{"key":"key-10.48130\/ker-0026-0006-28","doi-asserted-by":"publisher","unstructured":"<p>Hannula M, Hella L. 2022. Complexity thresholds in inclusion logic. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/J.IC.2021.104759\">Information and Computation<\/ext-link><\/i> 287:104759<\/p>","DOI":"10.1016\/J.IC.2021.104759"},{"key":"key-10.48130\/ker-0026-0006-29","unstructured":"<p>Mahmood Y. 2022. <i>Parameterized aspects of team-based formalisms and logical inference<\/i>. Thesis. Institutional Repository of Leibniz Universit\u00e4t, Hannover, Germany.<\/p>"},{"key":"key-10.48130\/ker-0026-0006-30","doi-asserted-by":"crossref","unstructured":"<p>Arioua A, Tamani N, Croitoru M, Buche P. 2014. Query failure explanation in inconsistent knowledge bases using argumentation. <i>Computational Models of Argument - Proceedings of COMMA 2014, Atholl Palace Hotel, Scottish Highlands, UK, 9\u201312 September 2014. Vol. 266 of Frontiers in Artificial Intelligence and Applications<\/i>, eds. Parsons S, Oren N, Reed C, Cerutti F. Amsterdam, The Netherlands: IOS Press. pp. 101\u2013108 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.3233\/978-1-61499-436-7-101\">10.3233\/978-1-61499-436-7-101<\/ext-link><\/p>","DOI":"10.3233\/978-1-61499-436-7-101"},{"key":"key-10.48130\/ker-0026-0006-31","doi-asserted-by":"crossref","unstructured":"<p>Croitoru M, Thomopoulos R, Vesic S. 2015. Introducing preference-based argumentation to inconsistent ontological knowledge bases. <i>PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Bertinoro, Italy, 26\u201330 October 2015, Proceedings. Vol. 9387 of Lecture Notes in Computer Science<\/i>, eds. Chen Q, Torroni P, Villata S, Yung-jen Hsu J, Omicini A. Cham: Springer. pp. 594\u2013602 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/978-3-319-25524-8_42\">10.1007\/978-3-319-25524-8_42<\/ext-link><\/p>","DOI":"10.1007\/978-3-319-25524-8_42"},{"key":"key-10.48130\/ker-0026-0006-32","doi-asserted-by":"crossref","unstructured":"<p>Croitoru M, Vesic S. 2013. What can argumentation do for inconsistent ontology query answering? <i>Scalable Uncertainty Management - 7th International Conference, SUM 2013, Proceedings. Washington, DC, USA, 16\u201318 September 2013. Vol. 8078 of Lecture Notes in Computer Science<\/i>, eds. Liu W, Subrahmanian VS, Wijsen J. Berlin, Heidelberg: Springer. pp. 15\u201329 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/978-3-642-40381-1_2\">10.1007\/978-3-642-40381-1_2<\/ext-link><\/p>","DOI":"10.1007\/978-3-642-40381-1_2"},{"key":"key-10.48130\/ker-0026-0006-33","doi-asserted-by":"publisher","unstructured":"<p>Ho L, Arch-int S, Acar E, Schlobach S, Arch-int N. 2022. An argumentative approach for handling inconsistency in prioritized datalog\u00b1 ontologies. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.3233\/AIC-220087\">AI Communications<\/ext-link><\/i> 35:243\u2212267<\/p>","DOI":"10.3233\/AIC-220087"},{"key":"key-10.48130\/ker-0026-0006-34","doi-asserted-by":"crossref","unstructured":"<p>K\u00f6nig M, Rapberger A, Ulbricht M. 2022. Just a matter of perspective. In <i>Computational models of argument<\/i>, eds. Toni F, Polberg S, Booth R, Caminada M, Kido H. Amsterdam, The Netherlands: IOS Press. pp. 212\u2013223 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.3233\/FAIA220154\">10.3233\/FAIA220154<\/ext-link><\/p>","DOI":"10.3233\/FAIA220154"},{"key":"key-10.48130\/ker-0026-0006-35","doi-asserted-by":"publisher","unstructured":"<p>Bondarenko A, Dung PM, Kowalski RA, Toni F. 1997. An abstract, argumentation-theoretic approach to default reasoning. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/S0004-3702(97)00015-5\">Artificial intelligence<\/ext-link><\/i> 93(1\u22122):63\u2212101<\/p>","DOI":"10.1016\/S0004-3702(97)00015-5"},{"key":"key-10.48130\/ker-0026-0006-36","doi-asserted-by":"publisher","unstructured":"<p>Dvo\u0159\u00e1k W, Woltran S. 2020. Complexity of abstract argumentation under a claim-centric view. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/j.artint.2020.103290\">Artificial Intelligence<\/ext-link><\/i> 285:103290<\/p>","DOI":"10.1016\/j.artint.2020.103290"},{"key":"key-10.48130\/ker-0026-0006-37","doi-asserted-by":"crossref","unstructured":"<p>Mahmood Y, Hecher M, Ngomo A-CN. 2025. Dung\u2019s argumentation framework: unveiling the expressive power with inconsistent databases. <i>AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, Philadelphia, PA, USA, 25 February\u20134 March 2025<\/i>, eds. Walsh T, Shah J, Kolter Z. Washington, DC, USA: AAAI Press. pp. 15058\u201315066 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1609\/AAAI.V39I14.33651\">10.1609\/AAAI.V39I14.33651<\/ext-link><\/p>","DOI":"10.1609\/aaai.v39i14.33651"},{"key":"key-10.48130\/ker-0026-0006-38","doi-asserted-by":"crossref","unstructured":"<p>Mahmood Y, Virtema J, Barlag T, Ngomo A-CN. 2024. Computing repairs under functional and inclusion dependencies via argumentation. <i>International Symposium on Foundations of Information and Knowledge Systems<\/i>, eds. Meier A, Ortiz M. Cham: Springer. pp. 23\u201342 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/978-3-031-56940-1_2\">10.1007\/978-3-031-56940-1_2<\/ext-link><\/p>","DOI":"10.1007\/978-3-031-56940-1_2"},{"key":"key-10.48130\/ker-0026-0006-39","unstructured":"<p>Arming S, Pichler R, Sallinger E. 2016. Complexity of repair checking and consistent query answering. <i>19th International Conference on Database Theory (ICDT 2016). Leibniz International Proceedings in Informatics (LIPIcs)<\/i>. Vol. 48. Schloss Dagstuhl: Leibniz-Zentrum f\u00fcr Informatik. pp. 21:1\u201321:18 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2016.21\">10.4230\/LIPIcs.ICDT.2016.21<\/ext-link><\/p>"},{"key":"key-10.48130\/ker-0026-0006-40","unstructured":"<p>Dvor\u00e1k W, Dunne PE. 2017. Computational problems in formal argumentation and their complexity. <i>FLAP<\/i> 4(8):21:1\u221221:18<\/p>"},{"key":"key-10.48130\/ker-0026-0006-41","doi-asserted-by":"crossref","unstructured":"<p>Coste-Marquis S, Devred C, Marquis P. 2005. Symmetric argumentation frameworks. <i>Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 8th European Conference, ECSQARU 2005, Barcelona, Spain, 6\u20138 July 2005, Proceedings. Lecture Notes in Computer Science<\/i>, ed. Godo L. Vol. 3571. Berlin, Heidelberg: Springer. pp. 317\u2013328 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/11518655_28\">10.1007\/11518655_28<\/ext-link><\/p>","DOI":"10.1007\/11518655_28"},{"key":"key-10.48130\/ker-0026-0006-42","doi-asserted-by":"publisher","unstructured":"<p>Amgoud L, Cayrol C, Lagasquie-Schiex MC, Livet P. 2008. On bipolarity in argumentation frameworks. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1002\/INT.20307\">International Journal of Intelligent Systems<\/ext-link><\/i> 23(10):1062\u22121093<\/p>","DOI":"10.1002\/INT.20307"},{"key":"key-10.48130\/ker-0026-0006-43","doi-asserted-by":"crossref","unstructured":"<p>Nouioua F, Risch V. 2011. Argumentation frameworks with necessities. <i>Scalable Uncertainty Management - 5<sup>th<\/sup> International Conference, Proceedings, SUM 2011, Dayton, OH, USA, 10\u201313 October 2011. Lecture Notes in Computer Science<\/i>, eds. Benferhat S, Grant J. Vol. 6929. Berlin, Heidelberg: Springer. pp. 163\u2013176 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1007\/978-3-642-23963-2_14\">10.1007\/978-3-642-23963-2_14<\/ext-link><\/p>","DOI":"10.1007\/978-3-642-23963-2_14"},{"key":"key-10.48130\/ker-0026-0006-44","unstructured":"<p>Dimopoulos Y, Dvor\u00e1k W, K\u00f6nig M, Rapberger A, Ulbricht M, et al. 2023. Sets attacking sets in abstract argumentation. <i>21<sup>st<\/sup> International Workshop on Nonmonotonic Reasoning, 2\u20134 September 2023, Rhodes, Greece<\/i>. Bonn, Germany: CEUR-WS.org. pp. 22\u201331 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.34726\/5386\">10.34726\/5386<\/ext-link><\/p>"},{"key":"key-10.48130\/ker-0026-0006-45","doi-asserted-by":"crossref","unstructured":"<p>Fagin R, Kimelfeld B, Kolaitis PG. 2015. Dichotomies in the complexity of preferred repairs. <i>Proceedings of the 34<sup>th<\/sup> ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, 31 May\u20134 June 2015<\/i>. New York, NY, USA: ACM. pp. 3\u201315 doi: <ext-link ext-link-type=\"uri\" xlink:href=\"https:\/\/doi.org\/10.1145\/2745754.2745762\">10.1145\/2745754.2745762<\/ext-link><\/p>","DOI":"10.1145\/2745754.2745762"},{"key":"key-10.48130\/ker-0026-0006-46","doi-asserted-by":"publisher","unstructured":"<p>Bienvenu M, Bourgaux C, Goasdou\u00e9 F. 2019. Computing and explaining query answers over inconsistent dl-lite knowledge bases. <i><ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1613\/jair.1.11395\">Journal of Artificial Intelligence Research<\/ext-link><\/i> 64:563\u2212644<\/p>","DOI":"10.1613\/jair.1.11395"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"deposited":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T13:25:16Z","timestamp":1782739516000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.maxapress.com\/article\/doi\/10.48130\/ker-0026-0006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.48130\/ker-0026-0006","relation":{},"ISSN":["1469-8005"],"issn-type":[{"value":"1469-8005","type":"print"}],"subject":[],"published":{"date-parts":[[2026]]}}}