{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T02:20:43Z","timestamp":1785291643026,"version":"3.55.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031569395","type":"print"},{"value":"9783031569401","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56940-1_2","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T11:01:40Z","timestamp":1711623700000},"page":"23-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Repairs Under Functional and\u00a0Inclusion Dependencies via\u00a0Argumentation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5651-5391","authenticated-orcid":false,"given":"Yasir","family":"Mahmood","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1582-3718","authenticated-orcid":false,"given":"Jonni","family":"Virtema","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6139-5219","authenticated-orcid":false,"given":"Timon","family":"Barlag","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7112-3516","authenticated-orcid":false,"given":"Axel-Cyrille Ngonga","family":"Ngomo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Afrati, F.N., Kolaitis, P.G.: Repair checking in inconsistent databases: algorithms and complexity. In: Fagin, R. (ed.) Database Theory - ICDT 2009, 12th International Conference, Proceedings. ACM International Conference Proceeding Series, St. Petersburg, Russia, 23\u201325 March 2009, vol. 361, pp. 31\u201341. ACM (2009). https:\/\/doi.org\/10.1145\/1514894.1514899","DOI":"10.1145\/1514894.1514899"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44503-X_3","volume-title":"Database Theory - ICDT 2001","author":"M Arenas","year":"2001","unstructured":"Arenas, M., Bertossi, L.E., Chomicki, J.: Scalar aggregation in FD-inconsistent databases. In: den Bussche, J.V., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 39\u201353. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44503-X_3"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/S10472-019-09629-7","volume":"87","author":"O Arieli","year":"2019","unstructured":"Arieli, O., Borg, A., Heyninck, J.: A review of the relations between logical argumentation and reasoning with maximal consistency. Ann. Math. Artif. Intell. 87(3), 187\u2013226 (2019). https:\/\/doi.org\/10.1007\/S10472-019-09629-7","journal-title":"Ann. Math. Artif. Intell."},{"key":"2_CR4","unstructured":"Arioua, A., Croitoru, M.: Dialectical characterization of consistent query explanation with existential rules. In: Markov, Z., Russell, I. (eds.) Proceedings of the Twenty-Ninth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2016, Key Largo, Florida, USA, 16\u201318 May 2016, pp. 621\u2013625. AAAI Press (2016). http:\/\/www.aaai.org\/ocs\/index.php\/FLAIRS\/FLAIRS16\/paper\/view\/12800"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/J.IJAR.2017.07.004","volume":"90","author":"A Arioua","year":"2017","unstructured":"Arioua, A., Croitoru, M., Vesic, S.: Logic-based argumentation with existential rules. Int. J. Approx. Reason. 90, 76\u2013106 (2017). https:\/\/doi.org\/10.1016\/J.IJAR.2017.07.004","journal-title":"Int. J. Approx. Reason."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-22849-5_15","volume-title":"Database and Expert Systems Applications - 26th International Conference, DEXA 2015","author":"A Arioua","year":"2015","unstructured":"Arioua, A., Tamani, N., Croitoru, M.: Query answering explanation in inconsistent datalog +\/- knowledge bases. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R.R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9261, pp. 203\u2013219. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22849-5_15"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Arioua, A., Tamani, N., Croitoru, M., Buche, P.: Query failure explanation in inconsistent knowledge bases using argumentation. In: Parsons, S., Oren, N., Reed, C., Cerutti, F. (eds.) Computational Models of Argument - Proceedings of COMMA 2014. Frontiers in Artificial Intelligence and Applications, Atholl Palace Hotel, Scottish Highlands, UK, 9\u201312 September 2014, vol. 266, pp. 101\u2013108. IOS Press (2014). https:\/\/doi.org\/10.3233\/978-1-61499-436-7-101","DOI":"10.3233\/978-1-61499-436-7-101"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jcss.2017.03.015","volume":"88","author":"P Barcel\u00f3","year":"2017","unstructured":"Barcel\u00f3, P., Fontaine, G.: On the data complexity of consistent query answering over graph databases. J. Comput. Syst. Sci. 88, 164\u2013194 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/1147376.1147391","volume":"35","author":"LE Bertossi","year":"2006","unstructured":"Bertossi, L.E.: Consistent query answering in databases. SIGMOD Rec. 35(2), 68\u201376 (2006). https:\/\/doi.org\/10.1145\/1147376.1147391","journal-title":"SIGMOD Rec."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Bertossi, L.E.: Database repairs and consistent query answering: origins and further developments. In: Suciu, D., Skritek, S., Koch, C. (eds.) Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, 30 June\u20135 July 2019, pp. 48\u201358. ACM (2019). https:\/\/doi.org\/10.1145\/3294052.3322190","DOI":"10.1145\/3294052.3322190"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Bienvenu, M., Bourgaux, C.: Querying and repairing inconsistent prioritized knowledge bases: complexity analysis and links with abstract argumentation. In: Calvanese, D., Erdem, E., Thielscher, M. (eds.) Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, 12\u201318 September 2020, pp. 141\u2013151 (2020). https:\/\/doi.org\/10.24963\/KR.2020\/15","DOI":"10.24963\/KR.2020\/15"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Bienvenu, M., Bourgaux, C.: Inconsistency handling in prioritized databases with universal constraints: complexity analysis and links with active integrity constraints. In: Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, pp. 97\u2013106 (2023). https:\/\/doi.org\/10.24963\/kr.2023\/10","DOI":"10.24963\/kr.2023\/10"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1613\/jair.1.11395","volume":"64","author":"M Bienvenu","year":"2019","unstructured":"Bienvenu, M., Bourgaux, C., Goasdou\u00e9, F.: Computing and explaining query answers over inconsistent DL-lite knowledge bases. J. Artif. Intell. Res. 64, 563\u2013644 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"ten Cate, B., Fontaine, G., Kolaitis, P.G.: On the data complexity of consistent query answering. In: Proceedings of the 15th International Conference on Database Theory, ICDT 2012, pp. 22\u201333 (2012)","DOI":"10.1145\/2274576.2274580"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197(1), 90\u2013121 (2005). https:\/\/doi.org\/10.1016\/j.ic.2004.04.007. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540105000179","DOI":"10.1016\/j.ic.2004.04.007"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11518655_28","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"S Coste-Marquis","year":"2005","unstructured":"Coste-Marquis, S., Devred, C., Marquis, P.: Symmetric argumentation frameworks. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 317\u2013328. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11518655_28"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-319-25524-8_42","volume-title":"PRIMA 2015: Principles and Practice of Multi-Agent Systems","author":"M Croitoru","year":"2015","unstructured":"Croitoru, M., Thomopoulos, R., Vesic, S.: Introducing preference-based argumentation to inconsistent ontological knowledge bases. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 594\u2013602. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25524-8_42"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-40381-1_2","volume-title":"Scalable Uncertainty Management","author":"M Croitoru","year":"2013","unstructured":"Croitoru, M., Vesic, S.: What can argumentation do for inconsistent ontology query answering? In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS (LNAI), vol. 8078, pp. 15\u201329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40381-1_2"},{"issue":"2","key":"2_CR19","first-page":"321","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. AI 77(2), 321\u2013357 (1995)","journal-title":"AI"},{"issue":"8","key":"2_CR20","first-page":"2557","volume":"4","author":"W Dvor\u00e1k","year":"2017","unstructured":"Dvor\u00e1k, W., Dunne, P.E.: Computational problems in formal argumentation and their complexity. FLAP 4(8), 2557\u20132622 (2017)","journal-title":"FLAP"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Fagin, R., Kimelfeld, B., Kolaitis, P.G.: Dichotomies in the complexity of preferred repairs. In: Milo, T., Calvanese, D. (eds.) Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, 31 May\u20134 June 2015, pp. 3\u201315. ACM (2015). https:\/\/doi.org\/10.1145\/2745754.2745762","DOI":"10.1145\/2745754.2745762"},{"key":"2_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/J.IC.2021.104759","volume":"287","author":"M Hannula","year":"2022","unstructured":"Hannula, M., Hella, L.: Complexity thresholds in inclusion logic. Inf. Comput. 287, 104759 (2022). https:\/\/doi.org\/10.1016\/J.IC.2021.104759","journal-title":"Inf. Comput."},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Hannula, M., Wijsen, J.: A dichotomy in consistent query answering for primary keys and unary foreign keys. In: Libkin, L., Barcel\u00f3, P. (eds.) PODS 2022: International Conference on Management of Data, Philadelphia, PA, USA, 12\u201317 June 2022, pp. 437\u2013449. ACM (2022). https:\/\/doi.org\/10.1145\/3517804.3524157","DOI":"10.1145\/3517804.3524157"},{"issue":"3","key":"2_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.3233\/AIC-220087","volume":"35","author":"L Ho","year":"2022","unstructured":"Ho, L., Arch-Int, S., Acar, E., Schlobach, S., Arch-Int, N.: An argumentative approach for handling inconsistency in prioritized datalog$$\\pm $$ontologies. AI Commun. 35(3), 243\u2013267 (2022). https:\/\/doi.org\/10.3233\/AIC-220087","journal-title":"AI Commun."},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Kimelfeld, B., Livshits, E., Peterfreund, L.: Detecting ambiguity in prioritized database repairing. In: Benedikt, M., Orsi, G. (eds.) 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 68, pp. 17:1\u201317:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2017.17. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7048","DOI":"10.4230\/LIPIcs.ICDT.2017.17"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/J.TCS.2020.05.016","volume":"837","author":"B Kimelfeld","year":"2020","unstructured":"Kimelfeld, B., Livshits, E., Peterfreund, L.: Counting and enumerating preferred database repairs. Theor. Comput. Sci. 837, 115\u2013157 (2020). https:\/\/doi.org\/10.1016\/J.TCS.2020.05.016","journal-title":"Theor. Comput. Sci."},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Livshits, E., Kimelfeld, B., Roy, S.: Computing optimal repairs for functional dependencies. ACM Trans. Database Syst. 45(1), 4:1\u20134:46 (2020). https:\/\/doi.org\/10.1145\/3360904","DOI":"10.1145\/3360904"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11965893_13","volume-title":"Database Theory \u2013 ICDT 2007","author":"A Lopatenko","year":"2006","unstructured":"Lopatenko, A., Bertossi, L.: Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 179\u2013193. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11965893_13"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Mahmood, Y.: Parameterized aspects of team-based formalisms and logical inference (2022). https:\/\/doi.org\/10.15488\/13064. https:\/\/www.tib.eu\/de\/suchen\/id\/base%3Ae4c211ee856f89407f6d9a67b4c100e3fb7eafdd","DOI":"10.15488\/13064"},{"issue":"2\u20133","key":"2_CR30","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/S10472-012-9288-8","volume":"64","author":"S Staworko","year":"2012","unstructured":"Staworko, S., Chomicki, J., Marcinkowski, J.: Prioritized repairing and consistent query answering in relational databases. Ann. Math. Artif. Intell. 64(2\u20133), 209\u2013246 (2012). https:\/\/doi.org\/10.1007\/S10472-012-9288-8","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.IS.2009.03.004","volume":"35","author":"S Staworko","year":"2010","unstructured":"Staworko, S., Chomicki, J.: Consistent query answers in the presence of universal constraints. Inf. Syst. 35(1), 1\u201322 (2010). https:\/\/doi.org\/10.1016\/J.IS.2009.03.004","journal-title":"Inf. Syst."},{"key":"2_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence Logic","author":"J V\u00e4\u00e4n\u00e4nen","year":"2007","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Dependence Logic. Cambridge University Press, Cambridge (2007)"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-36285-1_25","volume-title":"Database Theory \u2014 ICDT 2003","author":"J Wijsen","year":"2003","unstructured":"Wijsen, J.: Condensed representation of database repairs for consistent query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 378\u2013393. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36285-1_25"},{"key":"2_CR34","unstructured":"Young, A.P., Modgil, S., Rodrigues, O.: Prioritised default logic as argumentation with partial order default priorities. CoRR abs\/1609.05224 (2016). http:\/\/arxiv.org\/abs\/1609.05224"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Yun, B., Vesic, S., Croitoru, M.: Sets of attacking arguments for inconsistent datalog knowledge bases. In: Prakken, H., Bistarelli, S., Santini, F., Taticchi, C. (eds.) Computational Models of Argument - Proceedings of COMMA 2020. Frontiers in Artificial Intelligence and Applications, Perugia, Italy, 4\u201311 September 2020, vol. 326, pp. 419\u2013430. IOS Press (2020). https:\/\/doi.org\/10.3233\/FAIA200526","DOI":"10.3233\/FAIA200526"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56940-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T00:02:52Z","timestamp":1711756972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56940-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031569395","9783031569401"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56940-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoIKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations of Information and Knowledge Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sheffield","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"foiks2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/foiks2024.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}