{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:08:38Z","timestamp":1781071718430,"version":"3.54.1"},"publisher-location":"Cham","reference-count":56,"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_55","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"952-970","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Computing Optimal Decision Sets with\u00a0SAT"],"prefix":"10.1007","author":[{"given":"Jinqiang","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexey","family":"Ignatiev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Le Bodic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"55_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-02777-2_18","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"R As\u00edn","year":"2009","unstructured":"As\u00edn, R., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: Cardinality networks and their applications. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 167\u2013180. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_18"},{"key":"55_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-39071-5_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"G Audemard","year":"2013","unstructured":"Audemard, G., Lagniez, J.-M., Simon, L.: Improving glucose for incremental SAT solving with assumptions: application to MUS extraction. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 309\u2013317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39071-5_23"},{"key":"55_CR3","unstructured":"Australian Government.: Artificial Intelligence Roadmap, November 2019. https:\/\/data61.csiro.au\/en\/Our-Research\/Our-Work\/AI-Roadmap"},{"key":"55_CR4","first-page":"1803","volume":"11","author":"D Baehrens","year":"2010","unstructured":"Baehrens, D., Schroeter, T., Harmeling, S., Kawanabe, M., Hansen, K., M\u00fcller, K.: How to explain individual classification decisions. J. Mach. Learn. Res. 11, 1803\u20131831 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"55_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108\u2013122. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_8"},{"issue":"3","key":"55_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"55_CR7","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: AFIPS, vol. 32, pp. 307\u2013314 (1968)"},{"key":"55_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-04244-7_16","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Bessiere","year":"2009","unstructured":"Bessiere, C., Hebrard, E., O\u2019Sullivan, B.: Minimising decision tree size as combinatorial optimisation. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 173\u2013187. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_16"},{"key":"55_CR9","volume-title":"Handbook of Satisfiability","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)"},{"key":"55_CR10","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)"},{"key":"55_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0017011","volume-title":"Machine Learning \u2014 EWSL-91","author":"P Clark","year":"1991","unstructured":"Clark, P., Boswell, R.: Rule induction with CN2: some recent improvements. In: Kodratoff, Y. (ed.) EWSL 1991. LNCS, vol. 482, pp. 151\u2013163. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0017011"},{"key":"55_CR12","first-page":"261","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark, P., Niblett, T.: The CN2 induction algorithm. Mach. Learn. 3, 261\u2013283 (1989)","journal-title":"Mach. Learn."},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, W.: Fast effective rule induction. In: ICML, pp. 115\u2013123 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"key":"55_CR14","doi-asserted-by":"crossref","unstructured":"Darwiche, A.: Three modern roles for logic in AI. In: PODS, pp. 229\u2013243. ACM (2020)","DOI":"10.1145\/3375395.3389131"},{"key":"55_CR15","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Wei, D.: Boolean decision rules via column generation. In: NeurIPS, pp. 4660\u20134670 (2018)"},{"key":"55_CR16","unstructured":"Doshi-Velez, F., Kim, B.: A roadmap for a rigorous science of interpretability. arXiv preprint arXiv:1702.08608 (2017)"},{"key":"55_CR17","unstructured":"EU Data Protection Regulation.: Regulation (EU) 2016\/679 of the European Parliament and of the Council (2016). http:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/PDF\/?uri=CELEX:32016R0679&from=en"},{"key":"55_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.5714","volume":"61","author":"R Evans","year":"2018","unstructured":"Evans, R., Grefenstette, E.: Learning explanatory rules from noisy data. J. Artif. Intell. Res. 61, 1\u201364 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"55_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75197-7","volume-title":"Foundations of Rule Learning","author":"J F\u00fcrnkranz","year":"2012","unstructured":"F\u00fcrnkranz, J., Gamberger, D., Lavrac, N.: Foundations of Rule Learning. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-540-75197-7"},{"key":"55_CR20","doi-asserted-by":"crossref","unstructured":"Ghosh B., Meel, K.S.: IMLI: an incremental framework for MAXSAT-based learning of interpretable classification rules. In: AIES, pp. 203\u2013210. ACM (2019)","DOI":"10.1145\/3306618.3314283"},{"issue":"3","key":"55_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1609\/aimag.v38i3.2741","volume":"38","author":"B Goodman","year":"2017","unstructured":"Goodman, B., Flaxman, S.R.: European Union regulations on algorithmic decision-making and a \u201cright to explanation\u201d. AI Mag. 38(3), 50\u201357 (2017)","journal-title":"AI Mag."},{"issue":"6","key":"55_CR22","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MIS.2019.2957223","volume":"34","author":"R Guidotti","year":"2019","unstructured":"Guidotti, R., Monreale, A., Giannotti, F., Pedreschi, D., Ruggieri, S., Turini, F.: Factual and counterfactual explanations for black box decision making. IEEE Intell. Syst. 34(6), 14\u201323 (2019)","journal-title":"IEEE Intell. Syst."},{"issue":"5","key":"55_CR23","doi-asserted-by":"publisher","first-page":"93:1","DOI":"10.1145\/3236009","volume":"51","author":"R Guidotti","year":"2019","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. 51(5), 93:1\u201393:42 (2019)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"55_CR24","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1609\/aimag.v40i2.2850","volume":"40","author":"D Gunning","year":"2019","unstructured":"Gunning, D., Aha, D.: DARPA\u2019s explainable artificial intelligence (XAI) program. AI Mag. 40(2), 44\u201358 (2019)","journal-title":"AI Mag."},{"key":"55_CR25","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2012","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann, San Francisco (2012)","edition":"3"},{"key":"55_CR26","doi-asserted-by":"crossref","unstructured":"Ignatiev, A.: Towards trustable explainable AI. In: IJCAI, pp. 5154\u20135158 (2020)","DOI":"10.24963\/ijcai.2020\/726"},{"key":"55_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Ignatiev","year":"2018","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a python toolkit for prototyping with SAT oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26"},{"issue":"1","key":"55_CR28","first-page":"53","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: RC2: an efficient MaxSAT solver. J. Satisf. Boolean Model. Comput. 11(1), 53\u201364 (2019)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"55_CR29","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: Abduction-based explanations for machine learning models. In: AAAI, pp. 1511\u20131519 (2019)","DOI":"10.1609\/aaai.v33i01.33011511"},{"key":"55_CR30","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: On relating explanations and adversarial examples. In: NeurIPS, pp. 15857\u201315867 (2019)"},{"key":"55_CR31","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Pereira, F., Narodytska, N., Marques-Silva, J.: A SAT-based approach to learn explainable decision sets. In: IJCAR, pp. 627\u2013645 (2018)","DOI":"10.1007\/978-3-319-94205-6_41"},{"issue":"6245","key":"55_CR32","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1126\/science.aaa8415","volume":"349","author":"MI Jordan","year":"2015","unstructured":"Jordan, M.I., Mitchell, T.M.: Machine learning: trends, perspectives, and prospects. Science 349(6245), 255\u2013260 (2015)","journal-title":"Science"},{"key":"55_CR33","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581082","volume":"57","author":"AP Kamath","year":"1992","unstructured":"Kamath, A.P., Karmarkar, N., Ramakrishnan, K.G., Resende, M.G.C.: A continuous approach to inductive inference. Math. Program. 57, 215\u2013238 (1992)","journal-title":"Math. Program."},{"key":"55_CR34","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Bach, S.H., Leskovec, J.: Interpretable decision sets: a joint framework for description and prediction. In: KDD, pp. 1675\u20131684 (2016)","DOI":"10.1145\/2939672.2939874"},{"issue":"7553","key":"55_CR35","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436 (2015)","journal-title":"Nature"},{"key":"55_CR36","doi-asserted-by":"crossref","unstructured":"Li, O., Liu, H., Chen, C., Rudin, C.: Deep learning for case-based reasoning through prototypes: a neural network that explains its predictions. In: AAAI, February 2018","DOI":"10.1609\/aaai.v32i1.11771"},{"issue":"10","key":"55_CR37","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3233231","volume":"61","author":"ZC Lipton","year":"2018","unstructured":"Lipton, Z.C.: The mythos of model interpretability. Commun. ACM 61(10), 36\u201343 (2018)","journal-title":"Commun. ACM"},{"key":"55_CR38","unstructured":"Lundberg, S.M., Lee, S.: A unified approach to interpreting model predictions. In: NIPS, pp. 4765\u20134774 (2017)"},{"key":"55_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-98334-9_21","volume-title":"Principles and Practice of Constraint Programming","author":"D Maliotov","year":"2018","unstructured":"Maliotov, D., Meel, K.S.: MLIC: a MaxSAT-based framework for learning interpretable classification rules. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 312\u2013327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_21"},{"key":"55_CR40","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"issue":"7540","key":"55_CR41","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529 (2015)","journal-title":"Nature"},{"issue":"11","key":"55_CR42","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/3276742","volume":"61","author":"D Monroe","year":"2018","unstructured":"Monroe, D.: AI, explain yourself. Commun. ACM 61(11), 11\u201313 (2018)","journal-title":"Commun. ACM"},{"key":"55_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dsp.2017.10.011","volume":"73","author":"G Montavon","year":"2018","unstructured":"Montavon, G., Samek, W., M\u00fcller, K.: Methods for interpreting and understanding deep neural networks. Digit. Signal Proc. 73, 1\u201315 (2018)","journal-title":"Digit. Signal Proc."},{"key":"55_CR44","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Ignatiev, A., Pereira, F., Marques-Silva, J.: Learning optimal decision trees with SAT. In: IJCAI, pp. 1362\u20131368 (2018)","DOI":"10.24963\/ijcai.2018\/189"},{"key":"55_CR45","unstructured":"Orange: A component-based data mining framework. https:\/\/orange.biolab.si\/"},{"key":"55_CR46","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"55_CR47","volume-title":"C4.5: Programs for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kauffmann, San Mateo (1993)"},{"key":"55_CR48","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should I trust you?\u201d: explaining the predictions of any classifier. In: KDD, pp. 1135\u20131144 (2016)","DOI":"10.18653\/v1\/N16-3020"},{"key":"55_CR49","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin C.: Anchors: high-precision model-agnostic explanations. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11491"},{"issue":"3","key":"55_CR50","first-page":"229","volume":"2","author":"RL Rivest","year":"1987","unstructured":"Rivest, R.L.: Learning decision lists. Mach. Learn. 2(3), 229\u2013246 (1987)","journal-title":"Mach. Learn."},{"key":"55_CR51","unstructured":"SAT-based miner of smallest size decision sets. https:\/\/github.com\/alexeyignatiev\/minds"},{"key":"55_CR52","doi-asserted-by":"crossref","unstructured":"Shih, A., Choi, A., Darwiche, A.: A symbolic approach to explaining bayesian network classifiers. In: IJCAI, pp. 5103\u20135111 (2018)","DOI":"10.24963\/ijcai.2018\/708"},{"key":"55_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"key":"55_CR54","first-page":"115","volume-title":"Studies in Constructive Mathematics and Mathematical Logic, Part II","author":"GS Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 115\u2013125. Consultants Bureau, New York (1968)"},{"key":"55_CR55","unstructured":"UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu\/ml"},{"key":"55_CR56","unstructured":"Ruleset covering algorithms for transparent machine learning. https:\/\/github.com\/imoscovitz\/wittgenstein"}],"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_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:54:14Z","timestamp":1668639254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_55","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)"}}]}}