{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T05:19:26Z","timestamp":1790745566846,"version":"4.1.0"},"publisher-location":"Cham","reference-count":40,"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_20","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"355-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Herbrand Constructivization for Automated Intuitionistic Theorem Proving"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Ebner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.2178\/jsl\/1333566645","volume":"77","author":"M Baaz","year":"2012","unstructured":"Baaz, M., Hetzl, S., Weller, D.: On the complexity of proof deskolemization. J. Symb. Log. 77(2), 669\u2013686 (2012)","journal-title":"J. Symb. Log."},{"issue":"2\u20133","key":"20_CR2","first-page":"59","volume":"7","author":"DL Berre","year":"2010","unstructured":"Berre, D.L., Parrain, A.: The Sat4j library, release 2.2. JSAT 7(2\u20133), 59\u201364 (2010)","journal-title":"JSAT"},{"key":"20_CR3","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development \u2013 Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development \u2013 Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-662-07964-5"},{"issue":"11","key":"20_CR4","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/182.183","volume":"26","author":"W Bibel","year":"1983","unstructured":"Bibel, W.: Matings in matrices. Commun. ACM 26(11), 844\u2013852 (1983)","journal-title":"Commun. ACM"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-24364-6_2","volume-title":"Frontiers of Combining Systems","author":"JC Blanchette","year":"2011","unstructured":"Blanchette, J.C., Bulwahn, L., Nipkow, T.: Automatic proof and disproof in isabelle\/HOL. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS (LNAI), vol. 6989, pp. 12\u201327. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24364-6_2"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-03359-9_6","volume-title":"Theorem Proving in Higher Order Logics","author":"A Bove","year":"2009","unstructured":"Bove, A., Dybjer, P., Norell, U.: A brief overview of agda \u2013 a functional language with dependent types. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 73\u201378. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03359-9_6"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-60178-3_85","volume-title":"Logic and Computational Complexity","author":"SR Buss","year":"1995","unstructured":"Buss, S.R.: On Herbrand\u2019s theorem. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 195\u2013209. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-60178-3_85"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Cauderlier, R.: A rewrite system for proof constructivization. In: Dowek, G., Licata, D.R., Alves, S. (eds.) 11th Workshop on Logical Frameworks and Meta-Languages: Theory and Practice. LFMTP, pp. 2:1\u20132:7. ACM (2016)","DOI":"10.1145\/2966268.2966270"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-662-48899-7_43","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K Claessen","year":"2015","unstructured":"Claessen, K., Ros\u00e9n, D.: SAT modulo intuitionistic implications. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 622\u2013637. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-48899-7_43"},{"issue":"1\u20134","key":"20_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10817-018-9458-4","volume":"61","author":"L Czajka","year":"2018","unstructured":"Czajka, L., Kaliszyk, C.: Hammer for Coq: automation for dependent type theory. J. Autom. Reason. 61(1\u20134), 423\u2013453 (2018)","journal-title":"J. Autom. Reason."},{"key":"20_CR11","unstructured":"Dunchev, C., et al.: PROOFTOOL: a GUI for the GAPT framework. In: Kaliszyk, C., L\u00fcth, C. (eds.) Proceedings 10th International Workshop On User Interfaces for Theorem Provers (UITP) 2012. EPTCS, vol. 118, pp. 1\u201314 (2012)"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.apal.2015.01.002","volume":"166","author":"S Eberhard","year":"2015","unstructured":"Eberhard, S., Hetzl, S.: Inductive theorem proving based on tree grammars. Ann. Pure Appl. Log. 166(6), 665\u2013700 (2015)","journal-title":"Ann. Pure Appl. Log."},{"key":"20_CR13","unstructured":"Ebner, G.: Extracting expansion trees from resolution proofs with splitting and definitions (2018). Preprint \n                      https:\/\/gebner.org\/pdfs\/2018-01-29_etimport.pdf"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10817-018-9462-8","volume":"63","author":"G Ebner","year":"2018","unstructured":"Ebner, G., Hetzl, S., Leitsch, A., Reis, G., Weller, D.: On the generation of quantified lemmas. J. Autom. Reason. 63(1), 95\u2013126 (2018)","journal-title":"J. Autom. Reason."},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-40229-1_20","volume-title":"Automated Reasoning","author":"G Ebner","year":"2016","unstructured":"Ebner, G., Hetzl, S., Reis, G., Riener, M., Wolfsteiner, S., Zivota, S.: System description: GAPT 2.0. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 293\u2013301. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-40229-1_20"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-54458-7_28","volume-title":"Foundations of Software Science and Computation Structures","author":"F Gilbert","year":"2017","unstructured":"Gilbert, F.: Automated constructivization of proofs. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 480\u2013495. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-662-54458-7_28"},{"key":"20_CR17","unstructured":"Herbrand, J.: Recherches sur la th\u00e9orie de la d\u00e9monstration. Ph.D. thesis, Universit\u00e9 de Paris (1930)"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10817-014-9303-3","volume":"53","author":"C Kaliszyk","year":"2014","unstructured":"Kaliszyk, C., Urban, J.: Learning-assisted automated reasoning with Flyspeck. J. Autom. Reason. 53(2), 173\u2013213 (2014)","journal-title":"J. Autom. Reason."},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39799-8_1","volume-title":"Computer Aided Verification","author":"L Kov\u00e1cs","year":"2013","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-order theorem proving and Vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1\u201335. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39799-8_1"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0027763000018055","volume":"7","author":"S Maehara","year":"1954","unstructured":"Maehara, S.: Eine Darstellung der intuitionistischen Logik in der Klassischen. Nagoya Math. J. 7, 45\u201364 (1954)","journal-title":"Nagoya Math. J."},{"key":"20_CR21","unstructured":"McCune, W.: Prover9 and Mace4 (2005\u20132010). \n                      http:\/\/www.cs.unm.edu\/~mccune\/prover9\/"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-02959-2_19","volume-title":"Automated Deduction \u2013 CADE-22","author":"S McLaughlin","year":"2009","unstructured":"McLaughlin, S., Pfenning, F.: Efficient intuitionistic theorem proving with the polarized inverse method. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 230\u2013244. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02959-2_19"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF00370646","volume":"46","author":"DA Miller","year":"1987","unstructured":"Miller, D.A.: A compact representation of proofs. Studia Logica 46(4), 347\u2013370 (1987)","journal-title":"Studia Logica"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-52335-9_55","volume-title":"COLOG-88","author":"G Mints","year":"1990","unstructured":"Mints, G.: Gentzen-type systems and resolution rules part I propositional logic. In: Martin-L\u00f6f, P., Mints, G. (eds.) COLOG 1988. LNCS, vol. 417, pp. 198\u2013231. Springer, Heidelberg (1990). \n                      https:\/\/doi.org\/10.1007\/3-540-52335-9_55"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Mints, G.: Gentzen-type system and resolution rules. Part II: Propositional logic. In: Logic Colloquium 1990 (1993)","DOI":"10.1007\/3-540-52335-9_55"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-319-21401-6_26","volume-title":"Automated Deduction - CADE-25","author":"L Moura de","year":"2015","unstructured":"de Moura, L., Kong, S., Avigad, J., van Doorn, F., von Raumer, J.: The lean theorem prover (system description). In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 378\u2013388. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-21401-6_26"},{"issue":"3\u20134","key":"20_CR27","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00153-016-0474-y","volume":"55","author":"S Negri","year":"2016","unstructured":"Negri, S.: Glivenko sequent classes in the light of structural proof theory. Arch. Math. Log. 55(3\u20134), 461\u2013473 (2016)","journal-title":"Arch. Math. Log."},{"key":"20_CR28","unstructured":"Orevkov, V.P.: On Glivenko sequent classes. Trudy Matematicheskogo Instituta imeni V. A. Steklova 98, 131\u2013154 (1968)"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11554554_19","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Otten","year":"2005","unstructured":"Otten, J.: Clausal connection-based theorem proving in intuitionistic first-order logic. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 245\u2013261. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11554554_19"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-71070-7_23","volume-title":"Automated Reasoning","author":"J Otten","year":"2008","unstructured":"Otten, J.: leanCoP 2.0 and ileanCoP 1.2: high performance lean theorem proving in classical and intuitionistic logic (system descriptions). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 283\u2013291. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71070-7_23"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-319-74313-4_23","volume-title":"Perspectives of System Informatics","author":"V Pavlov","year":"2018","unstructured":"Pavlov, V., Pak, V.: WhaleProver: first-order intuitionistic theorem prover based on the inverse method. In: Petrenko, A.K., Voronkov, A. (eds.) PSI 2017. LNCS, vol. 10742, pp. 322\u2013336. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-74313-4_23"},{"issue":"1\u20133","key":"20_CR32","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10817-006-9060-z","volume":"38","author":"T Raths","year":"2007","unstructured":"Raths, T., Otten, J., Kreitz, C.: The ILTP problem library for intuitionistic logic. J. Autom. Reason. 38(1\u20133), 261\u2013271 (2007)","journal-title":"J. Autom. Reason."},{"key":"20_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.4204\/EPTCS.186.3","volume":"186","author":"Giselle Reis","year":"2015","unstructured":"Reis, G.: Importing SMT and connection proofs as expansion trees. In: Fourth Workshop on Proof eXchange for Theorem Proving, PxTP, pp. 3\u201310 (2015)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/978-3-642-45221-5_49","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S Schulz","year":"2013","unstructured":"Schulz, S.: System description: E\u00a01.8. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR 2013. LNCS, vol. 8312, pp. 735\u2013743. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-45221-5_49"},{"issue":"4","key":"20_CR35","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10817-009-9143-8","volume":"43","author":"Geoff Sutcliffe","year":"2009","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure: the FOF and CNF parts, v3.5.0. J. Autom. Reason. 43(4), 337\u2013362 (2009)","journal-title":"Journal of Automated Reasoning"},{"key":"20_CR36","unstructured":"The Univalent Foundations Program: Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study (2013). \n                      https:\/\/homotopytypetheory.org\/book"},{"key":"20_CR37","volume-title":"Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science","author":"AS Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2000)"},{"issue":"2","key":"20_CR38","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1023260415982","volume":"30","author":"A Voronkov","year":"2003","unstructured":"Voronkov, A.: Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-unification. J. Autom. Reason. 30(2), 121\u2013151 (2003)","journal-title":"J. Autom. Reason."},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-319-08867-9_46","volume-title":"Computer Aided Verification","author":"A Voronkov","year":"2014","unstructured":"Voronkov, A.: AVATAR: the architecture for first-order theorem provers. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 696\u2013710. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-08867-9_46"},{"key":"20_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02959-2_10","volume-title":"Automated Deduction \u2013 CADE-22","author":"C Weidenbach","year":"2009","unstructured":"Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 140\u2013145. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02959-2_10"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:15:54Z","timestamp":1566429354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_20","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)"}}]}}