{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:17:33Z","timestamp":1753888653356,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031384981"},{"type":"electronic","value":"9783031384998"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"vor","delay-in-days":244,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the<jats:italic>P<\/jats:italic>-interpolation property for certain local theory extensions, and use these results for proving<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\le $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mo>\u2264<\/mml:mo><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-interpolation in classes of semilattices with monotone operators. For computing the<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\le $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mo>\u2264<\/mml:mo><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-interpolating terms, we use a hierarchic approach. We use these results for the study of<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sqsubseteq $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mo>\u2291<\/mml:mo><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-interpolation in the description logics<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal{E}\\mathcal{L}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>E<\/mml:mi><mml:mi>L<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal{E}\\mathcal{L}^+$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>E<\/mml:mi><mml:msup><mml:mrow><mml:mi>L<\/mml:mi><\/mml:mrow><mml:mo>+<\/mml:mo><\/mml:msup><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/978-3-031-38499-8_24","type":"book-chapter","created":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:03:25Z","timestamp":1693609405000},"page":"419-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On P-Interpolation in\u00a0Local Theory Extensions and\u00a0Applications to\u00a0the\u00a0Study of\u00a0Interpolation in\u00a0the\u00a0Description Logics $$\\mathcal{E}\\mathcal{L}, \\mathcal{E}\\mathcal{L}^+$$"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Peuter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8486-9955","authenticated-orcid":false,"given":"Viorica","family":"Sofronie-Stokkermans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Thunert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"key":"24_CR1","unstructured":"Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 325\u2013330. Morgan Kaufmann (2003)"},{"key":"24_CR2","unstructured":"Baader, F., Lutz, C., Suntisrivaraporn, B.: Efficient reasoning in $$\\cal{EL}^+$$. In: Parsia, B., Sattler, U., Toman, D. (eds.) Proceedings of the 2006 International Workshop on Description Logics (DL 2006), CEUR Workshop Proceedings, vol. 189. CEUR-WS.org (2006)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Lutz, C., Suntisrivaraporn, B.: Is tractable reasoning in extensions of the description logic $${\\cal{EL}}$$ useful in practice? J. Logic Lang. Inf. (2007). Special issue on Method for Modality (M4M)","DOI":"10.1016\/S1570-2464(07)80016-4"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bruttomesso, R., Ghilardi, S., Ranise, S.: Quantifier-free interpolation in combinations of equality interpolating theories. ACM Trans. Comput. Log. 15(1), 5:1\u20135:34 (2014)","DOI":"10.1145\/2490253"},{"key":"24_CR5","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S Burris","year":"1981","unstructured":"Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Graduate Texts in Mathematics, vol. 78. Springer, Heidelberg (1981)"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10817-022-09627-1","volume":"66","author":"D Calvanese","year":"2022","unstructured":"Calvanese, D., Ghilardi, S., Gianola, A., Montali, M., Rivkin, A.: Combination of uniform interpolants via Beth definability. J. Autom. Reason. 66(3), 409\u2013435 (2022)","journal-title":"J. Autom. Reason."},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Fortin, M., Konev, B., Wolter, F.: Interpolants and explicit definitions in extensions of the description logic $${\\cal{EL}}$$. In: Kern-Isberner, G., Lakemeyer, G., Meyer, T. (eds.) Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022 (2022)","DOI":"10.24963\/kr.2022\/16"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Ganzinger, H.: Relating semantic and proof-theoretic concepts for polynominal time decidability of uniform word problems. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, Boston, Massachusetts, USA, 16\u201319 June 2001, pp. 81\u201390. IEEE Computer Society (2001)","DOI":"10.1109\/LICS.2001.932485"},{"key":"24_CR10","unstructured":"Hodges, W.: Model Theory. Encyclopedia of Mathematics and Its Applications, vol. 42. Cambridge University Press (1993)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-78800-3_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Ihlemann","year":"2008","unstructured":"Ihlemann, C., Jacobs, S., Sofronie-Stokkermans, V.: On local reasoning in verification. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 265\u2013281. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_19"},{"key":"24_CR12","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-14203-1_4","volume-title":"Automated Reasoning","author":"C Ihlemann","year":"2010","unstructured":"Ihlemann, C., Sofronie-Stokkermans, V.: On hierarchical reasoning in combinations of theories. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS (LNAI), vol. 6173, pp. 30\u201345. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14203-1_4"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-02959-2_17","volume-title":"Automated Deduction \u2013 CADE-22","author":"L Kov\u00e1cs","year":"2009","unstructured":"Kov\u00e1cs, L., Voronkov, A.: Interpolation and symbol elimination. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 199\u2013213. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_17"},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2275541","volume":"62","author":"J Kraj\u00edcek","year":"1997","unstructured":"Kraj\u00edcek, J.: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symb. Log. 62(2), 457\u2013486 (1997)","journal-title":"J. Symb. Log."},{"issue":"2","key":"24_CR15","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/151261.151265","volume":"40","author":"DA McAllester","year":"1993","unstructured":"McAllester, D.A.: Automatic recognition of tractability in inference relations. J. ACM 40(2), 284\u2013303 (1993)","journal-title":"J. ACM"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-24730-2_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"KL McMillan","year":"2004","unstructured":"McMillan, K.L.: An interpolating theorem prover. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 16\u201330. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_2"},{"key":"24_CR17","unstructured":"Peuter, D., Sofronie-Stokkermans, V.: Finding high-level explanations for subsumption w.r.t. combinations of CBoxes in $${\\cal{EL}}$$ and $${\\cal{EL}}^+$$. In: Borgwardt, S., Meyer, T. (eds.) Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), CEUR Workshop Proceedings, vol. 2663. CEUR-WS.org (2020)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Peuter, D., Sofronie-Stokkermans, V., Thunert, S.: On $$P$$-interpolation in local theory extensions and applications to the study of interpolation in the description logics $${\\cal{E} }{\\cal{L} }, {\\cal{E} }{\\cal{L} }^+$$. (Extended version) CoRR, https:\/\/arxiv.org\/abs\/2307.08843 (2023)","DOI":"10.1007\/978-3-031-38499-8_24"},{"issue":"11","key":"24_CR19","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.jsc.2010.06.005","volume":"45","author":"A Rybalchenko","year":"2010","unstructured":"Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint solving for interpolation. J. Symb. Comput. 45(11), 1212\u20131233 (2010)","journal-title":"J. Symb. Comput."},{"key":"24_CR20","unstructured":"Skolem, T.: Logisch-kombinatorische Untersuchungen \u00fcber die Erf\u00fcllbarkeit oder Beweisbarkeit mathematischer S\u00e4tze nebst einem Theorem \u00fcber dichte Mengen. In: Selected Works in Logic. Universitetsforlaget (1920)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/11532231_16","volume-title":"Automated Deduction \u2013 CADE-20","author":"V Sofronie-Stokkermans","year":"2005","unstructured":"Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219\u2013234. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11532231_16"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11814771_21","volume-title":"Automated Reasoning","author":"V Sofronie-Stokkermans","year":"2006","unstructured":"Sofronie-Stokkermans, V.: Interpolation in local theory extensions. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 235\u2013250. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_21"},{"issue":"1\u20134","key":"24_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10472-007-9051-8","volume":"49","author":"V Sofronie-Stokkermans","year":"2007","unstructured":"Sofronie-Stokkermans, V.: Automated theorem proving by resolution in non-classical logics. Ann. Math. Artif. Intell. 49(1\u20134), 221\u2013252 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Sofronie-Stokkermans, V.: Interpolation in local theory extensions. Log. Methods Comput. Sci. 4(4) (2008)","DOI":"10.2168\/LMCS-4(4:1)2008"},{"key":"24_CR25","unstructured":"Sofronie-Stokkermans, V.: Locality and subsumption testing in $$\\cal{EL}$$ and some of its extensions. In: Areces, C., Goldblatt, R. (eds.) Advances in Modal Logic, vol. 7, pp. 315\u2013339. College Publications (2008)"},{"issue":"3\u20134","key":"24_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.3233\/FI-2017-1612","volume":"156","author":"V Sofronie-Stokkermans","year":"2017","unstructured":"Sofronie-Stokkermans, V.: Representation theorems and locality for subsumption testing and interpolation in the description logics $$\\cal{EL}$$, $$\\cal{EL}^+$$ and their extensions with $$n$$-ary roles and numerical domains. Fundam. Inform. 156(3\u20134), 361\u2013411 (2017)","journal-title":"Fundam. Inform."},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Sofronie-Stokkermans, V., Ihlemann, C.: Automated reasoning in some local extensions of ordered structures. In: 37th International Symposium on Multiple-Valued Logic, ISMVL 2007, p. 1. IEEE Computer Society (2007)","DOI":"10.1109\/ISMVL.2007.10"},{"issue":"4\u20136","key":"24_CR28","first-page":"397","volume":"13","author":"V Sofronie-Stokkermans","year":"2007","unstructured":"Sofronie-Stokkermans, V., Ihlemann, C.: Automated reasoning in some local extensions of ordered structures. Multiple-Valued Logic Soft Comput. 13(4\u20136), 397\u2013414 (2007)","journal-title":"Multiple-Valued Logic Soft Comput."},{"key":"24_CR29","unstructured":"Spackman, K.A.: Normal forms for description logic expressions of clinical concepts in SNOMED RT. In: American Medical Informatics Association Annual Symposium, AMIA 2001. AMIA (2001)"},{"key":"24_CR30","unstructured":"Spackman, K.A., Campbell, K.E., C\u00f4t\u00e9, R.A.: SNOMED RT: a reference terminology for health care. In: American Medical Informatics Association Annual Symposium, AMIA 1997. AMIA (1997)"},{"key":"24_CR31","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1613\/jair.4057","volume":"48","author":"B ten Cate","year":"2013","unstructured":"ten Cate, B., Franconi, E., Seylan, I.: Beth definability in expressive description logics. J. Artif. Intell. Res. 48, 347\u2013414 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"24_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022587501759","volume":"30","author":"C Tinelli","year":"2003","unstructured":"Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing. J. Autom. Reason. 30(1), 1\u201331 (2003)","journal-title":"J. Autom. Reason."},{"key":"24_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02959-2_10","volume-title":"Automated Deduction \u2013 CADE-22","author":"C Weidenbach","year":"2009","unstructured":"Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 140\u2013145. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_10"},{"key":"24_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/11532231_26","volume-title":"Automated Deduction \u2013 CADE-20","author":"G Yorsh","year":"2005","unstructured":"Yorsh, G., Musuvathi, M.: A combination method for generating interpolants. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 353\u2013368. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11532231_26"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 29"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38499-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T10:36:06Z","timestamp":1730025366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38499-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031384981","9783031384998"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38499-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"1 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/cade2023\/","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":"77","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":"28","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":"5","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":"36% - 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":"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)"}}]}}