{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:20Z","timestamp":1776333500936,"version":"3.51.2"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030584740","type":"print"},{"value":"9783030584757","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_15","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"248-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Treewidth-Aware Quantifier Elimination and Expansion for QCSP"],"prefix":"10.1007","author":[{"given":"Johannes K.","family":"Fichte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian F. I.","family":"Kieler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.artint.2016.06.005","volume":"238","author":"D Allouche","year":"2016","unstructured":"Allouche, D., et al.: Tractability-preserving transformations of global cost functions. Artif. Intell. 238, 166\u2013189 (2016)","journal-title":"Artif. Intell."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1613\/jair.3152","volume":"40","author":"A Atserias","year":"2011","unstructured":"Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. J. Artif. Intell. Res. 40, 353\u2013373 (2011)","journal-title":"J. Artif. Intell. Res."},{"issue":"7","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1016\/j.jcss.2014.04.014","volume":"80","author":"A Atserias","year":"2014","unstructured":"Atserias, A., Oliva, S.: Bounded-width QBF is PSPACE-complete. J. Comput. Syst. Sci. 80(7), 1415\u20131429 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-74970-7_13","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F Bacchus","year":"2007","unstructured":"Bacchus, F., Stergiou, K.: Solution directed backjumping for QCSP. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 148\u2013163. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_13"},{"key":"15_CR5","unstructured":"Beldiceanu, N., Demassey, S.: Global Constraint Catalog: 5.117. element (2020). https:\/\/web.imt-atlantique.fr\/x-info\/sdemasse\/gccat\/Celement.html"},{"key":"15_CR6","unstructured":"Benedetti, M., Lallouet, A., Vautard, J.: QCSP made practical by virtue of restricted quantification. In: IJCAI, pp. 38\u201343 (2007)"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0022-247X(69)90030-4","volume":"28","author":"U Bertel\u00e8","year":"1969","unstructured":"Bertel\u00e8, U., Brioschi, F.: Contribution to nonserial dynamic programming. J. Math. Anal. Appl. 28(2), 313\u2013325 (1969)","journal-title":"J. Math. Anal. Appl."},{"key":"15_CR8","volume-title":"Nonserial Dynamic Programming","author":"U Bertel\u00e8","year":"1972","unstructured":"Bertel\u00e8, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press Inc., Cambridge (1972)"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0097-3165(73)90016-2","volume":"14","author":"U Bertel\u00e8","year":"1973","unstructured":"Bertel\u00e8, U., Brioschi, F.: On Non-serial dynamic programming. J. Comb. Theory Ser. A 14(2), 137\u2013148 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"6","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, Heidelberg (2008)"},{"issue":"1\u20132","key":"15_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2019-1810","volume":"167","author":"G Charwat","year":"2019","unstructured":"Charwat, G., Woltran, S.: Expansion-based QBF solving on tree decompositions. Fundamenta Informaticae 167(1\u20132), 59\u201392 (2019)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR14","unstructured":"Chen, H.: Quantified constraint satisfaction and bounded treewidth. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), vol. IOS Press, pp. 161\u2013170 (2004)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-92800-3_2","volume-title":"Complexity of Constraints","author":"N Creignou","year":"2008","unstructured":"Creignou, N., Vollmer, H.: Boolean constraint satisfaction problems: when does Post\u2019s lattice help? In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 3\u201337. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92800-3_2"},{"key":"15_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"15_CR17","unstructured":"Dechter, R.: Tractable structures for constraint satisfaction problems. In: Handbook of Constraint Programming, vol. I, pp. 209\u2013244. Elsevier (2006). (Chap. 7)"},{"key":"15_CR18","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"15_CR19","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.03.005","volume":"186","author":"W Dvo\u0159\u00e1k","year":"2012","unstructured":"Dvo\u0159\u00e1k, W., Pichler, R., Woltran, S.: Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell. 186, 1\u201337 (2012)","journal-title":"Artif. Intell."},{"key":"15_CR21","unstructured":"Ferguson, A., O\u2019Sullivan, B.: Quantified constraint satisfaction problems: from relaxations to explanations. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 74\u201379. The AAAI Press (2007)"},{"key":"15_CR22","unstructured":"Fichte, J.K., Hecher, M., Morak, M., Woltran, S.: DynASP2.5: dynamic programming on tree decompositions in action. In: Lokshtanov, D., Nishimura, N. (eds.) Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Dagstuhl Publishing (2017)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Pfandler, A.: Lower bounds for QBFs of bounded treewidth. In: Kobayashi, N. (ed.) Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2020), pp. 410\u2013424. ACM (2020)","DOI":"10.1145\/3373718.3394756"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-39197-3_10","volume-title":"Practical Aspects of Declarative Languages","author":"JK Fichte","year":"2020","unstructured":"Fichte, J.K., Hecher, M., Thier, P., Woltran, S.: Exploiting database management systems and treewidth for counting. In: Komendantskaya, E., Liu, Y.A. (eds.) PADL 2020. LNCS, vol. 12007, pp. 151\u2013167. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39197-3_10"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-030-30048-7_29","volume-title":"Principles and Practice of Constraint Programming","author":"JK Fichte","year":"2019","unstructured":"Fichte, J.K., Hecher, M., Zisser, M.: An improved GPU-based SAT model counter. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 491\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_29"},{"key":"15_CR26","unstructured":"Fichte, J.K., Hecher, M., Woltran, S., Zisser, M.: Weighted model counting on the GPU by exploiting small treewidth. In: Azar, Y., Bast, H., Herman, G. (eds.) Proceedings of the 26th Annual European Symposium on Algorithms (ESA 2018). LIPIcs, vol. 112, pp. 28:1\u201328:16. Dagstuhl Publishing (2018)"},{"key":"15_CR27","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"4","key":"15_CR28","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"EC Freuder","year":"1985","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-bounded search. J. ACM 32(4), 755\u2013761 (1985)","journal-title":"J. ACM"},{"key":"15_CR29","unstructured":"Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-solve: a solver for quantified constraint satisfaction problems. In: IJCAI, pp. 138\u2013143. Professional Book Center (2005)"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Godet, A., Lorca, X., Hebrard, E., Simonin, G.: Using approximation within constraint programming to solve the parallel machine scheduling problem with additional unit resources. In: Conitzer, V., Sha, F. (eds.) Proceedings of the 34th AAAI Conference on Artificial Intelligence. The AAAI Press, New York (2020)","DOI":"10.1609\/aaai.v34i02.5510"},{"key":"15_CR31","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: The complexity of quantified constraint satisfaction problems under structural restrictions. In: IJCAI, pp. 150\u2013155. Professional Book Center (2005)"},{"issue":"1","key":"15_CR32","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.artint.2009.10.003","volume":"174","author":"G Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell. 174(1), 105\u2013132 (2010)","journal-title":"Artif. Intell."},{"key":"15_CR33","unstructured":"Hecher, M., Fichte, J.K., Kieler, M.F.I.: Supplemental material of this submission, containing proofs of theorems marked with \u201c$$\\star $$\u201d (2020). Self-archived copy by the authors available online"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-030-51825-7_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"M Hecher","year":"2020","unstructured":"Hecher, M., Thier, P., Woltran, S.: Taming high treewidth with abstraction, nested dynamic programming, and database technology. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 343\u2013360. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_25"},{"key":"15_CR35","unstructured":"Hemaspaandra, E.: Dichotomy theorems for alternation-bounded quantified Boolean formulas. CoRR cs.CC\/0406006 (2004). http:\/\/arxiv.org\/abs\/cs\/0406006"},{"issue":"2","key":"15_CR36","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s10601-017-9280-3","volume":"23","author":"JN Hooker","year":"2017","unstructured":"Hooker, J.N., van Hoeve, W.-J.: Constraint programming and operations research. Constraints 23(2), 172\u2013195 (2017). https:\/\/doi.org\/10.1007\/s10601-017-9280-3","journal-title":"Constraints"},{"issue":"4","key":"15_CR37","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"15_CR38","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"P J\u00e9gou","year":"2003","unstructured":"J\u00e9gou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell. 146(1), 43\u201375 (2003)","journal-title":"Artif. Intell."},{"key":"15_CR39","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"15_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth: Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Kuo, C., Ravi, S.S., Dao, T., Vrain, C., Davidson, I.: A framework for minimal clustering modification via constraint programming. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the 31st AAAI Conference on Artificial Intelligence, pp. 1389\u20131395. The AAAI Press, San Francisco (2017)","DOI":"10.1609\/aaai.v31i1.10765"},{"key":"15_CR42","unstructured":"Lampis, M., Mitsou, V.: Treewidth with a quantifier alternation revisited. In: Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). LIPIcs, vol. 89, pp. 26:1\u201326:12. Dagstuhl Publishing (2017)"},{"key":"15_CR43","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1613\/jair.3744","volume":"46","author":"S Ordyniak","year":"2013","unstructured":"Ordyniak, S., Szeider, S.: Parameterized complexity results for exact Bayesian network structure learning. J. Artif. Intell. Res. 46, 263\u2013302 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"15_CR44","doi-asserted-by":"publisher","first-page":"211","DOI":"10.3233\/AIC-2012-0531","volume":"25","author":"L Otten","year":"2012","unstructured":"Otten, L., Dechter, R.: Anytime AND\/OR depth-first search for combinatorial optimization. AI Commun. 25(3), 211\u2013227 (2012)","journal-title":"AI Commun."},{"key":"15_CR45","unstructured":"Pan, G., Vardi, M.Y.: Fixed-parameter hierarchies inside PSPACE. In: LICS, pp. 27\u201336. IEEE Computer Society (2006)"},{"key":"15_CR46","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"15_CR47","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-17511-4_22","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R Pichler","year":"2010","unstructured":"Pichler, R., R\u00fcmmele, S., Woltran, S.: Counting and enumeration problems with bounded treewidth. In: Clarke, E.M., Voronkov, A. (eds.) LPAR 2010. LNCS (LNAI), vol. 6355, pp. 387\u2013404. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17511-4_22"},{"issue":"1","key":"15_CR48","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35(1), 39\u201361 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"15_CR49","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jda.2009.06.002","volume":"8","author":"M Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithms 8(1), 50\u201364 (2010)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:50:48Z","timestamp":1668639048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"122","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":"55","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":"45% - 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.13","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.47","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}