{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:43:25Z","timestamp":1742928205225,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031308253"},{"type":"electronic","value":"9783031308260"}],"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,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"vor","delay-in-days":109,"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>Knowledge bases have been extensively used to represent and reason about <jats:italic>static<\/jats:italic> domain knowledge. In this work, we show how to enforce domain knowledge about <jats:italic>dynamic processes<\/jats:italic> to guide executions at runtime. To do so, we map the execution trace to a knowledge base and require that this mapped knowledge base is always consistent with the domain knowledge. This means that we treat the <jats:italic>consistency<\/jats:italic> with domain knowledge as an invariant of the execution trace. This way, the domain knowledge guides the execution by determining the next possible steps, i.e., by exploring which steps are possible and rejecting those resulting in an inconsistent knowledge base. Using this invariant directly at runtime can be computationally heavy, as it requires to check the consistency of a large logical theory. Thus, we provide a transformation that generates a system which is able to perform the check only on the <jats:italic>past<\/jats:italic> events up to now, by evaluating a smaller formula. This transformation is transparent to domain users, who can interact with the transformed system in terms of the domain knowledge, e.g., to query computation results. Furthermore, we discuss different mapping strategies.<\/jats:p>","DOI":"10.1007\/978-3-031-30826-0_12","type":"book-chapter","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T18:02:59Z","timestamp":1681927379000},"page":"220-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Runtime Enforcement Using Knowledge Bases"],"prefix":"10.1007","author":[{"given":"Eduard","family":"Kamburjan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Crystal Chang","family":"Din","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"N.\u00a0Al Haider, B.\u00a0Gaudin, and J.\u00a0Murphy. Execution trace exploration and analysis using ontologies. In RV, volume 7186 of LNCS, pages 412\u2013426. Springer, 2011.","DOI":"10.1007\/978-3-642-29860-8_33"},{"key":"12_CR2","unstructured":"Apache Foundation. Apache jena. https:\/\/jena.apache.org\/."},{"key":"12_CR3","unstructured":"F.\u00a0Baader, D.\u00a0Calvanese, D.\u00a0L. McGuinness, D.\u00a0Nardi, and P.\u00a0F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"F.\u00a0Baader, S.\u00a0Ghilardi, and C.\u00a0Lutz. LTL over description logic axioms. ACM Trans. Comput. Log., 13(3):21:1\u201321:32, 2012.","DOI":"10.1145\/2287718.2287721"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"F.\u00a0Baader and B.\u00a0Hollunder. Embedding defaults into terminological knowledge representation formalisms. J. Autom. Reason., 14(1):149\u2013180, 1995.","DOI":"10.1007\/BF00883932"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"F.\u00a0Baader and M.\u00a0Lippmann. Runtime verification using the temporal description logic ALC-LTL revisited. J. Appl. Log., 12(4):584\u2013613, 2014.","DOI":"10.1016\/j.jal.2014.09.001"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"S.\u00a0Baset and K.\u00a0Stoffel. Object-oriented modeling with ontologies around: A survey of existing approaches. Int. J. Softw. Eng. Knowl. Eng., 28(11-12):1775\u20131794, 2018.","DOI":"10.1142\/S0218194018400284"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"B.\u00a0Beckert and D.\u00a0Bruns. Dynamic logic with trace semantics. In CADE, volume 7898 of LNCS, pages 315\u2013329. Springer, 2013.","DOI":"10.1007\/978-3-642-38574-2_22"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"S.\u00a0Brandt, E.\u00a0G. Kalayci, R.\u00a0Kontchakov, V.\u00a0Ryzhikov, G.\u00a0Xiao, and M.\u00a0Zakharyaschev. Ontology-based data access with a horn fragment of metric temporal logic. In AAAI, pages 1070\u20131076. AAAI Press, 2017.","DOI":"10.1609\/aaai.v31i1.10696"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"S.\u00a0Brandt, E.\u00a0G. Kalayci, V.\u00a0Ryzhikov, G.\u00a0Xiao, and M.\u00a0Zakharyaschev. Querying log data with metric temporal logic. J. Artif. Intell. Res., 62:829\u2013877, 2018.","DOI":"10.1613\/jair.1.11229"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bubel, C.\u00a0C. Din, R.\u00a0H\u00e4hnle, and K.\u00a0Nakata. A dynamic logic with traces and coinduction. In TABLEAUX, volume 9323 of LNCS, pages 307\u2013322. Springer, 2015.","DOI":"10.1007\/978-3-319-24312-2_21"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"C.\u00a0Cauli, M.\u00a0Li, N.\u00a0Piterman, and O.\u00a0Tkachuk. Pre-deployment security assessment for cloud services through semantic reasoning. In CAV (1), volume 12759 of LNCS, pages 767\u2013780. Springer, 2021.","DOI":"10.1007\/978-3-030-81685-8_36"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"K.\u00a0L. Clark and F.\u00a0G. McCabe. Ontology oriented programming in go! Appl. Intell., 24(3):189\u2013204, 2006.","DOI":"10.1007\/s10489-006-8511-x"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"M.\u00a0Clavel, F.\u00a0Dur\u00e1n, S.\u00a0Eker, P.\u00a0Lincoln, N.\u00a0Mart\u00ed-Oliet, J.\u00a0Meseguer, and C.\u00a0L. Talcott. Reflection, metalevel computation, and strategies. In All About Maude, volume 4350 of LNCS, pages 419\u2013458. Springer, 2007.","DOI":"10.1007\/978-3-540-71999-1_14"},{"key":"12_CR15","unstructured":"C.\u00a0Corea and P.\u00a0Delfmann. Detecting compliance with business rules in ontology-based process modeling. In J.\u00a0M. Leimeister and W.\u00a0Brenner, editors, Towards Thought Leadership in Digital Transformation: 13. Internationale Tagung Wirtschaftsinformatik, WI 2017, St.Gallen, Switzerland, February 12-15, 2017, 2017."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"C.\u00a0Corea, M.\u00a0Fellmann, and P.\u00a0Delfmann. Ontology-based process modelling - will we live to see it? In A.\u00a0K. Ghose, J.\u00a0Horkoff, V.\u00a0E.\u00a0S. Souza, J.\u00a0Parsons, and J.\u00a0Evermann, editors, Conceptual Modeling - 40th International Conference, ER 2021, Virtual Event, October 18-21, 2021, Proceedings, volume 13011 of Lecture Notes in Computer Science, pages 36\u201346. Springer, 2021.","DOI":"10.1007\/978-3-030-89022-3_4"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"J.\u00a0Davies, R.\u00a0Studer, and P.\u00a0Warren. Semantic Web technologies: trends and research in ontology-based systems. John Wiley & Sons, 2006.","DOI":"10.1002\/047003033X"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"L.\u00a0M. de\u00a0Moura and N.\u00a0S. Bj\u00f8rner. Z3: an efficient SMT solver. In TACAS, volume 4963 of Lecture Notes in Computer Science, pages 337\u2013340. Springer, 2008.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"C.\u00a0C. Din, R.\u00a0H\u00e4hnle, E.\u00a0B. Johnsen, K.\u00a0I. Pun, and S.\u00a0L.\u00a0T. Tarifa. Locally abstract, globally concrete semantics of concurrent programming languages. In TABLEAUX, volume 10501 of LNCS, pages 22\u201343. Springer, 2017.","DOI":"10.1007\/978-3-319-66902-1_2"},{"key":"12_CR20","unstructured":"C.\u00a0C. Din, L.\u00a0H. Karlsen, I.\u00a0Pene, O.\u00a0Stahl, I.\u00a0C. Yu, and T.\u00a0\u00d8sterlie. Geological multi-scenario reasoning. In NIK. Bibsys Open Journal Systems, Norway, 2019."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"C.\u00a0C. Din and O.\u00a0Owe. Compositional reasoning about active objects with shared futures. Formal Aspects Comput., 27(3):551\u2013572, 2015.","DOI":"10.1007\/s00165-014-0322-y"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Falcone and S.\u00a0Pinisetty. On the runtime enforcement of timed properties. In RV, volume 11757 of LNCS, pages 48\u201369. Springer, 2019.","DOI":"10.1007\/978-3-030-32079-9_4"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"S.\u00a0R. Fiorini, J.\u00a0Bermejo-Alonso, P.\u00a0J.\u00a0S. Gon\u00e7alves, E.\u00a0P. de\u00a0Freitas, A.\u00a0O. Alarcos, J.\u00a0I. Olszewska, E.\u00a0Prestes, C.\u00a0Schlenoff, S.\u00a0V. Ragavan, S.\u00a0A. Redfield, B.\u00a0Spencer, and H.\u00a0Li. A suite of ontologies for robotics and automation [industrial activities]. IEEE Robotics Autom. Mag., 24(1):8\u201311, 2017.","DOI":"10.1109\/MRA.2016.2645444"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"G.\u00a0Flouris, D.\u00a0Manakanatas, H.\u00a0Kondylakis, D.\u00a0Plexousakis, and G.\u00a0Antoniou. Ontology change: classification and survey. Knowl. Eng. Rev., 23(2):117\u2013152, 2008.","DOI":"10.1017\/S0269888908001367"},{"key":"12_CR25","unstructured":"M.\u00a0Horridge, N.\u00a0Drummond, J.\u00a0Goodwin, A.\u00a0L. Rector, R.\u00a0Stevens, and H.\u00a0Wang. The manchester OWL syntax. In OWLED, volume 216 of CEUR Workshop Proceedings. CEUR-WS.org, 2006."},{"key":"12_CR26","unstructured":"IEEE ORA WG. IEEE standard ontologies for robotics and automation. IEEE Std 1872-2015, pages 1\u201360, 2015."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"EE.\u00a0Kamburjan. Behavioral program logic. In TABLEAUX, volume 11714 of LNCS, pages 391\u2013408. Springer, 2019.","DOI":"10.1007\/978-3-030-29026-9_22"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"E.\u00a0Kamburjan, V.\u00a0N. Klungre, R.\u00a0Schlatte, E.\u00a0B. Johnsen, and M.\u00a0Giese. Programming and debugging with semantically lifted states. In ESWC, volume 12731 of LNCS, pages 126\u2013142. Springer, 2021.","DOI":"10.1007\/978-3-030-77385-4_8"},{"key":"12_CR29","unstructured":"E.\u00a0Kamburjan and E.\u00a0V. Kostylev. Type checking semantically lifted programs via query containment under entailment regimes. In Description Logics, volume 2954 of CEUR Workshop Proceedings. CEUR-WS.org, 2021."},{"key":"12_CR30","unstructured":"Y.\u00a0Kazakov. SRIQ and SROIQ are harder than SHOIQ. In Description Logics, volume 353 of CEUR Workshop Proceedings. CEUR-WS.org, 2008."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"EE.\u00a0Kharlamov, F.\u00a0Mart\u00edn-Recuerda, B.\u00a0Perry, D.\u00a0Cameron, R.\u00a0Fjellheim, and A.\u00a0Waaler. Towards semantically enhanced digital twins. In IEEE BigData, pages 4189\u20134193. IEEE, 2018.","DOI":"10.1109\/BigData.2018.8622503"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"M.\u00a0Leinberger. Type-safe Programming for the Semantic Web. PhD thesis, University of Koblenz and Landau, Germany, 2021.","DOI":"10.3233\/SSW52"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"H.\u00a0J. Levesque, R.\u00a0Reiter, Y.\u00a0Lesp\u00e9rance, F.\u00a0Lin, and R.\u00a0B. Scherl. GOLOG: A logic programming language for dynamic domains. J. Log. Program., 31(1-3):59\u201383, 1997.","DOI":"10.1016\/S0743-1066(96)00121-5"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"D.\u00a0K. Pattipati, R.\u00a0Nasre, and S.\u00a0K. Puligundla. BOLD: an ontology-based log debugger for C programs. Autom. Softw. Eng., 29(1):2, 2022.","DOI":"10.1007\/s10515-021-00308-8"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"A.\u00a0Pnueli. The temporal logic of programs. In FOCS, pages 46\u201357. IEEE Computer Society, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"12_CR36","unstructured":"E.\u00a0Rietzke, R.\u00a0Bergmann, and N.\u00a0Kuhn. ODD-BP - an ontology- and data-driven business process model. In R.\u00a0J\u00e4schke and M.\u00a0Weidlich, editors, Proceedings of the Conference on \"Lernen, Wissen, Daten, Analysen\", Berlin, Germany, September 30 - October 2, 2019, volume 2454 of CEUR Workshop Proceedings, pages 310\u2013321. CEUR-WS.org, 2019."},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"F.\u00a0B. Schneider. Enforceable security policies. ACM Trans. Inf. Syst. Secur., 3(1):30\u201350, 2000.","DOI":"10.1145\/353323.353382"},{"key":"12_CR38","unstructured":"SNOMED International. Snomed ct. https:\/\/www.snomed.org\/."},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"A.\u00a0Soylu, E.\u00a0Kharlamov, D.\u00a0Zheleznyakov, E.\u00a0Jim\u00e9nez-Ruiz, M.\u00a0Giese, M.\u00a0G. Skj\u00e6veland, D.\u00a0Hovland, R.\u00a0Schlatte, S.\u00a0Brandt, H.\u00a0Lie, and I.\u00a0Horrocks. Optiquevqs: A visual query system over ontologies for industry. Semantic Web, 9(5):627\u2013660, 2018.","DOI":"10.3233\/SW-180293"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"E.\u00a0D. Valle, S.\u00a0Ceri, F.\u00a0van Harmelen, and D.\u00a0Fensel. It\u2019s a streaming world! reasoning upon rapidly changing information. IEEE Intell. Syst., 24(6), 2009.","DOI":"10.1109\/MIS.2009.125"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"W.\u00a0M.\u00a0P. van\u00a0der Aalst. Business process management: A comprehensive survey. ISRN Software Engineering, 2013:507984, Feb 2013.","DOI":"10.1155\/2013\/507984"},{"key":"12_CR42","unstructured":"W3C, OWL Working Group. Web ontology language. https:\/\/www.w3.org\/OWL."},{"key":"12_CR43","unstructured":"W3C, RDF Working Group. Resource description framework. https:\/\/www.w3.org\/RDF."},{"key":"12_CR44","unstructured":"W3C, SPARQL Working Group. Sparql 1.1 query language. https:\/\/www.w3.org\/TR\/sparql11-query\/."},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"P.\u00a0A. Walega, B.\u00a0C. Grau, M.\u00a0Kaminski, and E.\u00a0V. Kostylev. Datalogmtl: Computational complexity and expressive power. In IJCAI, pages 1886\u20131892. ijcai.org, 2019.","DOI":"10.24963\/ijcai.2019\/261"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"G.\u00a0Xiao, D.\u00a0Calvanese, R.\u00a0Kontchakov, D.\u00a0Lembo, A.\u00a0Poggi, R.\u00a0Rosati, and M.\u00a0Zakharyaschev. Ontology-based data access: A survey. In J.\u00a0Lang, editor, IJCAI 2018, pages 5511\u20135519. ijcai.org, 2018.","DOI":"10.24963\/ijcai.2018\/777"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"I.\u00a0C. Yu, I.\u00a0Pene, C.\u00a0C. Din, L.\u00a0H. Karlsen, C.\u00a0M. Nguyen, O.\u00a0Stahl, and A.\u00a0Latif. Subsurface Evaluation Through Multi-scenario Reasoning, pages 325\u2013355. Springer International Publishing, Cham, 2021.","DOI":"10.1007\/978-3-030-90716-7_10"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"B.\u00a0Zarrie\u00df and J.\u00a0Cla\u00dfen. Verification of knowledge-based programs over description logic actions. In IJCAI, pages 3278\u20133284. AAAI Press, 2015.","DOI":"10.25368\/2022.216"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30826-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T22:02:57Z","timestamp":1684792977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30826-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031308253","9783031308260"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30826-0_12","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":"20 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"50","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":"12","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":"0","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":"24% - 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-7","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)"}},{"value":"The proceedings also include 2 tool papers, 2 NIER papers, and 2 competition papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}