{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:52:18Z","timestamp":1773939138348,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031436185","type":"print"},{"value":"9783031436192","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43619-2_2","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"11-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Repairs in\u00a0the\u00a0Description Logic $$\\mathcal{E}\\mathcal{L}$$ Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4049-221X","authenticated-orcid":false,"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5999-2583","authenticated-orcid":false,"given":"Patrick","family":"Koopmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0219-0330","authenticated-orcid":false,"given":"Francesco","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Baader, F.: Optimal repairs in ontology engineering as pseudo-contractions in belief change. In: Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing (SAC 2023), Tallinn, Estonia, 27\u201331 March 2023, pp. 983\u2013990. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3555776.3577719","DOI":"10.1145\/3555776.3577719"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-31365-3_5","volume-title":"Automated Reasoning","author":"F Baader","year":"2012","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: SAT encoding of unification in $$\\cal{ELH}_{{R}^+}$$ w.r.t. cycle-restricted ontologies. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 30\u201344. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_5"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL} $$ envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI 2005, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, 30 July\u20135 August 2005, pp. 364\u2013369. Professional Book Center (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0372.pdf","DOI":"10.25368\/2022.144"},{"key":"2_CR4","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press (2017). https:\/\/doi.org\/10.1017\/9781139025355","DOI":"10.1017\/9781139025355"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Baader, F., Koopmann, P., Kriegel, F.: Optimal repairs in the description logic $$\\cal{EL} $$ revisited (extended version). LTCS-Report 23-03, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2023). https:\/\/doi.org\/10.25368\/2023.121","DOI":"10.25368\/2023.121"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-79876-5_18","volume-title":"Automated Deduction \u2013 CADE 28","author":"F Baader","year":"2021","unstructured":"Baader, F., Koopmann, P., Kriegel, F., Nuradiansyah, A.: Computing optimal repairs of quantified\u00a0ABoxes w.r.t. static $$\\cal{EL}$$ TBoxes. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 309\u2013326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_18"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Baader, F., Koopmann, P., Kriegel, F., Nuradiansyah, A.: Computing optimal repairs of quantified ABoxes w.r.t. static $$\\cal{EL} $$ TBoxes (extended version). LTCS-Report 21-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2021). https:\/\/doi.org\/10.25368\/2022.64","DOI":"10.25368\/2022.64"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-031-06981-9_8","volume-title":"The Semantic Web","author":"F Baader","year":"2022","unstructured":"Baader, F., Koopmann, P., Kriegel, F., Nuradiansyah, A.: Optimal ABox repair w.r.t. static $$\\cal{EL} $$ TBoxes: from quantified ABoxes back to ABoxes. In: Groth, P., et al. (eds.) ESWC 2022. LNCS, vol. 13261, pp. 130\u2013146. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06981-9_8"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Baader, F., Koopmann, P., Kriegel, F., Nuradiansyah, A.: Optimal ABox repair w.r.t. static $$\\cal{EL} $$ TBoxes: from quantified ABoxes back to ABoxes (extended version). LTCS-Report 22-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2022). https:\/\/doi.org\/10.25368\/2022.65","DOI":"10.25368\/2022.65"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Baader, F., Kriegel, F.: Pushing optimal ABox repair from $$\\cal{EL} $$ towards more expressive Horn-DLs. In: Kern-Isberner, G., Lakemeyer, G., Meyer, T. (eds.) Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, Haifa, Israel, 31 July\u20135 August 2022, pp. 22\u201332 (2022). https:\/\/doi.org\/10.24963\/kr.2022\/3","DOI":"10.24963\/kr.2022\/3"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-19570-0_21","volume-title":"Logics in Artificial Intelligence","author":"F Baader","year":"2019","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A.: Privacy-preserving ontology publishing for $$\\cal{EL} $$ instance stores. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 323\u2013338. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_21"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-031-21541-4_15","volume-title":"Rules and Reasoning","author":"F Baader","year":"2022","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A.: Error-tolerant reasoning in the description logic $$\\cal{EL} $$ based on optimal repairs. In: Governatori, G., Turhan, A. (eds.) RuleML+RR 2022. LNCS, vol. 13752, pp. 227\u2013243. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21541-4_15"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A.: Treating role assertions as first-class citizens in repair and error-tolerant reasoning. In: Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing (SAC 2023), Tallinn, Estonia, 27\u201331 March 2023, pp. 974\u2013982. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3555776.3577630","DOI":"10.1145\/3555776.3577630"},{"key":"2_CR15","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Making repairs in description logics more gentle. In: Thielscher, M., Toni, F., Wolter, F. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October\u20132 November 2018, pp. 319\u2013328. AAAI Press (2018). https:\/\/aaai.org\/ocs\/index.php\/KR\/KR18\/paper\/view\/18056"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-62419-4_1","volume-title":"The Semantic Web \u2013 ISWC 2020","author":"F Baader","year":"2020","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Computing compliant anonymisations of quantified ABoxes w.r.t. $$\\cal{EL} $$ policies. In: Pan, J.Z., et al. (eds.) ISWC 2020. LNCS, vol. 12506, pp. 3\u201320. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62419-4_1"},{"key":"2_CR17","unstructured":"Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT using axiom pinpointing in the description logic $$\\cal{EL} ^+$$. In: Cornet, R., Spackman, K.A. (eds.) Proceedings of the Third International Conference on Knowledge Representation in Medicine, Phoenix, Arizona, USA, 31st May\u20132nd June 2008. CEUR Workshop Proceedings, vol. 410. CEUR-WS.org (2008). http:\/\/ceur-ws.org\/Vol-410\/Paper01.pdf"},{"issue":"10","key":"2_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/MC.1983.1654200","volume":"16","author":"RJ Brachman","year":"1983","unstructured":"Brachman, R.J., Fikes, R., Levesque, H.J.: Krypton: a functional approach to knowledge representation. Computer 16(10), 67\u201373 (1983). https:\/\/doi.org\/10.1109\/MC.1983.1654200","journal-title":"Computer"},{"key":"2_CR19","first-page":"231","volume-title":"Logic Programming","author":"A Colmerauer","year":"1982","unstructured":"Colmerauer, A.: Prolog and infinite trees. In: Clark, K., Tarnlund, S.A. (eds.) Logic Programming, pp. 231\u2013251. Academic Press, New York (1982)"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.1.11355","volume":"64","author":"B Cuenca Grau","year":"2019","unstructured":"Cuenca Grau, B., Kostylev, E.V.: Logical foundations of linked data anonymisation. J. Artif. Intell. Res. 64, 253\u2013314 (2019). https:\/\/doi.org\/10.1613\/jair.1.11355","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Du, J., Qi, G., Fu, X.: A practical fine-grained approach to resolving incoherent OWL 2 DL terminologies. In: Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (CIKM 2014), pp. 919\u2013928 (2014). http:\/\/doi.acm.org\/10.1145\/2661829.2662046","DOI":"10.1145\/2661829.2662046"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0004-3702(89)90079-9","volume":"41","author":"R Greiner","year":"1989","unstructured":"Greiner, R., Smith, B.A., Wilkerson, R.W.: A correction to the algorithm in Reiter\u2019s theory of diagnosis. Artif. Intell. 41(1), 79\u201388 (1989). https:\/\/doi.org\/10.1016\/0004-3702(89)90079-9","journal-title":"Artif. Intell."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-88564-1_21","volume-title":"The Semantic Web - ISWC 2008","author":"M Horridge","year":"2008","unstructured":"Horridge, M., Parsia, B., Sattler, U.: Laconic and precise justifications in OWL. In: Sheth, A., et al. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 323\u2013338. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88564-1_21"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-013-9296-3","volume":"53","author":"Y Kazakov","year":"2014","unstructured":"Kazakov, Y., Kr\u00f6tzsch, M., Simancik, F.: The incredible ELK - from polynomial procedures to efficient reasoning with $$\\cal{EL} $$ ontologies. J. Autom. Reason. 53(1), 1\u201361 (2014). https:\/\/doi.org\/10.1007\/s10817-013-9296-3","journal-title":"J. Autom. Reason."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-031-15791-2_11","volume-title":"Advances in Artificial Intelligence","author":"F Kriegel","year":"2022","unstructured":"Kriegel, F.: Optimal fixed-premise repairs of $$\\cal{EL} $$ TBoxes. In: Bergmann, R., Malburg, L., Rodermund, S.C., Timm, I.J. (eds.) KI 2022. LNCS, vol. 13404, pp. 115\u2013130. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15791-2_11"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-77688-8_3","volume":"10","author":"JSC Lam","year":"2008","unstructured":"Lam, J.S.C., Sleeman, D.H., Pan, J.Z., Vasconcelos, W.W.: A fine-grained approach to resolving unsatisfiable ontologies. J. Data Semant. 10, 62\u201395 (2008). https:\/\/doi.org\/10.1007\/978-3-540-77688-8_3","journal-title":"J. Data Semant."},{"issue":"2","key":"2_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(84)90009-2","volume":"23","author":"HJ Levesque","year":"1984","unstructured":"Levesque, H.J.: Foundations of a functional approach to knowledge representation. Artif. Intell. 23(2), 155\u2013212 (1984). https:\/\/doi.org\/10.1016\/0004-3702(84)90009-2","journal-title":"Artif. Intell."},{"issue":"2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jsc.2008.10.007","volume":"45","author":"C Lutz","year":"2010","unstructured":"Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic $$\\cal{EL} $$. J. Symb. Comput. 45(2), 194\u2013228 (2010). https:\/\/doi.org\/10.1016\/j.jsc.2008.10.007","journal-title":"J. Symb. Comput."},{"key":"2_CR29","unstructured":"Ortiz, M., Rudolph, S., \u0160imkus, M.: Worst-case optimal reasoning for the Horn-DL fragments of OWL 1 and 2. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010 (2010). http:\/\/aaai.org\/ocs\/index.php\/KR\/KR2010\/paper\/view\/1296"},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10817-017-9406-8","volume":"59","author":"B Parsia","year":"2017","unstructured":"Parsia, B., Matentzoglu, N., Gon\u00e7alves, R.S., Glimm, B., Steigmiller, A.: The OWL reasoner evaluation (ORE) 2015 competition report. J. Autom. Reason. 59(4), 455\u2013482 (2017). https:\/\/doi.org\/10.1007\/s10817-017-9406-8","journal-title":"J. Autom. Reason."},{"key":"2_CR31","unstructured":"Parsia, B., Rudolph, S., Hitzler, P., Kr\u00f6tzsch, M., Patel-Schneider, P.: OWL 2 web ontology language primer (second edition). W3C recommendation (2012). http:\/\/www.w3.org\/TR\/2012\/REC-owl2-primer-20121211\/"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Ellis, A., Hagino, T. (eds.) Proceedings of the 14th International Conference on World Wide Web, WWW 2005, Chiba, Japan, 10\u201314 May 2005, pp. 633\u2013640. ACM (2005). https:\/\/doi.org\/10.1145\/1060745.1060837","DOI":"10.1145\/1060745.1060837"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57\u201395 (1987). https:\/\/doi.org\/10.1016\/0004-3702(87)90062-2. See the erratum [22]","DOI":"10.1016\/0004-3702(87)90062-2"},{"issue":"3","key":"2_CR34","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10817-007-9076-z","volume":"39","author":"S Schlobach","year":"2007","unstructured":"Schlobach, S., Huang, Z., Cornet, R., van Harmelen, F.: Debugging incoherent terminologies. J. Autom. Reason. 39(3), 317\u2013349 (2007). https:\/\/doi.org\/10.1007\/s10817-007-9076-z","journal-title":"J. Autom. Reason."},{"key":"2_CR35","unstructured":"Troquard, N., Confalonieri, R., Galliani, P., Pe\u00f1aloza, R., Porello, D., Kutz, O.: Repairing ontologies via axiom weakening. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI 2018), The 30th Innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI 2018), New Orleans, Louisiana, USA, 2\u20137 February 2018, pp. 1981\u20131988. AAAI Press (2018). https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/17189"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43619-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:03:22Z","timestamp":1695481402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","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":"111","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":"41","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":"11","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":"37% - 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,6","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)"}}]}}