{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T20:33:21Z","timestamp":1773434001763,"version":"3.50.1"},"publisher-location":"Cham","reference-count":51,"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>Adding multi-modalities (called<jats:italic>subexponentials<\/jats:italic>) to linear logic enhances its power as a logical framework, which has been extensively used in the specification of<jats:italic>e.g.<\/jats:italic>proof systems, programming languages and bigraphs. Initially, subexponentials allowed for classical, linear, affine or relevant behaviors. Recently, this framework was enhanced so to allow for commutativity as well. In this work, we close the cycle by considering associativity. We show that the resulting system (<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathsf {acLL}_\\varSigma $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mi>acLL<\/mml:mi><mml:mi>\u03a3<\/mml:mi><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>) admits the (multi)cut rule, and we prove two undecidability results for fragments\/variations of<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathsf {acLL}_\\varSigma $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mi>acLL<\/mml:mi><mml:mi>\u03a3<\/mml:mi><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/978-3-031-10769-6_27","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:02:56Z","timestamp":1659315776000},"page":"449-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Non-associative, Non-commutative Multi-modal Linear Logic"],"prefix":"10.1007","author":[{"given":"Eben","family":"Blaisdell","sequence":"first","affiliation":[]},{"given":"Max","family":"Kanovich","sequence":"additional","affiliation":[]},{"given":"Stepan L.","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Elaine","family":"Pimentel","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1002\/malq.19950410405","volume":"41","author":"E Aarts","year":"1995","unstructured":"Aarts, E., Trautwein, K.: Non-associative Lambek categorial grammar in polynomial time. Math. Log. Q. 41(4), 476\u2013484 (1995)","journal-title":"Math. Log. Q."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Abrusci, V.M.: A comparison between Lambek syntactic calculus and intuitionistic linear logic. Zeitschr. Math. Logik Grundl. Math. (Math. Logic Q.) 36, 11\u201315 (1990)","DOI":"10.1002\/malq.19900360103"},{"key":"27_CR3","first-page":"1","volume":"1","author":"K Ajdukiewicz","year":"1935","unstructured":"Ajdukiewicz, K.: Die syntaktische Konnexit\u00e4t. Studia Philosophica 1, 1\u201327 (1935)","journal-title":"Studia Philosophica"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2307\/410452","volume":"29","author":"Y Bar-Hillel","year":"1953","unstructured":"Bar-Hillel, Y.: A quasi-arithmetical notation for syntactic description. Language 29, 47\u201358 (1953)","journal-title":"Language"},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"N Belnap","year":"1982","unstructured":"Belnap, N.: Display logic. J. Philos. Log. 11(4), 375\u2013417 (1982). https:\/\/doi.org\/10.1007\/BF00284976","journal-title":"J. Philos. Log."},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11225-009-9205-2","volume":"93","author":"M Bulinska","year":"2009","unstructured":"Bulinska, M.: On the complexity of nonassociative Lambek calculus with unit. Stud. Logica 93(1), 1\u201314 (2009). https:\/\/doi.org\/10.1007\/s11225-009-9205-2","journal-title":"Stud. Logica"},{"key":"27_CR7","unstructured":"Buszkowski, W.: Lambek calculus with nonlogical axioms. In: Language and Grammar, Studies in Mathematical Linguistics and Natural Language, pp. 77\u201393. CSLI Publications (2005)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-01748-3_4","volume-title":"Languages: From Formal to Natural","author":"W Buszkowski","year":"2009","unstructured":"Buszkowski, W., Farulewski, M.: Nonassociative Lambek calculus with additives and context-free languages. In: Grumberg, O., Kaminski, M., Katz, S., Wintner, S. (eds.) Languages: From Formal to Natural. LNCS, vol. 5533, pp. 45\u201358. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01748-3_4"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Chaudhuri, K.: Undecidability of multiplicative subexponential logic. In: Alves, S., Cervesato, I. (eds.) Proceedings Third International Workshop on Linearity, LINEARITY 2014, Vienna, Austria, 13th July 2014. EPTCS, vol. 176, pp. 1\u20138 (2014). https:\/\/doi.org\/10.4204\/EPTCS.176.1","DOI":"10.4204\/EPTCS.176.1"},{"key":"27_CR10","unstructured":"Chaudhuri, K., Marin, S., Stra\u00dfburger, L.: Modular focused proof systems for intuitionistic modal logics. In: FSCD, pp. 16:1\u201316:18 (2016)"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1017\/jsl.2014.39","volume":"80","author":"K Chvalovsk\u00fd","year":"2015","unstructured":"Chvalovsk\u00fd, K.: Undecidability of consequence relation in full non-associative Lambek calculus. J. Symb. Logic 80(2), 567\u2013586 (2015)","journal-title":"J. Symb. Logic"},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Clouston, R., Dawson, J., Gor\u00e9, R., Tiu, A.: Annotation-free sequent calculi for full intuitionistic linear logic. In: Rocca, S.R.D. (ed.) Computer Science Logic 2013 (CSL 2013), CSL 2013, Torino, Italy, 2\u20135 September 2013. LIPIcs, vol. 23, pp. 197\u2013214. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.197","DOI":"10.4230\/LIPIcs.CSL.2013.197"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BFb0022564","volume-title":"Computational Logic and Proof Theory","author":"V Danos","year":"1993","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: The structure of exponentials: uncovering the dynamics of linear logic proofs. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1993. LNCS, vol. 713, pp. 159\u2013171. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BFb0022564"},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1023\/A:1020520915016","volume":"71","author":"P de Groote","year":"2002","unstructured":"de Groote, P., Lamarche, F.: Classical non-associative Lambek calculus. Stud. Logica 71(3), 355\u2013388 (2002). https:\/\/doi.org\/10.1023\/A:1020520915016","journal-title":"Stud. Logica"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-71995-1_13","volume-title":"Foundations of Software Science and Computation Structures","author":"A Gheorghiu","year":"2021","unstructured":"Gheorghiu, A., Marin, S.: Focused proof-search in the logic of bunched implications. In: FOSSACS 2021. LNCS, vol. 12650, pp. 247\u2013267. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71995-1_13"},{"key":"27_CR16","doi-asserted-by":"publisher","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44802-0_5","volume-title":"Computer Science Logic","author":"A Guglielmi","year":"2001","unstructured":"Guglielmi, A., Stra\u00dfburger, L.: Non-commutativity and MELL in the calculus of structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 54\u201368. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44802-0_5"},{"key":"27_CR18","unstructured":"Hepple, M.: A general framework for hybrid substructural categorial logics. Technical report 94\u201314, IRCS (1994)"},{"issue":"4","key":"27_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10849-018-9269-3","volume":"27","author":"M Kanazawa","year":"2018","unstructured":"Kanazawa, M.: On the recognizing power of the Lambek calculus with brackets. J. Logic Lang. Inform. 27(4), 295\u2013312 (2018)","journal-title":"J. Logic Lang. Inform."},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-94205-6_16","volume-title":"Automated Reasoning","author":"M Kanovich","year":"2018","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., Scedrov, A.: A logical framework with commutative and non-commutative subexponentials. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 228\u2013245. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_16"},{"issue":"8","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1017\/S0960129518000117","volume":"29","author":"M Kanovich","year":"2019","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., Scedrov, A.: Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. 29(8), 1217\u20131249 (2019). https:\/\/doi.org\/10.1017\/S0960129518000117","journal-title":"Math. Struct. Comput. Sci."},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-53042-9_14","volume-title":"Formal Grammar","author":"M Kanovich","year":"2016","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: Undecidability of the Lambek calculus with a relevant modality. In: Foret, A., Morrill, G., Muskens, R., Osswald, R., Pogodalla, S. (eds.) FG 2015-2016. LNCS, vol. 9804, pp. 240\u2013256. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53042-9_14"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10849-020-09320-9","volume":"30","author":"M Kanovich","year":"2021","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: The multiplicative-additive Lambek calculus with subexponential and bracket modalities. J. Log. Lang. Inform. 30, 31\u201388 (2021)","journal-title":"J. Log. Lang. Inform."},{"issue":"1","key":"27_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1999.2834","volume":"164","author":"A Kopylov","year":"2001","unstructured":"Kopylov, A.: Decidability of linear affine logic. Inf. Comput. 164(1), 173\u2013198 (2001). https:\/\/doi.org\/10.1006\/inco.1999.2834","journal-title":"Inf. Comput."},{"issue":"2","key":"27_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1093\/logcom\/exq021","volume":"21","author":"M Kozak","year":"2011","unstructured":"Kozak, M.: Cyclic involutive distributive full Lambek calculus is decidable. J. Log. Comput. 21(2), 231\u2013252 (2011). https:\/\/doi.org\/10.1093\/logcom\/exq021","journal-title":"J. Log. Comput."},{"key":"27_CR26","unstructured":"Kurtonina, N.: Frames and labels. A modal analysis of categorial inference. Ph.D. thesis, Universiteit Utrecht, ILLC (1995)"},{"key":"27_CR27","unstructured":"Kurtonina, N., Moortgat, M.: Structural control. In: Blackburn, P., de Rijke, M. (eds.) Specifying Syntactic Structures, CSLI, Stanford, pp. 75\u2013113 (1997)"},{"key":"27_CR28","unstructured":"Lamarche, F.: On the Algebra of Structural Contexts. Mathematical Structures in Computer Science, p. 51 (2003). Article dans revue scientifique avec comit\u00e9 de lecture. https:\/\/hal.inria.fr\/inria-00099461"},{"issue":"3","key":"27_CR29","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/00029890.1958.11989160","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Am. Math. Monthly 65(3), 154\u2013170 (1958)","journal-title":"Am. Math. Monthly"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Lambek, J.: On the calculus of syntactic types. In: Jakobson, R. (ed.) Structure of Language and Its Mathematical Aspects, pp. 166\u2013178. American Mathematical Society (1961)","DOI":"10.1090\/psapm\/012\/9972"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Lellmann, B., Olarte, C., Pimentel, E.: A uniform framework for substructural logics with modalities. In: LPAR-21, pp. 435\u2013455 (2017)","DOI":"10.29007\/93qg"},{"issue":"1\u20133","key":"27_CR32","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. Logic 56(1\u20133), 239\u2013311 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2\u20133","key":"27_CR33","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1093\/jigpal\/3.2-3.371","volume":"3","author":"M Moortgat","year":"1995","unstructured":"Moortgat, M.: Multimodal linguistic inference. Log. J. IGPL 3(2\u20133), 371\u2013401 (1995). https:\/\/doi.org\/10.1093\/jigpal\/3.2-3.371","journal-title":"Log. J. IGPL"},{"issue":"3\u20134","key":"27_CR34","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00159344","volume":"5","author":"M Moortgat","year":"1996","unstructured":"Moortgat, M.: Multimodal linguistic inference. J. Logic Lang. Inform. 5(3\u20134), 349\u2013385 (1996)","journal-title":"J. Logic Lang. Inform."},{"key":"27_CR35","unstructured":"Moortgat, M., Morrill, G.: Heads and phrases: type calculus for dependency and constituent structure. Technical report (1991)"},{"key":"27_CR36","unstructured":"Moortgat, M., Oehrle, R.: Logical parameters and linguistic variation. In: Fifth European Summer School in Logic, Language and Information. Lecture Notes on Categorial Grammar (1993)"},{"key":"27_CR37","doi-asserted-by":"crossref","unstructured":"Moot, R.: The grail theorem prover: type theory for syntax and semantics. CoRR, abs\/1602.00812 (2016). arXiv:1602.00812","DOI":"10.1007\/978-3-319-50422-3_10"},{"key":"27_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31555-8","volume-title":"The Logic of Categorial Grammars","author":"R Moot","year":"2012","unstructured":"Moot, R., Retor\u00e9, C.: The Logic of Categorial Grammars. LNCS, vol. 6850. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31555-8"},{"key":"27_CR39","unstructured":"Morrill, G.: Categorial formalisation of relativisation: Pied piping, islands, and extraction sites. Technical report LSI-92-23-R, Universitat Polit\u00e8cnica de Catalunya (1992)"},{"issue":"2","key":"27_CR40","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10849-018-09277-w","volume":"28","author":"G Morrill","year":"2019","unstructured":"Morrill, G.: Parsing\/theorem-proving for logical grammar CatLog3. J. Log. Lang. Inf. 28(2), 183\u2013216 (2019). https:\/\/doi.org\/10.1007\/s10849-018-09277-w","journal-title":"J. Log. Lang. Inf."},{"key":"27_CR41","unstructured":"Morrill, G., Leslie, N., Hepple, M., Barry, G.: Categorial deductions and structural operations. In: Studies in Categorial Grammar, Edinburgh Working Paper in Cognitive Science, vol. 5, pp. 1\u201321 (1990)"},{"issue":"2","key":"27_CR42","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10817-010-9182-1","volume":"45","author":"V Nigam","year":"2010","unstructured":"Nigam, V., Miller, D.: A framework for proof systems. J. Autom. Reason. 45(2), 157\u2013188 (2010). https:\/\/doi.org\/10.1007\/s10817-010-9182-1","journal-title":"J. Autom. Reason."},{"key":"27_CR43","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2017.06.009","volume":"693","author":"V Nigam","year":"2017","unstructured":"Nigam, V., Olarte, C., Pimentel, E.: On subexponentials, focusing and modalities in concurrent systems. Theor. Comput. Sci. 693, 35\u201358 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.06.009","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"27_CR44","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/logcom\/exu029","volume":"26","author":"V Nigam","year":"2016","unstructured":"Nigam, V., Pimentel, E., Reis, G.: An extended framework for specifying and reasoning about proof systems. J. Log. Comput. 26(2), 539\u2013576 (2016). https:\/\/doi.org\/10.1093\/logcom\/exu029","journal-title":"J. Log. Comput."},{"key":"27_CR45","unstructured":"Oehrle, R., Zhang, S.: Lambek calculus and preposing of embedded subjects. Coyote Papers (1989). http:\/\/hdl.handle.net\/10150\/226572"},{"key":"27_CR46","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.03.029","volume":"641","author":"C Olarte","year":"2016","unstructured":"Olarte, C., Chiarugi, D., Falaschi, M., Hermith, D.: A proof theoretic view of spatial and temporal dependencies in biochemical systems. Theor. Comput. Sci. 641, 25\u201342 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.03.029","journal-title":"Theor. Comput. Sci."},{"key":"27_CR47","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.tcs.2006.03.018","volume":"357","author":"M Pentus","year":"2006","unstructured":"Pentus, M.: Lambek calculus is NP-complete. Theor. Comput. Sci. 357, 186\u2013201 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR48","unstructured":"Pruiksma, K., Chargin, W., Pfenning, F., Reed, J.: Adjoint logic (2018, Unpublished manuscript)"},{"key":"27_CR49","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"S Shieber","year":"1985","unstructured":"Shieber, S.: Evidence against the context-freeness of natural languages. Linguist. Philos. 8, 333\u2013343 (1985)","journal-title":"Linguist. Philos."},{"key":"27_CR50","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2019.02.022","volume":"768","author":"L Stra\u00dfburger","year":"2019","unstructured":"Stra\u00dfburger, L.: On the decision problem for MELL. Theor. Comput. Sci. 768, 91\u201398 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.022","journal-title":"Theor. Comput. Sci."},{"key":"27_CR51","unstructured":"Tanaka, H.: A note on undecidability of propositional non-associative linear logics (2019). arXiv preprint arXiv:1909.13444"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T09:32:14Z","timestamp":1727688734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10769-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107689","9783031107696"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10769-6_27","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)"}}]}}