{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:44:01Z","timestamp":1773416641385,"version":"3.50.1"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031505232","type":"print"},{"value":"9783031505249","type":"electronic"}],"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_9","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T15:02:28Z","timestamp":1703862148000},"page":"186-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Model-Guided Synthesis for\u00a0LTL over\u00a0Finite Traces"],"prefix":"10.1007","author":[{"given":"Shengping","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongkang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyue","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geguang","family":"Pu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ofer","family":"Strichman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"9_CR1","unstructured":"The reactive synthesis competition. http:\/\/www.syntcomp.org\/"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11605157_22","volume-title":"Implementation and Application of Automata","author":"CS Althoff","year":"2006","unstructured":"Althoff, C.S., Thomas, W., Wallmeier, N.: Observations on determinization of B\u00fcchi automata. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 262\u2013272. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11605157_22"},{"key":"9_CR3","unstructured":"Aminof, B., De Giacomo, G., Murano, A., Rubin, S.: Synthesis under assumptions. In: Sixteenth International Conference on Principles of Knowledge Representation and Reasoning, pp. 615\u2013616. AAAI Press (2018)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Aminof, B., De Giacomo, G., Murano, A., Rubin, S.: Planning under LTL environment specifications. In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, pp. 31\u201339. AAAI Press (2019)","DOI":"10.1609\/icaps.v29i1.3457"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1018985923441","volume":"22","author":"F Bacchus","year":"1998","unstructured":"Bacchus, F., Kabanza, F.: Planning for temporally extended goals. Ann. Math. Artif. Intell. 22, 5\u201327 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, S., Giacomo, G.D., Stasio, A.D., Li, Y., Vardi, M.Y., Zhu, S.: Compositional safety LTL synthesis. In: Verified Software: Theories, Tools, and Experiments (VSTTE) (2022)","DOI":"10.1007\/978-3-031-25803-9_1"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, S., Li, Y., Tabajara, L., Vardi, M.: Hybrid compositional reasoning for reactive synthesis from finite-horizon specifications. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, vol. 34, pp. 9766\u20139774. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i06.6528"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Saar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012)","DOI":"10.1016\/j.jcss.2011.08.007"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-642-31424-7_45","volume-title":"Computer Aided Verification","author":"A Bohy","year":"2012","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Jin, N., Raskin, J.-F.: Acacia+, a tool for LTL synthesis. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 652\u2013657. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_45"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bryant, R.: Graph-based algorithms for Boolean-function manipulation. IEEE Trans. Comput. C-35(8), 677\u2013691 (1986)","DOI":"10.1109\/TC.1986.1676819"},{"key":"9_CR11","unstructured":"B\u00fcchi, J.: On a decision method in restricted second order arithmetic. In: Proceedings of International Congress on Logic, Method, and Philosophy of Science. 1960, pp. 1\u201312. Stanford University Press (1962)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J., Landweber, L.: Solving sequential conditions by finite-state strategies. Trans. AMS 138, 295\u2013311 (1969)","journal-title":"Trans. AMS"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 252\u2013263. Association for Computing Machinery, New York (2017)","DOI":"10.1145\/3055399.3055409"},{"key":"9_CR14","unstructured":"Camacho, A., Bienvenu, M., McIlraith, S.A.: Finite LTL synthesis with environment assumptions and quality measures. In: Sixteenth International Conference on Principles of Knowledge Representation and Reasoning, pp. 454\u2013463. AAAI Press (2018)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Camacho, A., McIlraith, S.A.: Strong fully observable non-deterministic planning with LTL and LTLf goals. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, pp. 5523\u20135531 (2019)","DOI":"10.24963\/ijcai.2019\/767"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Camacho, A., Triantafillou, E., Muise, C.J., Baier, J.A., McIlraith, S.A.: Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 3716\u20133724. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.11058"},{"key":"9_CR17","unstructured":"Church, A.: Logic, arithmetics, and automata. In: Proceedings of International Congress of Mathematicians, 1962, pp. 23\u201335. Institut Mittag-Leffler (1963)"},{"issue":"4","key":"9_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.2307\/2271310","volume":"28","author":"A Church","year":"1963","unstructured":"Church, A.: Application of recursive arithmetic to the problem of circuit synthesis. J. Symb. Log. 28(4), 289\u2013290 (1963)","journal-title":"J. Symb. Log."},{"key":"9_CR19","unstructured":"Darwiche, A.: SDD: a new canonical representation of propositional knowledge bases. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 819\u2013826. AAAI Press (2011)"},{"key":"9_CR20","unstructured":"De Giacomo, G., Vardi, M.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 854\u2013860. AAAI Press (2013)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Favorito, M.: Compositional approach to translate LTLf\/LDLf into deterministic finite automata. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 31, pp. 122\u2013130 (2021)","DOI":"10.1609\/icaps.v31i1.15954"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Rubin, S.: Automata-theoretic foundations of fond planning for LTLf and LDLf goals. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 4729\u20134735. AAAI Press (2018)","DOI":"10.24963\/ijcai.2018\/657"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Duret-Lutz, A., et al.: From spot 2.0 to spot 2.10: what\u2019s new? In: Shoham, S., Vizel, Y. (eds.) CAV 2022. LNCS, vol. 13372, pp. 174\u2013187. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-13188-2_9","DOI":"10.1007\/978-3-031-13188-2_9"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs. In: Proceedings of 29th IEEE Symposium on Foundations of Computer Science, pp. 328\u2013337 (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: Tree automata, $$\\mu $$-calculus and determinacy. In: Proceedings of 32nd IEEE Symposium on Foundations of Computer Science, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Fuggitti, F.: FOND planning for LTLf and PLTLf goals (2020). https:\/\/doi.org\/10.48550\/ARXIV.2004.07027","DOI":"10.48550\/ARXIV.2004.07027"},{"key":"9_CR28","unstructured":"Giacomo, G.D., Vardi, M.Y.: Synthesis for LTL and LDL on finite traces. In: Proceedings of the 24th International Conference on Artificial Intelligence, pp. 1558\u20131564. AAAI Press (2015)"},{"key":"9_CR29","unstructured":"Giacomo, G.D., Favorito, M., Li, J., Vardi, M.Y., Xiao, S., Zhu, S.: LTLf synthesis as and-or graph search: knowledge compilation at work. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, pp. 3292\u20133298. AAAI Press (2022)"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JG Henriksen","year":"1995","unstructured":"Henriksen, J.G., et al.: Mona: monadic second-order logic in practice. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89\u2013110. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60630-0_5"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Kupferman, O.: Avoiding determinization. In: Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 243\u2013254 (2006)","DOI":"10.1109\/LICS.2006.15"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-48683-6_17","volume-title":"Computer Aided Verification","author":"O Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: Model checking of safety properties. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 172\u2013183. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48683-6_17"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Li, J., Rozier, K.Y., Pu, G., Zhang, Y., Vardi, M.Y.: SAT-based explicit LTLf satisfiability checking. In: The Thirty-Third AAAI Conference on Artificial Intelligence, pp. 2946\u20132953. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012946"},{"key":"9_CR34","unstructured":"Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTL$$_f$$ satisfibility checking. In: Proceedings of the Twenty-First European Conference on Artificial Intelligence, pp. 513\u2013518. IOS Press (2014)"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Luo, W., Wan, H., Du, J., Li, X., Fu, Y., Ye, R., Zhang, D.: Teaching LTLf satisfiability checking to neural network. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, pp. 3292\u20133298. AAAI Press (2022)","DOI":"10.24963\/ijcai.2022\/457"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-319-96145-3_31","volume-title":"Computer Aided Verification","author":"PJ Meyer","year":"2018","unstructured":"Meyer, P.J., Sickert, S., Luttenberger, M.: Strix: explicit reactive synthesis strikes back! In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 578\u2013586. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_31"},{"key":"9_CR37","unstructured":"Michaud, T., Colange, M.: Reactive synthesis from LTL specification with spot. In: Proceedings Seventh Workshop on Synthesis, SYNT@CAV 2018. Electronic Proceedings in Theoretical Computer Science (2018)"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming","author":"A Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652\u2013671. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035790"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Rabin, M.: Automata on infinite objects and Church\u2019s problem. American Mathematical Society (1972)","DOI":"10.1090\/cbms\/013"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of $$\\omega $$-automata. In: Proceedings of 29th IEEE Symposium on Foundations of Computer Science, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Shi, Y., Xiao, S., Li, J., Guo, J., Pu, G.: SAT-based automata construction for LTL over finite traces. In: 27th Asia-Pacific Software Engineering Conference (APSEC), pp. 1\u201310. IEEE (2020). https:\/\/doi.org\/10.1109\/APSEC51365.2020.00008","DOI":"10.1109\/APSEC51365.2020.00008"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Xiao, S., Li, J., Zhu, S., Shi, Y., Pu, G., Vardi, M.Y.: On the fly synthesis for LTL over finite traces. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, pp. 6530\u20136537. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i7.16809"},{"issue":"9","key":"9_CR44","doi-asserted-by":"publisher","first-page":"3105","DOI":"10.1109\/TCAD.2023.3236272","volume":"42","author":"X Zhang","year":"2023","unstructured":"Zhang, X., Xiao, S., Xia, Y., Li, J., Chen, M., Pu, G.: Accelerate safety model checking based on complementary approximate reachability. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(9), 3105\u20133117 (2023). https:\/\/doi.org\/10.1109\/TCAD.2023.3236272","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Zhu, S., Tabajara, L., Li, J., Pu, G., Vardi, M.: Symbolic LTLf synthesis. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 1362\u20131369. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/189"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Zhu, S., Giacomo, G.D., Pu, G., Vardi, M.Y.: LTL$$f$$ synthesis with fairness and stability assumptions. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, pp. 3088\u20133095. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i03.5704"},{"key":"9_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-70389-3_10","volume-title":"Hardware and Software: Verification and Testing","author":"S Zhu","year":"2017","unstructured":"Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: A symbolic approach to safety ltl synthesis. In: HVC 2017. LNCS, vol. 10629, pp. 147\u2013162. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70389-3_10"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T02:13:26Z","timestamp":1730945606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50524-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505232","9783031505249"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50524-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}