{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:34:46Z","timestamp":1742952886355,"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 are interested in widening the reasoning support for propositional modal logics in the so-called modal cube. The modal cube consists of extensions of the basic modal logic <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{K}_{}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>K<\/mml:mi>\n                    <mml:mrow\/>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with an arbitrary combination of the modal axioms <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{B}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>B<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{D}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>D<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{T}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>T<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{4}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mn>4<\/mml:mn>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{5}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mn>5<\/mml:mn>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We revisit recently developed local reductions from all logics in the modal cube to a normal form comprising sets of clausal formulae with associated modal levels. We extend these reductions further to the basic modal logic <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{K}_{}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>K<\/mml:mi>\n                    <mml:mrow\/>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, called <jats:italic>definitional reductions<\/jats:italic>. This enables any prover for <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{K}_{}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>K<\/mml:mi>\n                    <mml:mrow\/>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> to be used to solve the satisfiability problem for all logics in the modal cube. We also present alternative, <jats:italic>axiomatic<\/jats:italic>, reductions based on ideas originally proposed by Kracht, providing new theoretical results and improved bounds on the size of the reductions. We compare both sets of reductions combined with state-of-the-art provers for <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{K}_{}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>K<\/mml:mi>\n                    <mml:mrow\/>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on a large set of parametric benchmarks for all logics in the modal cube. The results show that the provers perform better with reductions based on the clausal normal form than the axiomatic reductions.<\/jats:p>","DOI":"10.1007\/978-3-031-38499-8_22","type":"book-chapter","created":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:03:25Z","timestamp":1693609405000},"page":"382-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Buy One Get 14 Free: Evaluating Local Reductions for\u00a0Modal Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9792-5346","authenticated-orcid":false,"given":"Cl\u00e1udia","family":"Nalon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0455-0267","authenticated-orcid":false,"given":"Ullrich","family":"Hustadt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0310-7378","authenticated-orcid":false,"given":"Fabio","family":"Papacchini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4610-9533","authenticated-orcid":false,"given":"Clare","family":"Dixon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"key":"22_CR1","unstructured":"Areces, C., Gennari, R., Heguiabehere, J., de Rijke, M.: Tree-based heuristic in modal theorem proving. In: Horn, W. (ed.) ECAI 2000, pp. 199\u2013203. IOS Press (2000)"},{"key":"22_CR2","unstructured":"Balbiani, P., Demri, S.: Prefixed tableaux systems for modal logics with enriched languages. In: Pollack, M.E. (ed.) IJCAI 1997, pp. 190\u2013195. Morgan Kaufmann (1997)"},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1006249507577","volume":"24","author":"P Balsiger","year":"2000","unstructured":"Balsiger, P., Heuerding, A., Schwendimann, S.: A benchmark method for the propositional modal logics K, KT, S4. J. Autom. Reasoning 24(3), 297\u2013317 (2000). https:\/\/doi.org\/10.1023\/A:1006249507577","journal-title":"J. Autom. Reasoning"},{"key":"22_CR4","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Modal Logic","author":"P Blackburn","year":"2002","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge (2002)"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10849-005-5788-9","volume":"14","author":"S Demri","year":"2005","unstructured":"Demri, S., de Nivelle, H.: Deciding regular grammar logics with converse through first-order logic. J. Logic Lang. Inform. 14(3), 289\u2013329 (2005)","journal-title":"J. Logic Lang. Inform."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-51054-1_25","volume-title":"Automated Reasoning","author":"M Girlando","year":"2020","unstructured":"Girlando, M., Stra\u00dfburger, L.: MOIN: a nested sequent theorem prover for intuitionistic modal logics (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 398\u2013407. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_25"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/3-540-61511-3_115","volume-title":"Automated Deduction \u2014 Cade-13","author":"F Giunchiglia","year":"1996","unstructured":"Giunchiglia, F., Sebastiani, R.: Building decision procedures for modal logics from propositional decision procedures\u2014the case study of modal K. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 583\u2013597. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61511-3_115"},{"key":"22_CR8","unstructured":"Glei\u00dfner, T., Steen, A.: LEO-III (2022). https:\/\/doi.org\/10.5281\/zenodo.4435994"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Glei\u00dfner, T., Steen, A., Benzm\u00fcller, C.: Theorem provers for every normal modal logic. In: Eiter, T., Sands, D. (eds.) LPAR 2017. EPiC Series in Computing, vol. 46, pp. 14\u201330. EasyChair (2017). https:\/\/doi.org\/10.29007\/jsb9","DOI":"10.29007\/jsb9"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-86059-2_5","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R Gor\u00e9","year":"2021","unstructured":"Gor\u00e9, R., Kikkert, C.: CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT. In: Das, A., Negri, S. (eds.) TABLEAUX 2021. LNCS (LNAI), vol. 12842, pp. 74\u201391. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86059-2_5"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3233\/FI-2009-115","volume":"94","author":"R Gor\u00e9","year":"2009","unstructured":"Gor\u00e9, R., Nguyen, L.A.: Clausal tableaux for multimodal logics of belief. Fundam. Inform. 94(1), 21\u201340 (2009)","journal-title":"Fundam. Inform."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-08587-6_25","volume-title":"Automated Reasoning","author":"R Gor\u00e9","year":"2014","unstructured":"Gor\u00e9, R., Olesen, K., Thomson, J.: Implementing tableau calculi using BDDs: BDDTab system description. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 337\u2013343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_25"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.entcs.2010.04.010","volume":"262","author":"D G\u00f6tzmann","year":"2010","unstructured":"G\u00f6tzmann, D., Kaminski, M., Smolka, G.: Spartacus: a tableau prover for hybrid logic. Electron. Notes Theor. Comput. Sci. 262, 127\u2013139 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Horrocks, I., Hustadt, U., Sattler, U., Schmidt, R.A.: Computational modal logic. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, chap. 4, pp. 181\u2013245. Elsevier (2006)","DOI":"10.1016\/S1570-2464(07)80007-3"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/10722086_7","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"U Hustadt","year":"2000","unstructured":"Hustadt, U., Schmidt, R.A.: MSPASS: modal reasoning by translation and first-order resolution. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS (LNAI), vol. 1847, pp. 67\u201371. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722086_7"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-38574-2_31","volume-title":"Automated Deduction \u2013 CADE-24","author":"M Kaminski","year":"2013","unstructured":"Kaminski, M., Tebbi, T.: InKreSAT: modal reasoning via incremental reduction to SAT. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 436\u2013442. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_31"},{"issue":"6","key":"22_CR17","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1093\/logcom\/11.6.879","volume":"11","author":"M Kracht","year":"2001","unstructured":"Kracht, M.: Reducing modal consequence relations. J. Log. Comput. 11(6), 879\u2013907 (2001)","journal-title":"J. Log. Comput."},{"key":"22_CR18","unstructured":"Kracht, M.: Notes on the space requirements for checking satisfiability in modal logics. In: Balbiani, P., Suzuki, N.Y., Wolter, F., Zakaryaschev, M. (eds.) Advances in Modal Logic 4, pp. 243\u2013264. King\u2019s College Publications (2003)"},{"key":"22_CR19","unstructured":"Nalon, C.: K$$_{\\rm S}$$P (2022). https:\/\/www.nalon.org\/#software"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/11853886_28","volume-title":"Logics in Artificial Intelligence","author":"C Nalon","year":"2006","unstructured":"Nalon, C., Dixon, C.: Anti-prenexing and prenexing for modal logics. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 333\u2013345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11853886_28"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.jalgor.2007.04.001","volume":"62","author":"C Nalon","year":"2007","unstructured":"Nalon, C., Dixon, C.: Clausal resolution for normal modal logics. J. Algorithms 62, 117\u2013134 (2007)","journal-title":"J. Algorithms"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Nalon, C., Dixon, C., Hustadt, U.: Modal resolution: proofs, layers, and refinements. ACM Trans. Comput. Log. 20(4), 23:1\u201323:38 (2019)","DOI":"10.1145\/3331448"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-24312-2_13","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"C Nalon","year":"2015","unstructured":"Nalon, C., Hustadt, U., Dixon, C.: A modal-layered resolution calculus for K. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 185\u2013200. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24312-2_13"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-319-40229-1_28","volume-title":"Automated Reasoning","author":"C Nalon","year":"2016","unstructured":"Nalon, C., Hustadt, U., Dixon, C.: K$$_{\\rm S}$$P: a resolution-based prover for multimodal K. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 406\u2013415. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_28"},{"key":"22_CR25","doi-asserted-by":"publisher","unstructured":"Nalon, C., Hustadt, U., Dixon, C.: K$$_{\\rm S}$$P: a resolution-based prover for multimodal K, abridged report. In: Sierra, C. (ed.) IJCAI 2017, pp. 4919\u20134923. IJCAI\/AAAI Press (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/694","DOI":"10.24963\/ijcai.2017\/694"},{"issue":"3","key":"22_CR26","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10817-018-09503-x","volume":"64","author":"C Nalon","year":"2020","unstructured":"Nalon, C., Hustadt, U., Dixon, C.: K$$_{\\rm S}$$P: Architecture, refinements, strategies and experiments. J. Autom. Reason. 64(3), 461\u2013484 (2020)","journal-title":"J. Autom. Reason."},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-031-10769-6_29","volume-title":"Automated Reasoning","author":"C Nalon","year":"2022","unstructured":"Nalon, C., Hustadt, U., Papacchini, F., Dixon, C.: Local reductions for the modal cube. In: Blanchette, J., Kov\u00e1cs, L., Pattinson, D. (eds.) IJCAR 2022. LNCS, vol. 13385, pp. 486\u2013505. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10769-6_29"},{"issue":"1\u20132","key":"22_CR28","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3166\/jancl.16.169-207","volume":"16","author":"G Pan","year":"2006","unstructured":"Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for the modal logic K. J. Appl. Non-Class. Log. 16(1\u20132), 169\u2013208 (2006)","journal-title":"J. Appl. Non-Class. Log."},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-030-79876-5_5","volume-title":"Automated Deduction \u2013 CADE 28","author":"F Papacchini","year":"2021","unstructured":"Papacchini, F., Nalon, C., Hustadt, U., Dixon, C.: Efficient local reductions to basic modal logic. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 76\u201392. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_5"},{"issue":"4","key":"22_CR30","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10817-022-09630-6","volume":"66","author":"F Papacchini","year":"2022","unstructured":"Papacchini, F., Nalon, C., Hustadt, U., Dixon, C.: Local is best: efficient reductions to modal logic K. J. Autom. Reason. 66(4), 639\u2013666 (2022). https:\/\/doi.org\/10.1007\/s10817-022-09630-6","journal-title":"J. Autom. Reason."},{"key":"22_CR31","unstructured":"Schulz, S.: E 2.6 (2022). https:\/\/wwwlehre.dhbw-stuttgart.de\/~sschulz\/E\/Download.html"},{"key":"22_CR32","doi-asserted-by":"publisher","unstructured":"Steen, A., Benzm\u00fcller, C.: The higher-order prover Leo-III. In: Giacomo, G.D., Catal\u00e1, A., Dilkina, B., Milano, M., Barro, S., Bugar\u00edn, A., Lang, J. (eds.) ECAI 2020. Frontiers in Artificial Intelligence and Applications, vol. 325, pp. 2937\u20132938. IOS Press (2020). https:\/\/doi.org\/10.3233\/FAIA200462","DOI":"10.3233\/FAIA200462"},{"key":"22_CR33","unstructured":"The SPASS Team: SPASS 3.9 (2016). https:\/\/www.spass-prover.org\/"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/11814771_26","volume-title":"Automated Reasoning","author":"D Tsarkov","year":"2006","unstructured":"Tsarkov, D., Horrocks, I.: FaCT++ description logic reasoner: system description. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 292\u2013297. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:05:31Z","timestamp":1693609531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38499-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031384981","9783031384998"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38499-8_22","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)"}}]}}