{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:13:01Z","timestamp":1726056781597},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030333935"},{"type":"electronic","value":"9783030333942"}],"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-33394-2_9","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T17:16:49Z","timestamp":1572455809000},"page":"103-118","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata"],"prefix":"10.1007","author":[{"given":"Hanan","family":"Shabana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail V.","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-67549-7_15","volume-title":"Testing Software and Systems","author":"\u00d6F Altun","year":"2017","unstructured":"Altun, \u00d6.F., Atam, K.T., Karahoda, S., Kaya, K.: Synchronizing heuristics: speeding up the slowest. In: Yevtushenko, N., Cavalli, A.R., Yenig\u00fcn, H. (eds.) ICTSS 2017. LNCS, vol. 10533, pp. 243\u2013256. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-67549-7_15"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1142\/9789812702616_0002","volume-title":"Semigroups and Languages","author":"DS Ananichev","year":"2004","unstructured":"Ananichev, D.S., Volkov, M.V.: Some results on \u010cern\u00fd type problems for transformation semigroups. In: Ara\u00fajo, I.M., Branco, M.J.J., Fernandes, V.H., Gomes, G.M.S. (eds.) Semigroups and Languages, pp. 23\u201342. World Scientific, Singapore (2004). \n                    https:\/\/doi.org\/10.1142\/9789812702616_0002"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10958-013-1392-8","volume":"192","author":"DS Ananichev","year":"2013","unstructured":"Ananichev, D.S., Volkov, M.V., Gusev, V.V.: Primitive digraphs with large exponents and slowly synchronizing automata. J. Math. Sci. 192(3), 263\u2013278 (2013). \n                    https:\/\/doi.org\/10.1007\/s10958-013-1392-8","journal-title":"J. Math. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195768","volume-title":"Codes and Automata","author":"J Berstel","year":"2009","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2009). \n                    https:\/\/doi.org\/10.1017\/CBO9781139195768"},{"key":"9_CR5","first-page":"301","volume":"12","author":"H-D Burkhard","year":"1976","unstructured":"Burkhard, H.-D.: Zum L\u00e4ngenproblem homogener Experimente an determinierten und nicht-deterministischen Automaten. Elektronische Informationsverarbeitung und Kybernetik 12, 301\u2013306 (1976)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"volume-title":"Handbook on Satisfiability","year":"2009","key":"9_CR6","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook on Satisfiability. IOS Press, Amsterdam (2009)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1142\/S0129054119400021","volume":"30","author":"M Bondt de","year":"2019","unstructured":"de Bondt, M., Don, H., Zantema, H.: Lower bounds for synchronizing word lengths in partial automata. Int. J. Foundations Comput. Sci. 30(1), 29\u201360 (2019). \n                    https:\/\/doi.org\/10.1142\/S0129054119400021","journal-title":"Int. J. Foundations Comput. Sci."},{"key":"9_CR8","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). \n                    https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"9_CR9","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: The MiniSat Page. \n                    http:\/\/minisat.se"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1574-6526(07)03002-7","volume-title":"Handbook of Knowledge Representation","author":"CP Gomes","year":"2008","unstructured":"Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability solvers. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, vol. I, pp. 89\u2013134. Elsevier, Amsterdam (2008). \n                    https:\/\/doi.org\/10.1016\/S1574-6526(07)03002-7"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1051\/ita\/1982160403651","volume":"16","author":"P Goral\u010d\u00edk","year":"1982","unstructured":"Goral\u010d\u00edk, P., Hedrl\u00edn, Z., Koubek, V., Ry\u0161linkov\u00e1, J.: A game of composing binary relations. RAIRO Inform. Th\u00e9or. 16(4), 365\u2013369 (1982)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"9_CR12","unstructured":"G\u00fcni\u00e7en, C., Erdem, E., Yenig\u00fcn, H.: Generating shortest synchronizing sequences using answer set programming. In: Fink, M., Lierler, Y. (eds.) Answer Set Programming and Other Computing Paradigms, 6th International Workshop, ASPOCP 2013, pp. 117\u2013127 (2013). \n                    https:\/\/arxiv.org\/abs\/1312.6146"},{"key":"9_CR13","first-page":"105","volume":"14","author":"B Imreh","year":"1999","unstructured":"Imreh, B., Steinby, M.: Directable nondeterministic automata. Acta Cybernetica 14, 105\u2013115 (1999)","journal-title":"Acta Cybernetica"},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.1142\/4791","volume-title":"Algebraic Theory of Automata and Languages","author":"M Ito","year":"2004","unstructured":"Ito, M.: Algebraic Theory of Automata and Languages. World Scientific, Singapore (2004). \n                    https:\/\/doi.org\/10.1142\/4791"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-27812-2_12","volume-title":"Theory Is Forever","author":"M Ito","year":"2004","unstructured":"Ito, M., Shikishima-Tsuji, K.: Some results on directable automata. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 125\u2013133. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-27812-2_12"},{"issue":"21","key":"9_CR16","doi-asserted-by":"publisher","first-page":"4900","DOI":"10.1016\/j.disc.2007.09.010","volume":"308","author":"M Ito","year":"2008","unstructured":"Ito, M., Shikishima-Tsuji, K.: Shortest directing words of nondeterministic directable automata. Discrete Math. 308(21), 4900\u20134905 (2008). \n                    https:\/\/doi.org\/10.1016\/j.disc.2007.09.010","journal-title":"Discrete Math."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-319-47443-4_7","volume-title":"Testing Software and Systems","author":"S Karahoda","year":"2016","unstructured":"Karahoda, S., Erenay, O.T., Kaya, K., T\u00fcrker, U.C., Yenig\u00fcn, H.: Parallelizing heuristics for generating synchronizing sequences. In: Wotawa, F., Nica, M., Kushik, N. (eds.) ICTSS 2016. LNCS, vol. 9976, pp. 106\u2013122. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-47443-4_7"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.eswa.2017.10.054","volume":"94","author":"S Karahoda","year":"2018","unstructured":"Karahoda, S., Kaya, K., Yenig\u00fcn, H.: Synchronizing heuristics: speeding up the fastest. Expert Syst. Appl. 94, 265\u2013275 (2018). \n                    https:\/\/doi.org\/10.1016\/j.eswa.2017.10.054","journal-title":"Expert Syst. Appl."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-319-55849-3_40","volume-title":"Applications of Evolutionary Computation","author":"J Kowalski","year":"2017","unstructured":"Kowalski, J., Roman, A.: A new evolutionary algorithm for synchronization. In: Squillero, G., Sim, K. (eds.) EvoApplications 2017. LNCS, vol. 10199, pp. 620\u2013635. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-55849-3_40"},{"key":"9_CR20","unstructured":"Kari, J., Volkov, M.V.: \u010cern\u00fd\u2019s conjecture and the road coloring problem. In: Pin, J.-\u00c9 (ed.) Handbook of Automata Theory, vol. I. EMS Publishing House (in print)"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: Proceedings 27th Annual Symposium Foundations Computer Science, pp. 132\u2013142. IEEE Press (1986). \n                    https:\/\/doi.org\/10.1109\/SFCS.1986.5","DOI":"10.1109\/SFCS.1986.5"},{"issue":"6","key":"9_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1177\/027836498900800607","volume":"8","author":"BK Natarajan","year":"1989","unstructured":"Natarajan, B.K.: Some paradigms for the automated design of parts feeders. Int. J. Robot. Res. 8(6), 89\u2013109 (1989). \n                    https:\/\/doi.org\/10.1177\/027836498900800607","journal-title":"Int. J. Robot. Res."},{"issue":"4","key":"9_CR23","first-page":"44","volume":"15","author":"PV Martyugin","year":"2008","unstructured":"Martyugin, P.V.: Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata. Diskretn. Anal. Issled. Oper. 15(4), 44\u201356 (2008)","journal-title":"Diskretn. Anal. Issled. Oper."},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.3103\/S1066369X10010056","volume":"54","author":"PV Martyugin","year":"2010","unstructured":"Martyugin, P.V.: A lower bound for the length of the shortest carefully synchronizing words. Russian Math. 54(1), 46\u201354 (2010). \n                    https:\/\/doi.org\/10.3103\/S1066369X10010056\n                    \n                  . (Iz. VUZ)","journal-title":"Russian Math."},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-31606-7_24","volume-title":"Implementation and Application of Automata","author":"PV Martyugin","year":"2012","unstructured":"Martyugin, P.V.: Synchronization of automata with one undefined or ambiguous transition. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 278\u2013288. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-31606-7_24"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38536-0_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"PV Martyugin","year":"2013","unstructured":"Martyugin, P.V.: Careful synchronization of partial automata with restricted alphabets. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 76\u201387. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38536-0_7"},{"issue":"2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00224-013-9516-6","volume":"54","author":"PV Martyugin","year":"2014","unstructured":"Martyugin, P.V.: Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA. Theor. Comput. Syst. 54(2), 293\u2013304 (2014). \n                    https:\/\/doi.org\/10.1007\/s00224-013-9516-6","journal-title":"Theor. Comput. Syst."},{"key":"9_CR28","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"9_CR29","unstructured":"Pixley, C., Jeong, S.-W., Hachtel, G.D: Exact calculation of synchronization sequences based on binary decision diagrams. In: Proceedings 29th Design Automation Conference, pp. 620\u2013623. IEEE Press (1992)"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-29347-4_49","volume-title":"Artificial Intelligence and Soft Computing","author":"IT Podolak","year":"2012","unstructured":"Podolak, I.T., Roman, A., J\u0229drzjczyk, D.: Application of hierarchical classifier to minimal synchronizing word problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2012. LNCS, vol. 7267, pp. 421\u2013429. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29347-4_49"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.eswa.2017.12.043","volume":"97","author":"IT Podolak","year":"2018","unstructured":"Podolak, I.T., Roman, A., Szyku\u0142a, M., Zieli\u0144ski, B.: A machine learning approach to synchronization of automata. Expert Syst. Appl. 97, 357\u2013371 (2018). \n                    https:\/\/doi.org\/10.1016\/j.eswa.2017.12.043","journal-title":"Expert Syst. Appl."},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-642-00982-2_58","volume-title":"Language and Automata Theory and Applications","author":"A Roman","year":"2009","unstructured":"Roman, A.: Genetic algorithm for synchronization. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 684\u2013695. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-00982-2_58"},{"issue":"1","key":"9_CR33","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/bf01069104","volume":"16","author":"IK Rystsov","year":"1980","unstructured":"Rystsov, I.K.: Asymptotic estimate of the length of a diagnostic word for a finite automaton. Cybernetics 16(1), 194\u2013198 (1980). \n                    https:\/\/doi.org\/10.1007\/bf01069104","journal-title":"Cybernetics"},{"issue":"3","key":"9_CR34","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(83)90067-4","volume":"16","author":"IK Rystsov","year":"1983","unstructured":"Rystsov, I.K.: Polynomial complete problems in automata theory. Inf. Process. Lett. 16(3), 147\u2013151 (1983). \n                    https:\/\/doi.org\/10.1016\/0020-0190(83)90067-4","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9_CR35","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/s0304-3975(96)00136-3","volume":"172","author":"IK Rystsov","year":"1997","unstructured":"Rystsov, I.K.: Reset words for commutative and solvable automata. Theor. Comput. Sci. 172(1), 273\u2013279 (1997). \n                    https:\/\/doi.org\/10.1016\/s0304-3975(96)00136-3","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR36","doi-asserted-by":"publisher","first-page":"99","DOI":"10.15826\/umj.2018.2.011","volume":"4","author":"H Shabana","year":"2018","unstructured":"Shabana, H.: \n                    \n                      \n                    \n                    $$D_2$$\n                  -synchronization in nondeterministic automata. Ural Math. J. 4(2), 99\u2013110 (2018). \n                    https:\/\/doi.org\/10.15826\/umj.2018.2.011","journal-title":"Ural Math. J."},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.17377\/semi.2018.15.117","volume":"15","author":"H Shabana","year":"2018","unstructured":"Shabana, H., Volkov, M.V.: Using Sat solvers for synchronization issues in nondeterministic automata. Siberian Electron. Math. Rep. 15, 1426\u20131442 (2018). \n                    https:\/\/doi.org\/10.17377\/semi.2018.15.117","journal-title":"Siberian Electron. Math. Rep."},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-22256-6_27","volume-title":"Implementation and Application of Automata","author":"E Skvortsov","year":"2011","unstructured":"Skvortsov, E., Tipikin, E.: Experimental study of the shortest reset word of random automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 290\u2013298. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22256-6_27"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd Conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11\u201327. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88282-4_4"}],"container-title":["Communications in Computer and Information Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33394-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T17:21:13Z","timestamp":1572456073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33394-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030333935","9783030333942"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33394-2_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","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":"170","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":"40","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":"24% - 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.34","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":"2.64","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)"}}]}}