{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T04:10:49Z","timestamp":1789877449863,"version":"4.0.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_10","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"166-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hypersequent Calculus with Clusters for Data Logic over Ordinals"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Lick","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"issue":"3\u20134","key":"10_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A Avron","year":"1991","unstructured":"Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell. 4(3\u20134), 225\u2013248 (1991). \n                      https:\/\/doi.org\/10.1007\/BF01531058","journal-title":"Ann. Math. Artif. Intell."},{"key":"10_CR2","unstructured":"Baelde, D., Lick, A., Schmitz, S.: A hypersequent calculus with clusters for linear frames. In: AiML 2018: Advances in Modal Logic, vol. 12, pp. 36\u201355. College Publications (2018). \n                      https:\/\/hal.inria.fr\/hal-01756126"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Baelde, D., Lick, A., Schmitz, S.: A hypersequent calculus with clusters for tense logic over ordinals. In: FSTTCS 2018. Leibniz International Proceedings in Informatics (LZI), vol. 122, pp. 15:1\u201315:19 (2018). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2018.15","DOI":"10.4230\/LIPIcs.FSTTCS.2018.15"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Baelde, D., Lunel, S., Schmitz, S.: A sequent calculus for a modal logic on finite data trees. In: CSL 2016. Leibniz International Proceedings in Informatics (LZI), vol. 62, pp. 32:1\u201332:16 (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2016.32","DOI":"10.4230\/LIPIcs.CSL.2016.32"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"ND Belnap","year":"1982","unstructured":"Belnap, N.D.: Display logic. J. Philos. Logic 11(4), 375\u2013417 (1982). \n                      https:\/\/doi.org\/10.1007\/BF00284976","journal-title":"J. Philos. Logic"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27:1\u201327:26 (2011). \n                      https:\/\/doi.org\/10.1145\/1970398.1970403","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-23217-6_12","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"B Bollig","year":"2011","unstructured":"Bollig, B.: An automaton over data words that captures EMSO logic. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 171\u2013186. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-23217-6_12"},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00153-009-0137-3","volume":"48","author":"K Br\u00fcnnler","year":"2009","unstructured":"Br\u00fcnnler, K.: Deep sequent systems for modal logic. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung 48(6), 551\u2013577 (2009). \n                      https:\/\/doi.org\/10.1007\/s00153-009-0137-3","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"key":"10_CR9","unstructured":"Cocchiarella, N.B.: Tense and modal logic: a study in the topology of temporal reference. Ph.D. thesis, University of California, Los Angeles (1965)"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC 1971, pp. 151\u2013158. ACM (1971). \n                      https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Czerwi\u0144ski, W., Lasota, S., Lazi\u0107, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary. In: STOC 2019. ACM (2019, to appear)","DOI":"10.1145\/3313276.3316369"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-66902-1_16","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A Das","year":"2017","unstructured":"Das, A., Pous, D.: A cut-free cyclic proof system for kleene algebra. In: Schmidt, R.A., Nalon, C. (eds.) TABLEAUX 2017. LNCS (LNAI), vol. 10501, pp. 261\u2013277. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66902-1_16"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-12(3:1)2016","volume":"12","author":"S Demri","year":"2016","unstructured":"Demri, S., Figueira, D., Praveen, M.: Reasoning about data repetitions with counter systems. Log. Methods Comput. Sci. 12(3), 1 (2016). \n                      https:\/\/doi.org\/10.2168\/LMCS-12(3:1)2016","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1507244.1507246","volume":"10","author":"S Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 16 (2009). \n                      https:\/\/doi.org\/10.1145\/1507244.1507246","journal-title":"ACM Trans. Comput. Log."},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2168\/LMCS-6(4:9)2010","volume":"6","author":"S Demri","year":"2010","unstructured":"Demri, S., Rabinovich, A.: The complexity of linear-time temporal logic over the class of ordinals. Log. Methods Comput. Sci. 6(4), 9 (2010). \n                      https:\/\/doi.org\/10.2168\/LMCS-6(4:9)2010","journal-title":"Log. Methods Comput. Sci."},{"issue":"01","key":"10_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1142\/S0129054107004589","volume":"18","author":"S Demri","year":"2007","unstructured":"Demri, S., Nowak, D.: Reasoning about transfinite sequences. Int. J. Fund. Comput. Sci. 18(01), 87\u2013112 (2007). \n                      https:\/\/doi.org\/10.1142\/S0129054107004589","journal-title":"Int. J. Fund. Comput. Sci."},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/inco.2001.2953","volume":"179","author":"K Etessami","year":"2002","unstructured":"Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. Comput. 179(2), 279\u2013295 (2002). \n                      https:\/\/doi.org\/10.1006\/inco.2001.2953","journal-title":"Inf. Comput."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-03816-7_29","volume-title":"Mathematical Foundations of Computer Science 2009","author":"D Figueira","year":"2009","unstructured":"Figueira, D., Segoufin, L.: Future-looking logics on data words and trees. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 331\u2013343. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03816-7_29"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ic.2010.08.003","volume":"209","author":"O Gauwin","year":"2011","unstructured":"Gauwin, O., Niehren, J., Tison, S.: Queries on XML streams with bounded delay and concurrency. Inf. Comput. 209(3), 409\u2013442 (2011). \n                      https:\/\/doi.org\/10.1016\/j.ic.2010.08.003","journal-title":"Inf. Comput."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1006\/inco.1994.1035","volume":"110","author":"P Godefroid","year":"1994","unstructured":"Godefroid, P., Wolper, P.: A partial approach to model checking. Inf. Comput. 110(2), 305\u2013326 (1994). \n                      https:\/\/doi.org\/10.1006\/inco.1994.1035","journal-title":"Inf. Comput."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-05302-8_1","volume-title":"Foundations and Practice of Security","author":"J Goubault-Larrecq","year":"2014","unstructured":"Goubault-Larrecq, J., Olivain, J.: On the efficiency of mathematics in intrusion detection: the NetEntropy case. In: Danger, J.-L., Debbabi, M., Marion, J.-Y., Garcia-Alfaro, J., Zincir Heywood, N. (eds.) FPS -2013. LNCS, vol. 8352, pp. 3\u201316. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-05302-8_1"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-36742-7_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Christ","year":"2013","unstructured":"Christ, J., Hoenicke, J., Nutz, A.: Proof tree preserving interpolation. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 124\u2013138. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36742-7_9"},{"issue":"1\/2","key":"10_CR23","first-page":"89","volume":"41","author":"A Indrzejczak","year":"2012","unstructured":"Indrzejczak, A.: Cut-free hypersequent calculus for S4.3. Bull. Sec. Logic 41(1\/2), 89\u2013104 (2012)","journal-title":"Bull. Sec. Logic"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/bsl.2016.2","volume":"22","author":"A Indrzejczak","year":"2016","unstructured":"Indrzejczak, A.: Linear time in hypersequent framework. Bull. Symb. Log. 22(1), 121\u2013144 (2016). \n                      https:\/\/doi.org\/10.1017\/bsl.2016.2","journal-title":"Bull. Symb. Log."},{"issue":"1\/2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.18778\/0138-0680.46.1.2.10","volume":"46","author":"A Indrzejczak","year":"2017","unstructured":"Indrzejczak, A.: Cut elimination theorem for non-commutative hypersequent calculus. Bull. Sec. Logic 46(1\/2), 135\u2013149 (2017). \n                      https:\/\/doi.org\/10.18778\/0138-0680.46.1.2.10","journal-title":"Bull. Sec. Logic"},{"key":"10_CR26","unstructured":"Kanovich, M.: The multiplicative fragment of linear logic is \n                      \n                        \n                      \n                      $$\\sf NP$$\n                     complete. Technical report X-91-13, Institute for Language, Logic, and Information (1991)"},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01053026","volume":"53","author":"R Kashima","year":"1994","unstructured":"Kashima, R.: Cut-free sequent calculi for some tense logics. Studia Logica 53(1), 119\u2013135 (1994). \n                      https:\/\/doi.org\/10.1007\/BF01053026","journal-title":"Studia Logica"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-94-017-2798-3_7","volume-title":"Proof Theory of Modal Logic","author":"M Kracht","year":"1996","unstructured":"Kracht, M.: Power and weakness of the modal display calculus. In: Wansing, H. (ed.) Proof Theory of Modal Logic, pp. 93\u2013121. Springer, Dordrecht (1996). \n                      https:\/\/doi.org\/10.1007\/978-94-017-2798-3_7"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-10061-6_4","volume-title":"New Frontiers in Artificial Intelligence","author":"H Kurokawa","year":"2014","unstructured":"Kurokawa, H.: Hypersequent calculi for modal logics extending S4. In: Nakano, Y., Satoh, K., Bekki, D. (eds.) JSAI-isAI 2013. LNCS (LNAI), vol. 8417, pp. 51\u201368. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10061-6_4"},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/1877714.1877716","volume":"12","author":"R Lazi\u0107","year":"2011","unstructured":"Lazi\u0107, R.: Safety alternating automata on data words. ACM Trans. Comput. Log. 12(2), 10:1\u201310:24 (2011). \n                      https:\/\/doi.org\/10.1145\/1877714.1877716","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-24312-2_10","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"B Lellmann","year":"2015","unstructured":"Lellmann, B.: Linear nested sequents, 2-sequents and hypersequents. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 135\u2013150. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-24312-2_10"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Reachability in vector addition systems is primitive-recursive in fixed dimension. In: LICS 2019. IEEE (2019, to appear). \n                      http:\/\/arxiv.org\/abs\/1903.08575","DOI":"10.1109\/LICS.2019.8785796"},{"key":"10_CR33","unstructured":"Lick, A.: A hypersequent calculus with clusters for data logic over ordinals. In: Cerrito, S., Popescu, A., (eds.) TABLEAUX 2019. LNAI, vol. 11714, pp. 166\u2013184 (2019). \n                      https:\/\/hal.archives-ouvertes.fr\/hal-02165359"},{"issue":"1\u20133","key":"10_CR34","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","volume":"56","author":"P Lincoln","year":"1992","unstructured":"Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure Appl. Log. 56(1\u20133), 239\u2013311 (1992). \n                      https:\/\/doi.org\/10.1016\/0168-0072(92)90075-B","journal-title":"Ann. Pure Appl. Log."},{"issue":"5","key":"10_CR35","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10992-005-2267-3","volume":"34","author":"S Negri","year":"2005","unstructured":"Negri, S.: Proof analysis in modal logic. J. Philos. Logic 34(5), 507\u2013544 (2005). \n                      https:\/\/doi.org\/10.1007\/s10992-005-2267-3","journal-title":"J. Philos. Logic"},{"issue":"4","key":"10_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00713542","volume":"39","author":"H Ono","year":"1980","unstructured":"Ono, H., Nakamura, A.: On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica 39(4), 325\u2013333 (1980). \n                      https:\/\/doi.org\/10.1007\/BF00713542","journal-title":"Studia Logica"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46\u201357. IEEE (1977). \n                      https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"10_CR38","series-title":"Trends in Logic","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-1-4020-9084-4_3","volume-title":"Towards Mathematical Philosophy","author":"F Poggiolesi","year":"2009","unstructured":"Poggiolesi, F.: The method of tree-hypersequents for modal propositional logic. In: Makinson, D., Wansing, H. (eds.) Towards Mathematical Philosophy. Trends in Logic, vol. 28, pp. 31\u201351. Springer, Dordrecht (2009). \n                      https:\/\/doi.org\/10.1007\/978-1-4020-9084-4_3"},{"issue":"4","key":"10_CR39","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1017\/S1755020309990244","volume":"2","author":"F Poggiolesi","year":"2009","unstructured":"Poggiolesi, F.: A purely syntactic and cut-free sequent calculus for the modal logic of provability. Rev. Symb. Log. 2(4), 593\u2013611 (2009). \n                      https:\/\/doi.org\/10.1017\/S1755020309990244","journal-title":"Rev. Symb. Log."},{"key":"10_CR40","volume-title":"Time and Modality","author":"AN Prior","year":"1957","unstructured":"Prior, A.N.: Time and Modality. Oxford University Press, Oxford (1957)"},{"issue":"3","key":"10_CR41","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"AP Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733\u2013749 (1985). \n                      https:\/\/doi.org\/10.1145\/3828.3837","journal-title":"J. ACM"},{"issue":"2","key":"10_CR42","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1993.1006","volume":"102","author":"AP Sistla","year":"1993","unstructured":"Sistla, A.P., Zuck, L.D.: Reasoning in a restricted temporal logic. Inf. Comput. 102(2), 167\u2013195 (1993). \n                      https:\/\/doi.org\/10.1006\/inco.1993.1006","journal-title":"Inf. Comput."},{"key":"10_CR43","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS 1986, pp. 322\u2013331. IEEE (1986)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:14:52Z","timestamp":1566414892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","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":"43","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":"25","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":"58% - 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":"3","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)"}}]}}