{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T13:00:22Z","timestamp":1761310822779,"version":"build-2065373602"},"reference-count":47,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"unspecified","delay-in-days":52,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The operating room scheduling (ORS) problem deals with the optimization of daily operating room surgery schedules. It is a challenging problem subject to many constraints, like to determine the starting time of different surgeries and allocating the required resources, including the availability of beds in different department units. Recently, solutions to this problem based on answer set programming (ASP) have been delivered. Such solutions are overall satisfying but, when applied to real data, they can currently only verify whether the encoding aligns with the actual data and, at most, suggest alternative schedules that could have been computed. As a consequence, it is not currently possible to generate provisional schedules. Furthermore, the resulting schedules are not always robust. In this paper, we integrate inductive and deductive techniques for solving these issues. We first employ machine learning algorithms to predict the surgery duration, from historical data, to compute provisional schedules. Then, we consider the confidence of such predictions as an additional input to our problem and update the encoding correspondingly in order to compute more robust schedules. Results on historical data from the ASL1 Liguria in Italy confirm the viability of our integration.<\/jats:p>","DOI":"10.1017\/s1471068425100136","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T07:39:21Z","timestamp":1755848361000},"page":"558-578","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Improving ASP-Based ORS Schedules through Machine Learning Predictions"],"prefix":"10.1017","volume":"25","author":[{"given":"PIERANGELA","family":"BRUNO","sequence":"first","affiliation":[{"name":"DeMaCS, University of Calabria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"CARMINE","family":"DODARO","sequence":"additional","affiliation":[{"name":"DeMaCS, University of Calabria"}]},{"given":"GIUSEPPE","family":"GALAT\u00c0","sequence":"additional","affiliation":[{"name":"SurgiQ srl"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"MARCO","family":"MARATEA","sequence":"additional","affiliation":[{"name":"DeMaCS, University of Calabria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5849-3667","authenticated-orcid":false,"given":"MARCO","family":"MOCHI","sequence":"additional","affiliation":[{"name":"SurgiQ srl"}]}],"member":"56","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"doi-asserted-by":"publisher","key":"S1471068425100136_ref10","DOI":"10.1023\/A:1010933404324"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref5","DOI":"10.1016\/j.cor.2014.08.014"},{"key":"S1471068425100136_ref23","first-page":"3668","volume-title":"IJCAI","author":"Eiter","year":"2023"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref9","DOI":"10.1109\/TNNLS.2022.3229161"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref19","DOI":"10.1017\/S1471068421000090"},{"unstructured":"Law, M. , Russo, A. and Broda, K. 2020. The ILASP system for inductive learning of answer set programs. CoRR. https:\/\/arxiv.org\/abs\/2005.00904.","key":"S1471068425100136_ref35"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref31","DOI":"10.1109\/ACCESS.2024.3433513"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref1","DOI":"10.1016\/j.promfg.2016.08.005"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref20","DOI":"10.3233\/IA-190020"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref27","DOI":"10.1017\/S1471068422000163"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref38","DOI":"10.1016\/j.jclinane.2010.02.003"},{"key":"S1471068425100136_ref15","first-page":"785","volume-title":"SIGKDD","author":"Chen","year":"2016"},{"key":"S1471068425100136_ref16","first-page":"3586","volume-title":"IJCAI","author":"Cunnington","year":"2023"},{"key":"S1471068425100136_ref21","first-page":"145","volume-title":"LPNMR","volume":"13416","author":"Dodaro","year":"2022"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref18","DOI":"10.1093\/logcom\/exae041"},{"key":"S1471068425100136_ref13","first-page":"505","volume-title":"LPNMR","volume":"13416","author":"Bruno","year":"2022"},{"key":"S1471068425100136_ref22","first-page":"9","volume-title":"Advances in Neural Information Processing Systems","author":"Drucker","year":"1996"},{"key":"S1471068425100136_ref46","first-page":"1755","volume-title":"IJCAI","author":"Yang","year":"2020"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref40","DOI":"10.1016\/j.dss.2012.10.019"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref39","DOI":"10.1017\/S1471068413000094"},{"key":"S1471068425100136_ref26","volume-title":"IPS and RCRA","volume":"3065","author":"Galat\u00e0","year":"2021"},{"key":"S1471068425100136_ref36","first-page":"415","volume-title":"LPNMR","volume":"13416","author":"Liu","year":"2022"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref34","DOI":"10.1016\/j.orhc.2016.01.001"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref7","DOI":"10.1017\/S1471068423000170"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref6","DOI":"10.3233\/AIC-2011-0493"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref25","DOI":"10.1214\/aos\/1013203451"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref33","DOI":"10.1007\/978-1-4614-6849-3_3"},{"unstructured":"Kingma, D. P. and Ba, J. 2015. Adam: A method for stochastic optimization. In ICLR. http:\/\/arxiv.org\/abs\/1412.6980.","key":"S1471068425100136_ref32"},{"key":"S1471068425100136_ref47","first-page":"1","volume-title":"ICAC","author":"Zhang","year":"2017"},{"key":"S1471068425100136_ref28","first-page":"5341394","article-title":"Application of operational research techniques in operating room scheduling problems: literature overview","volume":"2018","author":"\u015eeyda","year":"2018","journal-title":"Journal of Healthcare Engineering"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref24","DOI":"10.1017\/S1471068422000229"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref44","DOI":"10.55576\/job.v2i4.23"},{"key":"S1471068425100136_ref2","first-page":"C1","volume-title":"Handbook of Neural Computation","author":"Almeida","year":"2020"},{"key":"S1471068425100136_ref11","first-page":"358","article-title":"Classification and regression","volume":"40","author":"Breiman","year":"1984","journal-title":"Trees"},{"key":"S1471068425100136_ref42","first-page":"5","article-title":"Neurosymbolic value-inspired artificial intelligence (why, what, and how)","volume":"39","author":"Sheth","year":"2024","journal-title":"IEEE Intelligent Systems"},{"key":"S1471068425100136_ref37","first-page":"4768","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Lundberg","year":"2017"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref43","DOI":"10.1016\/j.inffus.2021.11.011"},{"volume-title":"Springer Texts in Statistics","year":"2005","author":"Dekking","key":"S1471068425100136_ref17"},{"key":"S1471068425100136_ref8","first-page":"57","volume-title":"PADL","volume":"12007","author":"Basu","year":"2020"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref29","DOI":"10.1016\/j.cor.2019.04.010"},{"key":"S1471068425100136_ref45","first-page":"6541","volume-title":"AAAI","author":"Tarzariol","year":"2023"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref41","DOI":"10.3389\/frobt.2019.00125"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref30","DOI":"10.1017\/S1471068414000210"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref12","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068425100136_ref4","first-page":"6679","volume-title":"AAAI","author":"Arik","year":"2021"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref14","DOI":"10.1017\/S1471068419000450"},{"doi-asserted-by":"publisher","key":"S1471068425100136_ref3","DOI":"10.1080\/00031305.1992.10475879"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068425100136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T12:56:30Z","timestamp":1761310590000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068425100136\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["S1471068425100136"],"URL":"https:\/\/doi.org\/10.1017\/s1471068425100136","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2025,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}