{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:58:41Z","timestamp":1760014721164,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505232"},{"type":"electronic","value":"9783031505249"}],"license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-50524-9_11","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T15:02:28Z","timestamp":1703862148000},"page":"235-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interpolation and\u00a0Quantifiers in\u00a0Ortholattices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8179-7549","authenticated-orcid":false,"given":"Simon","family":"Guilloud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5994-1081","authenticated-orcid":false,"given":"Sankalp","family":"Gambhir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7044-9522","authenticated-orcid":false,"given":"Viktor","family":"Kun\u010dak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Bell, J.L.: Orthologic, Forcing, and The Manifestation of Attributes. In: Chong, C.T., Wicks, M.J. (eds.) Studies in Logic and the Foundations of Mathematics. Studies in Logic and the Foundations of Mathematics, vol. 111, pp. 13\u201336. Elsevier, Singapore (1983). https:\/\/doi.org\/10.1016\/S0049-237X(08)70953-4","DOI":"10.1016\/S0049-237X(08)70953-4"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"823","DOI":"10.2307\/1968621","volume":"37","author":"G Birkhoff","year":"1936","unstructured":"Birkhoff, G., Von Neumann, J.: The logic of quantum mechanics. Ann. Math. 37(4), 823\u2013843 (1936). https:\/\/doi.org\/10.2307\/1968621","journal-title":"Ann. Math."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_7"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-27836-8_26","volume-title":"Automata, Languages and Programming","author":"G Bruns","year":"2004","unstructured":"Bruns, G., Godefroid, P.: Model checking with multi-valued logics. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 281\u2013293. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_26"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"977","DOI":"10.4153\/CJM-1976-095-6","volume":"28","author":"G Bruns","year":"1976","unstructured":"Bruns, G.: Free Ortholattices. Can. J. Math. 28(5), 977\u2013985 (1976). https:\/\/doi.org\/10.4153\/CJM-1976-095-6","journal-title":"Can. J. Math."},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Brzozowski, J.: De Morgan bisemilattices. In: Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000), pp. 173\u2013178 (2000). https:\/\/doi.org\/10.1109\/ISMVL.2000.848616","DOI":"10.1109\/ISMVL.2000.848616"},{"issue":"7","key":"11_CR7","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s10773-005-7051-1","volume":"44","author":"I Chajda","year":"2005","unstructured":"Chajda, I., Hala\u0161, R.: An implication in orthologic. Int. J. Theor. Phys. 44(7), 735\u2013744 (2005). https:\/\/doi.org\/10.1007\/s10773-005-7051-1","journal-title":"Int. J. Theor. Phys."},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00153-005-0282-2","volume":"44","author":"S Cook","year":"2005","unstructured":"Cook, S., Morioka, T.: Quantified propositional calculus and a second-order theory for NC1. Arch. Math. Logic 44(6), 711\u2013749 (2005). https:\/\/doi.org\/10.1007\/s00153-005-0282-2","journal-title":"Arch. Math. Logic"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 238\u2013252. POPL \u201977, Association for Computing Machinery, New York, NY, USA (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2307\/2963594","volume":"22","author":"W Craig","year":"1957","unstructured":"Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symb. Log. 22(3), 269\u2013285 (1957). https:\/\/doi.org\/10.2307\/2963594","journal-title":"J. Symb. Log."},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Dudenhefner, A., Rehof, J.: A Simpler Undecidability Proof for System F Inhabitation. In: TYPES, p. 11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern\/Saarbruecken, Germany (2019). https:\/\/doi.org\/10.4230\/LIPICS.TYPES.2018.2","DOI":"10.4230\/LIPICS.TYPES.2018.2"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen I. Math. Z. 39, 176\u2013210 (1935)","journal-title":"Math. Z."},{"key":"11_CR13","volume-title":"Proofs and Types","author":"JY Girard","year":"1989","unstructured":"Girard, J.Y., Taylor, P., Lafont, Y.: Proofs and Types. Cambridge University Press, New York, USA (1989)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-031-37709-9_19","volume-title":"Computer Aided Verification","author":"S Guilloud","year":"2023","unstructured":"Guilloud, S., Bucev, M., Milovan\u010devi\u0107, D., Kun\u010dak, V.: Formula Normalizations in Verification. In: Enea, C., Lal, A. (eds.) Computer Aided Verification, pp. 398\u2013422. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37709-9_19"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Guilloud, S., Gambhir, S., Kun\u010dak, V.: LISA - A modern proof system. In: Naumowicz, A., Thiemann, R. (eds.) 14th International Conference on Interactive Theorem Proving (ITP 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 268, pp. 17:1\u201317:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2023.17, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2023\/18392","DOI":"10.4230\/LIPIcs.ITP.2023.17"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Guilloud, S., Kun\u010dak, V.: Orthologic with axioms. Proc. ACM Program. Lang. 8(POPL) (2024)","DOI":"10.1145\/3632881"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: Jones, N.D., Leroy, X. (eds.) Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14\u201316, 2004, pp. 232\u2013244. ACM (2004). https:\/\/doi.org\/10.1145\/964001.964021","DOI":"10.1145\/964001.964021"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Hoder, K., Kov\u00e1cs, L., Voronkov, A.: Interpolation and Symbol Elimination in Vampire. In: Giesl, J., H\u00e4hnle, R. (eds.) Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16\u201319, 2010. Proceedings. Lecture Notes in Computer Science, vol. 6173, pp. 188\u2013195. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-14203-1_16","DOI":"10.1007\/978-3-642-14203-1_16"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Hojjat, H., Rummer, P.: The ELDARICA Horn Solver. In: 2018 Formal Methods in Computer Aided Design (FMCAD), pp. 1\u20137 (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603013","DOI":"10.23919\/FMCAD.2018.8603013"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.3390\/logics1010004","volume":"1","author":"WH Holliday","year":"2023","unstructured":"Holliday, W.H.: A fundamental non-classical logic. Logics 1(1), 36\u201379 (2023). https:\/\/doi.org\/10.3390\/logics1010004","journal-title":"Logics"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Holliday, W.H., Mandelkern, M.: The Orthologic of Epistemic Modals (2022). https:\/\/doi.org\/10.48550\/ARXIV.2203.02872","DOI":"10.48550\/ARXIV.2203.02872"},{"key":"11_CR22","volume-title":"Orthomodular Lattices","author":"G Kalmbach","year":"1983","unstructured":"Kalmbach, G.: Orthomodular Lattices. Academic Press Inc, London; New York (1983)"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs, L., Voronkov, A.: Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. In: Chechik, M., Wirsing, M. (eds.) Fundamental Approaches to Software Engineering, pp. 470\u2013485. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00593-0_33","DOI":"10.1007\/978-3-642-00593-0_33"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(80)90048-1","volume":"10","author":"D Kozen","year":"1980","unstructured":"Kozen, D.: Complexity of Boolean algebras. Theor. Comput. Sci. 10, 221\u2013247 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90048-1","journal-title":"Theor. Comput. Sci."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-642-22110-1_45","volume-title":"Computer Aided Verification","author":"D Kroening","year":"2011","unstructured":"Kroening, D., Weissenbacher, G.: Interpolation-based software verification with Wolverine. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 573\u2013578. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_45"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 199\u2013213. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69738-1_14"},{"issue":"4","key":"11_CR27","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.2307\/2274823","volume":"54","author":"GRR de Lavalette","year":"1989","unstructured":"de Lavalette, G.R.R.: Interpolation in fragments of intuitionistic propositional logic. J. Symbolic Logic 54(4), 1419\u20131430 (1989). https:\/\/doi.org\/10.2307\/2274823","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"11_CR28","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1090\/S0002-9947-1937-1501929-X","volume":"42","author":"HM MacNeille","year":"1937","unstructured":"MacNeille, H.M.: Partially ordered sets. Trans. Am. Math. Soc. 42(3), 416\u2013460 (1937). https:\/\/doi.org\/10.1090\/S0002-9947-1937-1501929-X","journal-title":"Trans. Am. Math. Soc."},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Madsen, M., Yee, M.H., Lhot\u00e1k, O.: From Datalog to flix: a declarative language for fixed points on lattices. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 194\u2013208 (2016). https:\/\/doi.org\/10.1145\/2908080.2908096","DOI":"10.1145\/2908080.2908096"},{"key":"11_CR30","unstructured":"McMillan, K., Rybalchenko, A.: Solving Constrained Horn Clauses using Interpolation. Tech. rep, Microsoft Research (2013)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1\u201313. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-69738-1_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"KL McMillan","year":"2007","unstructured":"McMillan, K.L.: Interpolants and symbolic model checking. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 89\u201390. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69738-1_6"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-78800-3_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"KL McMillan","year":"2008","unstructured":"McMillan, K.L.: Quantified invariant generation using an interpolating saturation prover. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 413\u2013427. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_31"},{"key":"11_CR34","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-319-10575-8_14","volume-title":"Handbook of Model Checking","author":"KL McMillan","year":"2018","unstructured":"McMillan, K.L.: Interpolation and model checking. In: Handbook of Model Checking, pp. 421\u2013446. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_14"},{"issue":"4","key":"11_CR35","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0960129510000125","volume":"20","author":"A Meinander","year":"2010","unstructured":"Meinander, A.: A solution of the uniform word problem for ortholattices. Math. Struct. Comput. Sci. 20(4), 625\u2013638 (2010). https:\/\/doi.org\/10.1017\/S0960129510000125","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR36","first-page":"45","volume":"33","author":"Y Miyazaki","year":"1999","unstructured":"Miyazaki, Y.: The super-amalgamation property of the variety of ortholattices. Reports Math. Log. 33, 45\u201363 (1999)","journal-title":"Reports Math. Log."},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Berlin Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03811-6","DOI":"10.1007\/978-3-662-03811-6"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Pudl\u00e1k, P.: The lengths of proofs. In: Studies in Logic and the Foundations of Mathematics, vol. 137, pp. 547\u2013637. Elsevier (1998). https:\/\/doi.org\/10.1016\/S0049-237X(98)80023-2","DOI":"10.1016\/S0049-237X(98)80023-2"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"R\u00fcmmer, P., Hojjat, H., Kuncak, V.: Disjunctive interpolants for horn-clause verification. In: Computer Aided Verification (CAV) (2013)","DOI":"10.1007\/978-3-642-39799-8_24"},{"issue":"1","key":"11_CR40","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF02483891","volume":"12","author":"J Schulte M\u00f6nting","year":"1981","unstructured":"Schulte M\u00f6nting, J.: Cut elimination and word problems for varieties of lattices. Algebra Univers. 12(1), 290\u2013321 (1981). https:\/\/doi.org\/10.1007\/BF02483891","journal-title":"Algebra Univers."},{"issue":"3","key":"11_CR41","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/BF01470747","volume":"148","author":"K Sch\u00fctte","year":"1962","unstructured":"Sch\u00fctte, K.: Der Interpolationssatz der intuitionistischen Pr\u00e4dikatenlogik. Math. Ann. 148(3), 192\u2013200 (1962). https:\/\/doi.org\/10.1007\/BF01470747","journal-title":"Math. Ann."},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"S\u00f8rensen, M., Urzyczyn, P.: Lectures on the curry-howard isomorphism. Stud. Logic Found. Math. 149 (2010). https:\/\/doi.org\/10.1016\/S0049-237X(06)80005-4","DOI":"10.1016\/S0049-237X(06)80005-4"},{"key":"11_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-62688-3_47","volume-title":"Typed Lambda Calculi and Applications","author":"P Urzyczyn","year":"1997","unstructured":"Urzyczyn, P.: Inhabitation in typed lambda-calculi (a syntactic approach). In: de Groote, P., Roger Hindley, J. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 373\u2013389. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62688-3_47"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50524-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T02:12:39Z","timestamp":1730945559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50524-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505232","9783031505249"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50524-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"assertion":[{"value":"30 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl24.sigplan.org\/home\/VMCAI-2024","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":"74","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":"30","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":"41% - 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)"}}]}}