{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:04:33Z","timestamp":1743098673448,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031084201"},{"type":"electronic","value":"9783031084218"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08421-8_46","type":"book-chapter","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:02:38Z","timestamp":1658178158000},"page":"671-688","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2724-4342","authenticated-orcid":false,"given":"Simone","family":"Caruso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-4469","authenticated-orcid":false,"given":"Giuseppe","family":"Galat\u00e0","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5849-3667","authenticated-orcid":false,"given":"Marco","family":"Mochi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0601-8071","authenticated-orcid":false,"given":"Ivan","family":"Porro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"46_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-20528-7_1","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"D Abels","year":"2019","unstructured":"Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., Wanko, P.: Train scheduling with hybrid ASP. In: Balduccini, M., Lierler, Y., Woltran, S. (eds.) LPNMR 2019. LNCS, vol. 11481, pp. 3\u201317. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20528-7_1"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-20528-7_18","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2019","unstructured":"Alviano, M., Amendola, G., Dodaro, C., Leone, N., Maratea, M., Ricca, F.: Evaluation of disjunctive programs in WASP. In: Balduccini, M., Lierler, Y., Woltran, S. (eds.) LPNMR 2019. LNCS, vol. 11481, pp. 241\u2013255. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20528-7_18"},{"key":"46_CR3","unstructured":"Alviano, M., et al.: Answer set programming in healthcare: extended overview. In: IPS and RCRA 2020. CEUR Workshop Proceedings, vol. 2745. CEUR-WS.org (2020). http:\/\/ceur-ws.org\/Vol-2745\/paper7.pdf"},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-319-70169-1_35","volume-title":"AI*IA 2017 Advances in Artificial Intelligence","author":"M Alviano","year":"2017","unstructured":"Alviano, M., Dodaro, C., Maratea, M.: An advanced answer set programming encoding for nurse scheduling. In: Esposito, F., Basili, R., Ferilli, S., Lisi, F. (eds.) AI*IA 2017. LNCS, vol. 10640, pp. 468\u2013482. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70169-1_35"},{"issue":"2","key":"46_CR5","first-page":"109","volume":"12","author":"M Alviano","year":"2018","unstructured":"Alviano, M., Dodaro, C., Maratea, M.: Nurse (re)scheduling via answer set programming. Intell. Artif. 12(2), 109\u2013124 (2018)","journal-title":"Intell. Artif."},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-49130-1_13","volume-title":"AI*IA 2016 Advances in Artificial Intelligence","author":"G Amendola","year":"2016","unstructured":"Amendola, G., Dodaro, C., Leone, N., Ricca, F.: On the application of answer set programming to the conference paper assignment problem. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds.) AI*IA 2016. LNCS (LNAI), vol. 10037, pp. 164\u2013178. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49130-1_13"},{"issue":"3","key":"46_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.entcs.2004.06.065","volume":"125","author":"A Armando","year":"2005","unstructured":"Armando, A., Castellini, C., Giunchiglia, E., Idini, M., Maratea, M.: TSAT++: an open platform for satisfiability modulo theories. Electron. Notes Theor. Comput. Sci. 125(3), 25\u201336 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-20895-9_33","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Balduccini","year":"2011","unstructured":"Balduccini, M.: Industrial-size scheduling with ASP+CP. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 284\u2013296. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9_33"},{"issue":"2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S1471068419000450","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Logic Program. 20(2), 294\u2013309 (2020)","journal-title":"Theory Pract. Logic Program."},{"key":"46_CR10","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: The design of the fifth answer set programming competition. CoRR abs\/1405.3710 (2014). http:\/\/arxiv.org\/abs\/1405.3710"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.artint.2015.09.008","volume":"231","author":"F Calimeri","year":"2016","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151\u2013181 (2016)","journal-title":"Artif. Intell."},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-91167-6_8","volume-title":"Rules and Reasoning","author":"M Cardellini","year":"2021","unstructured":"Cardellini, M., et al.: A two-phase ASP encoding for solving rehabilitation scheduling. In: Moschoyiannis, S., Pe\u00f1aloza, R., Vanthienen, J., Soylu, A., Roman, D. (eds.) RuleML+RR 2021. LNCS, vol. 12851, pp. 111\u2013125. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91167-6_8"},{"key":"46_CR13","unstructured":"Caruso, S., Galat\u00e0, G., Maratea, M., Mochi, M., Porro, I.: Scheduling pre-operative assessment clinic via answer set programming. In: Benedictis, R.D., et al. (eds.) Proceedings of the 9th Italian workshop on Planning and Scheduling (IPS 2021) and the 28th International Workshop on \u201cExperimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion\u201d (RCRA 2021). CEUR Workshop Proceedings, vol. 3065. CEUR-WS.org (2021)"},{"issue":"6","key":"46_CR14","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1017\/S1471068421000363","volume":"21","author":"C Dodaro","year":"2021","unstructured":"Dodaro, C., Galat\u00e0, G., Grioni, A., Maratea, M., Mochi, M., Porro, I.: An ASP-based solution to the chemotherapy treatment scheduling problem. Theory Pract. Log. Program. 21(6), 835\u2013851 (2021)","journal-title":"Theory Pract. Log. Program."},{"key":"46_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-31095-0_5","volume-title":"Rules and Reasoning","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Khan, M.K., Maratea, M., Porro, I.: An ASP-based solution for operating room scheduling with beds management. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds.) RuleML+RR 2019. LNCS, vol. 11784, pp. 67\u201381. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31095-0_5"},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-030-03840-3_33","volume-title":"AI*IA 2018 \u2013 Advances in Artificial Intelligence","author":"C Dodaro","year":"2018","unstructured":"Dodaro, C., Galat\u00e0, G., Maratea, M., Porro, I.: Operating room scheduling via answer set programming. In: Ghidini, C., Magnini, B., Passerini, A., Traverso, P. (eds.) AI*IA 2018. LNCS (LNAI), vol. 11298, pp. 445\u2013459. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03840-3_33"},{"issue":"1","key":"46_CR17","first-page":"63","volume":"13","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Maratea, M., Porro, I.: An ASP-based framework for operating room scheduling. Intell. Artif. 13(1), 63\u201377 (2019)","journal-title":"Intell. Artif."},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-61660-5_27","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Dodaro","year":"2017","unstructured":"Dodaro, C., Maratea, M.: Nurse scheduling via answer set programming. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 301\u2013307. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_27"},{"issue":"2","key":"46_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1093\/bja\/aem366","volume":"100","author":"GM Edward","year":"2008","unstructured":"Edward, G.M., et al.: Simulation to analyse planning difficulties at the preoperative assessment clinic. BJA: Br. J. Anaesthesia 100(2), 195\u2013202 (2008)","journal-title":"BJA: Br. J. Anaesthesia"},{"issue":"3","key":"46_CR20","first-page":"53","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53\u201368 (2016)","journal-title":"AI Mag."},{"issue":"2\u20133","key":"46_CR21","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s13218-018-0548-6","volume":"32","author":"AA Falkner","year":"2018","unstructured":"Falkner, A.A., Friedrich, G., Schekotihin, K., Taupe, R., Teppan, E.C.: Industrial applications of answer set programming. K\u00fcnstl. Intell. 32(2\u20133), 165\u2013176 (2018)","journal-title":"K\u00fcnstl. Intell."},{"issue":"4","key":"46_CR22","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1097\/00000542-200510000-00025","volume":"103","author":"M Ferschl","year":"2005","unstructured":"Ferschl, M., Tung, A., Sweitzer, B., Huo, D., Glick, D.: Preoperative clinic visits reduce operating room cancellations and delays. Anesthesiology 103(4), 855\u2013859 (2005)","journal-title":"Anesthesiology"},{"key":"46_CR23","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with Clingo 5. In: ICLP (Technical Communications). OASICS, vol. 52, pp. 2:1\u20132:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"46_CR24","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"46_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-61660-5_1","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2017","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The design of the seventh answer set programming competition. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 3\u20139. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_1"},{"key":"46_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1613\/jair.5373","volume":"60","author":"M Gebser","year":"2017","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The sixth answer set programming competition. J. Artif. Intell. Res. 60, 41\u201395 (2017)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"46_CR27","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1017\/S1471068419000061","volume":"20","author":"M Gebser","year":"2020","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The seventh answer set programming competition: design and results. Theory Pract. Log. Program. 20(2), 176\u2013204 (2020)","journal-title":"Theory Pract. Log. Program."},{"issue":"3\u20134","key":"46_CR28","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1017\/S1471068418000182","volume":"18","author":"M Gebser","year":"2018","unstructured":"Gebser, M., Obermeier, P., Schaub, T., Ratsch-Heitmann, M., Runge, M.: Routing driverless transport vehicles in car assembly with answer set programming. Theory Pract. Log. Program. 18(3\u20134), 520\u2013534 (2018). https:\/\/doi.org\/10.1017\/S1471068418000182","journal-title":"Theory Pract. Log. Program."},{"issue":"1\u20134","key":"46_CR29","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10472-009-9113-1","volume":"53","author":"E Giunchiglia","year":"2008","unstructured":"Giunchiglia, E., Leone, N., Maratea, M.: On the relation among answer set solvers. Ann. Math. Artif. Intell. 53(1\u20134), 169\u2013204 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"46_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11562931_6","volume-title":"Logic Programming","author":"E Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Maratea, M.: On the relation between answer set and sat procedures (or, between cmodels and smodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 37\u201351. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562931_6"},{"key":"46_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-45757-7_25","volume-title":"Logics in Artificial Intelligence","author":"E Giunchiglia","year":"2002","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A.: Dependent and independent variables in propositional satisfiability. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 296\u2013307. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45757-7_25"},{"key":"46_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/978-3-540-45193-8_64","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"E Giunchiglia","year":"2003","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A.: (In)effectiveness of look-ahead techniques in a modern SAT solver. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 842\u2013846. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_64"},{"key":"46_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-45744-5_26","volume-title":"Automated Reasoning","author":"E Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A., Zambonin, D.: Evaluating search heuristics and optimization techniques in propositional satisfiability. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 347\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_26"},{"issue":"1","key":"46_CR34","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1097\/ALN.0b013e3181c617cb","volume":"112","author":"MP Harnett","year":"2010","unstructured":"Harnett, M.P., Correll, D., Hurwitz, S., Bader, A., Hepner, D.: Improving efficiency and patient satisfaction in a tertiary teaching hospital preoperative clinic. Anesthesiology 112(1), 66\u201372 (2010)","journal-title":"Anesthesiology"},{"issue":"3","key":"46_CR35","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S147106841100007X","volume":"12","author":"F Ricca","year":"2012","unstructured":"Ricca, F., et al.: Team-building with answer set programming in the Gioia-Tauro seaport. Theory Pract. Log. Program. 12(3), 361\u2013381 (2012)","journal-title":"Theory Pract. Log. Program."},{"key":"46_CR36","unstructured":"Rosa, E.D., Giunchiglia, E., Maratea, M.: A new approach for solving satisfiability problems with qualitative preferences. In: Ghallab, M., Spyropoulos, C.D., Fakotakis, N., Avouris, N.M. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 510\u2013514. IOS Press (2008)"},{"issue":"2\u20133","key":"46_CR37","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s13218-018-0542-z","volume":"32","author":"P Sch\u00fcller","year":"2018","unstructured":"Sch\u00fcller, P.: Answer set programming in linguistics. K\u00fcnstliche Intell. 32(2\u20133), 151\u2013155 (2018). https:\/\/doi.org\/10.1007\/s13218-018-0542-z","journal-title":"K\u00fcnstliche Intell."},{"key":"46_CR38","doi-asserted-by":"publisher","unstructured":"Stark, C., Gent, A., Kirkland, L.: Improving patient flow in pre-operative assessment. BMJ Open Qual. 4(1) (2015). https:\/\/doi.org\/10.1136\/bmjquality.u201341.w1226","DOI":"10.1136\/bmjquality.u201341.w1226"},{"key":"46_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4137\/HSI.S40540","volume":"2016","author":"H Tariq","year":"2016","unstructured":"Tariq, H., et al.: Development, functioning, and effectiveness of a preoperative risk assessment clinic. Health Serv. Insights 2016, 1 (2016). https:\/\/doi.org\/10.4137\/HSI.S40540","journal-title":"Health Serv. Insights"},{"issue":"9","key":"46_CR40","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1080\/10245332.2017.1318336","volume":"22","author":"CL Woodrum","year":"2017","unstructured":"Woodrum, C.L., Wisniewski, M., Triulzi, D.J., Waters, J.H., Alarcon, L.H., Yazer, M.H.: The effects of a data driven maximum surgical blood ordering schedule on preoperative blood ordering practices. Hematology 22(9), 571\u2013577 (2017)","journal-title":"Hematology"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2021 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08421-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:08:48Z","timestamp":1658178528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08421-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031084201","9783031084218"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08421-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2021.disco.unimib.it\/","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":"58","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":"36","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":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","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","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)"}}]}}