{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:11:45Z","timestamp":1743005505714,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031166808"},{"type":"electronic","value":"9783031166815"}],"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:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16681-5_20","type":"book-chapter","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T03:41:24Z","timestamp":1663299684000},"page":"287-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Experiments with\u00a0Automated Reasoning in\u00a0the\u00a0Class"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4686-2864","authenticated-orcid":false,"given":"Isabela","family":"Dr\u0103mnesc","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5647-6134","authenticated-orcid":false,"given":"Erika","family":"\u00c1brah\u00e1m","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2247-2151","authenticated-orcid":false,"given":"Tudor","family":"Jebelean","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6969-1629","authenticated-orcid":false,"given":"G\u00e1bor","family":"Kusper","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2124-8246","authenticated-orcid":false,"given":"Sorin","family":"Stratulat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"key":"20_CR1","unstructured":"\u00c1brah\u00e1m, E., Nalbach, J., Kremer, G.: Embedding the virtual substitution method in the model constructing satisfiability calculus framework. In: proceedings of SC-square\u201917. CEUR Workshop Proceedings, vol. 1974. CEUR-WS.org (2017). urn:nbn:de:0074\u20131974-4, http:\/\/ceur-ws.org\/Vol-1974\/EAb.pdf"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Arias, E.J.G., Pin, B., Jouvelot, P.: jsCoq: Towards hybrid theorem proving interfaces. In: Proceedings of the 12th Workshop on User Interfaces for Theorem Provers, UITP. EPTCS, vol. 239, pp. 15\u201327 (2016)","DOI":"10.4204\/EPTCS.239.2"},{"key":"20_CR3","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The satisfiability modulo theories library (SMT-LIB). www.SMT-LIB.org (2016)"},{"key":"20_CR4","unstructured":"Barrett, C., Kroening, D., Melham, T.: Problem solving for the 21st century: Efficient solvers for satisfiability modulo theories. Knowledge Transfer Report 3, London Mathematical Society and Smith Institute for Industrial Mathematics and System Engineering (2014)"},{"key":"20_CR5","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, chap. 26, vol. 185, pp. 825\u2013885. IOS Press (2009)"},{"key":"20_CR6","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.6092\/issn.1972-5787\/4568","volume":"9","author":"B Buchberger","year":"2016","unstructured":"Buchberger, B., Jebelean, T., Kutsia, T., Maletzky, A., Windsteiger, W.: Theorema 2.0: computer-assisted natural-style mathematics. J. Formalized Reasoning 9(1), 149\u2013185 (2016). https:\/\/doi.org\/10.6092\/issn.1972-5787\/4568","journal-title":"J. Formalized Reasoning"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: An introduction to proof theory. In: Handbook of Proof Theory, pp. 31\u201335. Elsevier (1998)","DOI":"10.1016\/S0049-237X(98)80016-5"},{"key":"20_CR9","unstructured":"CArL: Project homepage. https:\/\/github.com\/smtrat\/carl"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"GE Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134\u2013183. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_17"},{"key":"20_CR11","unstructured":"https:\/\/members.loria.fr\/SStratulat\/files\/MVA\/index.html"},{"key":"20_CR12","unstructured":"Corzilius, F.: Integrating virtual substitution into strategic SMT solving. Ph.D. thesis, RWTH Aachen University, Germany (2016). http:\/\/publications.rwth-aachen.de\/record\/688379"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-24318-4_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"F Corzilius","year":"2015","unstructured":"Corzilius, F., Kremer, G., Junges, S., Schupp, S., \u00c1brah\u00e1m, E.: SMT-RAT: an open source C++ toolbox for strategic and parallel SMT solving. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 360\u2013368. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_26"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-31612-8_35","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"F Corzilius","year":"2012","unstructured":"Corzilius, F., Loup, U., Junges, S., \u00c1brah\u00e1m, E.: SMT-RAT: an SMT-compliant nonlinear real arithmetic toolbox. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 442\u2013448. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_35"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962). https:\/\/doi.org\/10.1145\/368273.368557","DOI":"10.1145\/368273.368557"},{"key":"20_CR16","unstructured":"http:\/\/www.domagoj-babic.com\/uploads\/ResearchProjects\/Spear\/dimacs-cnf.pdf"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AG Doig","year":"1960","unstructured":"Doig, A.G., Land, B.H., Doig, A.G.: An automatic method for solving discrete programming problems. Econometrica 28, 497\u2013520 (1960)","journal-title":"Econometrica"},{"issue":"7","key":"20_CR18","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1111\/j.1365-2929.2005.02205.x","volume":"39","author":"DHJM Dolmans","year":"2005","unstructured":"Dolmans, D.H.J.M., De Grave, W., Wolfhagen, I.H.A.P., Van Der Vleuten, C.P.M.: Problem-based learning: future challenges for educational practice and research. Mediac Educ. 39(7), 732\u2013741 (2005). https:\/\/doi.org\/10.1111\/j.1365-2929.2005.02205.x","journal-title":"Mediac Educ."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"100635","DOI":"10.1016\/j.jlamp.2020.100635","volume":"119","author":"I Dramnesc","year":"2020","unstructured":"Dramnesc, I., Jebelean, T.: Synthesis of sorting algorithms using multisets in Theorema. J. Logical Algebraic Methods Program. 119, 100635 (2020). https:\/\/doi.org\/10.1016\/j.jlamp.2020.100635","journal-title":"J. Logical Algebraic Methods Program."},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jsc.2018.04.002","volume":"90","author":"I Dramnesc","year":"2019","unstructured":"Dramnesc, I., Jebelean, T., Stratulat, S.: Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques. J. Symb. Comput. 90, 3\u201341 (2019). https:\/\/doi.org\/10.1016\/j.jsc.2018.04.002","journal-title":"J. Symb. Comput."},{"key":"20_CR21","unstructured":"Dramnesc, I., Jebelean, T.: Implementation of deletion algorithms on lists and binary trees in Theorema. RISC Report Series 20\u201304, Research Institute for Symbolic Computation, Johannes Kepler University Linz (2020)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-66167-4_11","volume-title":"Frontiers of Combining Systems","author":"P Fontaine","year":"2017","unstructured":"Fontaine, P., Ogawa, M., Sturm, T., Vu, X.T.: Subtropical satisfiability. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 189\u2013206. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_11"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E Friedgut","year":"1999","unstructured":"Friedgut, E.: Appendix by Jean bourgain: sharp thresholds of graph properties, and the k-sat problem. J. Am. Math. Soc. 12, 1017\u20131054 (1999)","journal-title":"J. Am. Math. Soc."},{"key":"20_CR24","unstructured":"Gao, S., Ganai, M., Ivan\u010di\u0107, F., Gupta, A., Sankaranarayanan, S., Clarke, E.M.: Integrating ICP and LRA solvers for deciding nonlinear real arithmetic problems. In: Proceedings of FMCAD\u201910, pp. 81\u201390. IEEE (2010)"},{"key":"20_CR25","unstructured":"Herbort, S., Ratz, D.: Improving the efficiency of a nonlinear-system-solver using a componentwise Newton method. Technical report 2\/1997, Inst. f\u00fcr Angewandte Mathematik, University of Karlsruhe (1997)"},{"key":"20_CR26","unstructured":"CEA-EDF-INRIA summer school, INRIA Paris-Rocquencourt, Antenne Parisienne, 2011. https:\/\/fzn.fr\/teaching\/coq\/ecole11\/"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-030-81097-9_10","volume-title":"Intelligent Computer Mathematics","author":"T Jebelean","year":"2021","unstructured":"Jebelean, T.: A Heuristic Prover for Elementary Analysis in Theorema. In: Kamareddine, F., Sacerdoti Coen, C. (eds.) CICM 2021. LNCS (LNAI), vol. 12833, pp. 130\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81097-9_10"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-40663-8_18","volume-title":"Algebraic Informatics","author":"S Junges","year":"2013","unstructured":"Junges, S., Loup, U., Corzilius, F., \u00c1brah\u00e1m, E.: On Gr\u00f6bner bases in the context of satisfiability-modulo-theories solving over the real numbers. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol. 8080, pp. 186\u2013198. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40663-8_18"},{"key":"20_CR29","unstructured":"Knuth, D.E.: The Art of Computer Programming: Satisfiability, Volume 4, Fascicle 6. Addison-Wesley Professional (2015)"},{"key":"20_CR30","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.jsc.2019.07.018","volume":"100","author":"G Kremer","year":"2020","unstructured":"Kremer, G., Abraham, E.: Fully incremental cylindrical algebraic decomposition. J. Symb. Comput. 100, 11\u201337 (2020). https:\/\/doi.org\/10.1016\/j.jsc.2019.07.018","journal-title":"J. Symb. Comput."},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-45641-6_21","volume-title":"Computer Algebra in Scientific Computing","author":"G Kremer","year":"2016","unstructured":"Kremer, G., Corzilius, F., \u00c1brah\u00e1m, E.: A generalised branch-and-bound approach and its application in SAT modulo nonlinear integer arithmetic. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2016. LNCS, vol. 9890, pp. 315\u2013335. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45641-6_21"},{"key":"20_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74105-3","volume-title":"Decision Procedures: An Algorithmic Point of View","author":"D Kroening","year":"2008","unstructured":"Kroening, D., Strichman, O.: Decision Procedures: An Algorithmic Point of View. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-74105-3"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Kusper, G., Balla, T., Bir\u00f3, C., Tajti, T., Yang, Z.G., Baj\u00e1k, I.: Generating minimal unsatisfiable SAT instances from strong digraphs. In: SYNASC 2020, pp. 84\u201392. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SYNASC51798.2020.00024","DOI":"10.1109\/SYNASC51798.2020.00024"},{"key":"20_CR34","doi-asserted-by":"publisher","unstructured":"Kusper, G., Bir\u00f3, C., Isz\u00e1ly, G.B.: SAT solving by CSFLOC, the next generation of full-length clause counting algorithms. In: 2018 IEEE International Conference on Future IoT Technologies, pp. 1\u20139. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/FIOT.2018.8325589","DOI":"10.1109\/FIOT.2018.8325589"},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535. Association for Computing Machinery (2001). https:\/\/doi.org\/10.1145\/378239.379017","DOI":"10.1145\/378239.379017"},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"20_CR37","unstructured":"https:\/\/github.com\/ths-rwth\/smtrat\/releases"},{"key":"20_CR38","unstructured":"https:\/\/smt-comp.github.io\/"},{"key":"20_CR39","unstructured":"https:\/\/smt-workshop.cs.uiowa.edu\/"},{"key":"20_CR40","unstructured":"https:\/\/ths-rwth.github.io\/smtrat\/"},{"key":"20_CR41","unstructured":"https:\/\/ths.rwth-aachen.de\/theses\/"},{"key":"20_CR42","unstructured":"http:\/\/www.satisfiability.org\/"},{"key":"20_CR43","unstructured":"http:\/\/www.satlive.org\/smt.html"},{"key":"20_CR44","unstructured":"The Coq development team: The Coq Reference Manual. INRIA (2020)"},{"key":"20_CR45","unstructured":"https:\/\/www.risc.jku.at\/research\/theorema\/software"},{"key":"20_CR46","unstructured":"https:\/\/arc.info.uvt.ro\/?page_id=49"},{"key":"20_CR47","series-title":"Texts and Monographs in Symbolic ComputationTexts and Monographs in Symbolic Computation","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-7091-9459-1_20","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"V Weispfenning","year":"1998","unstructured":"Weispfenning, V.: A new approach to quantifier elimination for real algebra. In: Caviness, B.F., Johnson, J.R. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic ComputationTexts and Monographs in Symbolic Computation, pp. 376\u2013392. Springer, Vienna (1998). https:\/\/doi.org\/10.1007\/978-3-7091-9459-1_20"},{"issue":"2","key":"20_CR48","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002000050055","volume":"8","author":"V Weispfenning","year":"1997","unstructured":"Weispfenning, V.: Quantifier elimination for real algebra - the quadratic case and beyond. Appl. Algebra Eng. Commun. Comput. 8(2), 85\u2013101 (1997). https:\/\/doi.org\/10.1007\/s002000050055","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"20_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-44199-2_9","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"W Windsteiger","year":"2014","unstructured":"Windsteiger, W.: Theorema 2.0: a system for mathematical theory exploration. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 49\u201352. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44199-2_9"},{"key":"20_CR50","unstructured":"Wolfram Research Inc.: Mathematica, Version 13.0.0. https:\/\/www.wolfram.com\/mathematica"},{"key":"20_CR51","unstructured":"https:\/\/ericpony.github.io\/z3py-tutorial\/guide-examples.htm"},{"key":"20_CR52","unstructured":"https:\/\/github.com\/Z3Prover\/doc\/tree\/master\/programmingz3\/code"},{"key":"20_CR53","unstructured":"https:\/\/github.com\/z3prover\/z3"},{"key":"20_CR54","unstructured":"https:\/\/theory.stanford.edu\/nikolaj\/programmingz3.html"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16681-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T03:44:14Z","timestamp":1663299854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16681-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031166808","9783031166815"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16681-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","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":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2022\/cicm.php","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":"37","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":"17","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":"4","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":"46% - 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":"2.95","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.9","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)"}}]}}