{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:25:04Z","timestamp":1772205904831,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031107689","type":"print"},{"value":"9783031107696","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":212,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Abduction in description logics finds extensions of a knowledge base to make it entail an observation. As such, it can be used to explain why the observation does not follow, to repair incomplete knowledge bases, and to provide possible explanations for unexpected observations. We consider TBox abduction in the lightweight description logic <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal {EL}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                    <mml:mi>EL<\/mml:mi>\n                  <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where the observation is a concept inclusion and the background knowledge is a TBox, i.e., a set of concept inclusions. To avoid useless answers, such problems usually come with further restrictions on the solution space and\/or minimality criteria that help sort the chaff from the grain. We argue that existing minimality notions are insufficient, and introduce connection minimality. This criterion follows Occam\u2019s razor by rejecting hypotheses that use concept inclusions unrelated to the problem at hand. We show how to compute a special class of connection-minimal hypotheses in a sound and complete way. Our technique is based on a translation to first-order logic, and constructs hypotheses based on prime implicates. We evaluate a prototype implementation of our approach on ontologies from the medical domain.<\/jats:p>","DOI":"10.1007\/978-3-031-10769-6_12","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:02:56Z","timestamp":1659315776000},"page":"188-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Connection-Minimal Abduction in\u00a0$$\\mathcal {EL}$$ via\u00a0Translation to\u00a0FOL"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5139-4503","authenticated-orcid":false,"given":"Fajar","family":"Haifani","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-0002-6070-796X","authenticated-orcid":false,"given":"Sophie","family":"Tourret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6002-0458","authenticated-orcid":false,"given":"Christoph","family":"Weidenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, 30 July - 5 August 2005, pp. 364\u2013369. Professional Book Center (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0372.pdf","DOI":"10.25368\/2022.144"},{"key":"12_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355","volume-title":"An Introduction to Description Logic","author":"F Baader","year":"2017","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017). https:\/\/doi.org\/10.1017\/9781139025355"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., K\u00fcsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proceedings of IJCAI 1999, pp. 96\u2013103. Morgan Kaufmann (1999)","DOI":"10.25368\/2022.85"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/b978-044450813-3\/50004-7","volume-title":"Handbook of Automated Reasoning (in 2 volumes)","author":"L Bachmair","year":"2001","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning (in 2 volumes), pp. 19\u201399. Elsevier and MIT Press, Cambridge (2001). https:\/\/doi.org\/10.1016\/b978-044450813-3\/50004-7"},{"key":"12_CR5","unstructured":"Bauer, J., Sattler, U., Parsia, B.: Explaining by example: model exploration for ontology comprehension. In: Grau, B.C., Horrocks, I., Motik, B., Sattler, U. (eds.) Proceedings of the 22nd International Workshop on Description Logics (DL 2009), Oxford, UK, 27\u201330 July 2009. CEUR Workshop Proceedings, vol. 477. CEUR-WS.org (2009). http:\/\/ceur-ws.org\/Vol-477\/paper_37.pdf"},{"key":"12_CR6","unstructured":"Bienvenu, M.: Complexity of abduction in the $$\\cal{EL}$$ family of lightweight description logics. In: Proceedings of KR 2008, pp. 220\u2013230. AAAI Press (2008), http:\/\/www.aaai.org\/Library\/KR\/2008\/kr08-022.php"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1613\/jair.3870","volume":"48","author":"D Calvanese","year":"2013","unstructured":"Calvanese, D., Ortiz, M., Simkus, M., Stefanoni, G.: Reasoning about explanations for negative query answers in DL-Lite. J. Artif. Intell. Res. 48, 635\u2013669 (2013). https:\/\/doi.org\/10.1613\/jair.3870","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Ceylan, \u0130.\u0130., Lukasiewicz, T., Malizia, E., Molinaro, C., Vaicenavicius, A.: Explanations for negative query answers under existential rules. In: Calvanese, D., Erdem, E., Thielscher, M. (eds.) Proceedings of KR 2020, pp. 223\u2013232. AAAI Press (2020). https:\/\/doi.org\/10.24963\/kr.2020\/23","DOI":"10.24963\/kr.2020\/23"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Del-Pinto, W., Schmidt, R.A.: ABox abduction via forgetting in $$\\cal{ALC}$$. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 2768\u20132775. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33012768","DOI":"10.1609\/aaai.v33i01.33012768"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2012040101","volume":"8","author":"J Du","year":"2012","unstructured":"Du, J., Qi, G., Shen, Y., Pan, J.Z.: Towards practical ABox abduction in large description logic ontologies. Int. J. Semantic Web Inf. Syst. 8(2), 1\u201333 (2012). https:\/\/doi.org\/10.4018\/jswis.2012040101","journal-title":"Int. J. Semantic Web Inf. Syst."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Du, J., Wan, H., Ma, H.: Practical TBox abduction based on justification patterns. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 1100\u20131106 (2017). http:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/14402","DOI":"10.1609\/aaai.v31i1.10683"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Du, J., Wang, K., Shen, Y.: A tractable approach to ABox abduction over description logic ontologies. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 1034\u20131040. AAAI Press (2014). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8191","DOI":"10.1609\/aaai.v28i1.8852"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-94205-6_19","volume-title":"Automated Reasoning","author":"M Echenim","year":"2018","unstructured":"Echenim, M., Peltier, N., Sellami, Y.: A generic framework for implicate generation modulo theories. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 279\u2013294. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_19"},{"key":"12_CR14","unstructured":"Elsenbroich, C., Kutz, O., Sattler, U.: A case for abductive reasoning over ontologies. In: Proceedings of the OWLED\u201906 Workshop on OWL: Experiences and Directions (2006). http:\/\/ceur-ws.org\/Vol-216\/submission_25.pdf"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1613\/jair.2375","volume":"31","author":"BC Grau","year":"2008","unstructured":"Grau, B.C., Horrocks, I., Kazakov, Y., Sattler, U.: Modular reuse of ontologies: theory and practice. J. Artif. Intell. Res. 31, 273\u2013318 (2008). https:\/\/doi.org\/10.1613\/jair.2375","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Haifani, F., Koopmann, P., Tourret, S., Weidenbach, C.: Connection-minimal abduction in $$\\cal{EL}$$ via translation to FOL - technical report (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.08449, https:\/\/arxiv.org\/abs\/2205.08449","DOI":"10.48550\/ARXIV.2205.08449"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Haifani, F., Koopmann, P., Tourret, S., Weidenbach, C.: Experiment data for the paper Connection-minimal Abduction in EL via translation to FOL, May 2022. https:\/\/doi.org\/10.5281\/zenodo.6563656","DOI":"10.5281\/zenodo.6563656"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-030-79876-5_19","volume-title":"Automated Deduction \u2013 CADE 28","author":"F Haifani","year":"2021","unstructured":"Haifani, F., Tourret, S., Weidenbach, C.: Generalized completeness for SOS resolution and its application to a new notion of relevance. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 327\u2013343. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_19"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Halland, K., Britz, K.: ABox abduction in $$\\cal{ALC}$$ using a DL tableau. In: 2012 South African Institute of Computer Scientists and Information Technologists Conference, SAICSIT \u201912, pp. 51\u201358 (2012). https:\/\/doi.org\/10.1145\/2389836.2389843","DOI":"10.1145\/2389836.2389843"},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3233\/SW-2011-0025","volume":"2","author":"M Horridge","year":"2011","unstructured":"Horridge, M., Bechhofer, S.: The OWL API: a java API for OWL ontologies. Semant. Web 2(1), 11\u201321 (2011). https:\/\/doi.org\/10.3233\/SW-2011-0025","journal-title":"Semant. Web"},{"key":"12_CR21","unstructured":"Horridge, M., Parsia, B., Sattler, U.: Explanation of OWL entailments in protege 4. In: Bizer, C., Joshi, A. (eds.) Proceedings of the Poster and Demonstration Session at the 7th International Semantic Web Conference (ISWC2008), Karlsruhe, Germany, 28 October 2008. CEUR Workshop Proceedings, vol. 401. CEUR-WS.org (2008). http:\/\/ceur-ws.org\/Vol-401\/iswc2008pd_submission_47.pdf"},{"key":"12_CR22","unstructured":"Kazakov, Y., Klinov, P., Stupnikov, A.: Towards reusable explanation services in protege. In: Artale, A., Glimm, B., Kontchakov, R. (eds.) Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, 18\u201321 July 2017. CEUR Workshop Proceedings, vol. 1879. CEUR-WS.org (2017). http:\/\/ceur-ws.org\/Vol-1879\/paper31.pdf"},{"issue":"1","key":"12_CR23","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."},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10817-010-9168-z","volume":"46","author":"S Klarman","year":"2011","unstructured":"Klarman, S., Endriss, U., Schlobach, S.: ABox abduction in the description logic $$\\cal{ALC}$$. J. Autom. Reason. 46(1), 43\u201380 (2011). https:\/\/doi.org\/10.1007\/s10817-010-9168-z","journal-title":"J. Autom. Reason."},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Koopmann, P.: Signature-based abduction with fresh individuals and complex concepts for description logics. In: Zhou, Z. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event\/Montreal, Canada, 19\u201327 August 2021, pp. 1929\u20131935 (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/266","DOI":"10.24963\/ijcai.2021\/266"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Koopmann, P., Del-Pinto, W., Tourret, S., Schmidt, R.A.: Signature-based abduction for expressive description logics. In: Calvanese, D., Erdem, E., Thielscher, M. (eds.) Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, pp. 592\u2013602. AAAI Press (2020). https:\/\/doi.org\/10.24963\/kr.2020\/59","DOI":"10.24963\/kr.2020\/59"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Matentzoglu, N., Parsia, B.: Bioportal snapshot 30.03.2017 (2017). https:\/\/doi.org\/10.5281\/zenodo.439510","DOI":"10.5281\/zenodo.439510"},{"issue":"2\u20133","key":"12_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3233\/AIC-2010-0465","volume":"23","author":"H Nabeshima","year":"2010","unstructured":"Nabeshima, H., Iwanuma, K., Inoue, K., Ray, O.: SOLAR: an automated deduction system for consequence finding. AI Commun. 23(2\u20133), 183\u2013203 (2010). https:\/\/doi.org\/10.3233\/AIC-2010-0465","journal-title":"AI Commun."},{"issue":"4","key":"12_CR29","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":"12_CR30","unstructured":"Pukancov\u00e1, J., Homola, M.: Tableau-based ABox abduction for the $$\\cal{ALCHO}$$ description logic. In: Proceedings of the 30th International Workshop on Description Logics (2017). http:\/\/ceur-ws.org\/Vol-1879\/paper11.pdf"},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s13218-020-00685-4","volume":"34","author":"J Pukancov\u00e1","year":"2020","unstructured":"Pukancov\u00e1, J., Homola, M.: The AAA Abox abduction solver. KI - K\u00fcnstliche Intell. 34(4), 517\u2013522 (2020). https:\/\/doi.org\/10.1007\/s13218-020-00685-4","journal-title":"KI - K\u00fcnstliche Intell."},{"key":"12_CR32","unstructured":"Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 355\u2013362. Morgan Kaufmann, Acapulco, Mexico (2003). http:\/\/ijcai.org\/Proceedings\/03\/Papers\/053.pdf"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Wei-Kleiner, F., Dragisic, Z., Lambrix, P.: Abduction framework for repairing incomplete $$\\cal{EL}$$ ontologies: complexity results and algorithms. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 1120\u20131127. AAAI Press (2014). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8239","DOI":"10.1609\/aaai.v28i1.8858"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-540-73595-3_38","volume-title":"Automated Deduction \u2013 CADE-21","author":"C Weidenbach","year":"2007","unstructured":"Weidenbach, C., Schmidt, R.A., Hillenbrand, T., Rusev, R., Topic, D.: System description: Spass version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 514\u2013520. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73595-3_38"},{"issue":"4","key":"12_CR35","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1145\/321296.321302","volume":"12","author":"L Wos","year":"1965","unstructured":"Wos, L., Robinson, G., Carson, D.: Efficiency and completeness of the set of support strategy in theorem proving. J. ACM 12(4), 536\u2013541 (1965)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10769-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:13:32Z","timestamp":1659316412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10769-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107689","9783031107696"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10769-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/FLoC2022\/IJCAR-index.html","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":"85","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":"32","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":"9","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":"38% - 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.2","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":"5.2","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)"}}]}}