{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:16Z","timestamp":1747173676921,"version":"3.40.5"},"reference-count":33,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T00:00:00Z","timestamp":1681689600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/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":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A core part of the rehabilitation scheduling process consists of planning rehabilitation physiotherapy sessions for patients, by assigning proper operators to them in a certain time slot of a given day, taking into account several legal, medical, and ethical requirements and optimizations, for example, patient\u2019s preferences and operator\u2019s work balancing. Being able to efficiently solve such problem is of upmost importance, in particular after the COVID-19 pandemic that significantly increased rehabilitation\u2019s needs. In this paper, we present a two-phase solution to rehabilitation scheduling based on Answer Set Programming, which proved to be an effective tool for solving practical scheduling problems. We first present a general encoding and then add domain-specific optimizations. Results of experiments performed on both synthetic and real benchmarks, the latter provided by ICS Maugeri, show the effectiveness of our solution as well as the impact of our domain-specific optimizations.<\/jats:p>","DOI":"10.1017\/s1471068423000030","type":"journal-article","created":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T10:21:47Z","timestamp":1681726907000},"page":"344-367","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["Solving Rehabilitation Scheduling Problems via a Two-Phase ASP Approach"],"prefix":"10.1017","volume":"24","author":[{"given":"MATTEO","family":"CARDELLINI","sequence":"first","affiliation":[]},{"given":"PAOLO","family":"DE NARDI","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"CARMINE","family":"DODARO","sequence":"additional","affiliation":[]},{"given":"GIUSEPPE","family":"GALAT\u00c0","sequence":"additional","affiliation":[]},{"given":"ANNA","family":"GIARDINI","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"MARCO","family":"MARATEA","sequence":"additional","affiliation":[]},{"given":"IVAN","family":"PORRO","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,4,17]]},"reference":[{"key":"S1471068423000030_ref21","doi-asserted-by":"publisher","DOI":"10.1080\/10170669.2012.703249"},{"key":"S1471068423000030_ref4","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2020-1974"},{"key":"S1471068423000030_ref24","doi-asserted-by":"crossref","unstructured":"Li, X. and Chen, H. 2021. Physical therapy scheduling of inpatients based on improved genetic algorithm. Journal of Physics: Conference Series, 1848, 1, 012009.","DOI":"10.1088\/1742-6596\/1848\/1\/012009"},{"key":"S1471068423000030_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"S1471068423000030_ref16","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Romero, J. and Schaub, T. Progress in clasp Series 3. In LPNMR 2015, vol. 9345 of LNCS. Springer, 368\u2013383.","DOI":"10.1007\/978-3-319-23264-5_31"},{"key":"S1471068423000030_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-6736(20)32340-0"},{"key":"S1471068423000030_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000182"},{"key":"S1471068423000030_ref2","unstructured":"Alviano, M. , Bertolucci, R. , Cardellini, M. , Dodaro, C. , Galat\u00e0, G. , Khan, M. K. , Maratea, M. , Mochi, M. , Morozan, V. , Porro, I. and Schouten, M. Answer set programming in healthcare: Extended overview. In Joint Proceedings of the 8th IPS Workshop and the 27th RCRA Workshop co-located with AIxIA 2020 2020, vol. 2745 of CEUR Workshop Proceedings. CEUR-WS.org."},{"key":"S1471068423000030_ref23","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190116"},{"key":"S1471068423000030_ref27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068423000030_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841600020X"},{"key":"S1471068423000030_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61660-5_27"},{"key":"S1471068423000030_ref19","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9, 3\/4, 365\u2013386.","DOI":"10.1007\/BF03037169"},{"key":"S1471068423000030_ref6","unstructured":"Ans\u00f3tegui, C. , Pacheco, T. and Pon, J. 2019. Pypblib."},{"key":"S1471068423000030_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"key":"S1471068423000030_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-011-0273-0"},{"key":"S1471068423000030_ref20","unstructured":"Gurobi Optimization, LLC 2021. Gurobi Optimizer Reference Manual."},{"key":"S1471068423000030_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.08.030"},{"key":"S1471068423000030_ref32","doi-asserted-by":"publisher","DOI":"10.3389\/fneur.2021.643251"},{"key":"S1471068423000030_ref5","unstructured":"Andres, B. , Kaufmann, B. , Matheis, O. and Schaub, T. Unsatisfiability-based optimization in clasp. In Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012 2012, vol. 17 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 211\u2013221."},{"key":"S1471068423000030_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"S1471068423000030_ref30","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841100007X"},{"key":"S1471068423000030_ref1","doi-asserted-by":"crossref","unstructured":"Alviano, M. , Amendola, G. , Dodaro, C. , Leone, N. , Maratea, M. , and Ricca, F. Evaluation of disjunctive programs in WASP. In LPNMR 2019 2019, vol. 11481 of LNCS. Springer, 241\u2013255.","DOI":"10.1007\/978-3-030-20528-7_18"},{"key":"S1471068423000030_ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2678"},{"key":"S1471068423000030_ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068423000030_ref15","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Ostrowski, M. , Schaub, T. and Wanko, P. Theory solving made easy with clingo 5. In M. Carro, A. King, N. Saeedloei and M. D. Vos, Eds., Proceedings of ICLP (Technical Communications) 2016, vol. 52 of OASICS. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2:1\u20132:15."},{"key":"S1471068423000030_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068423000030_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068421000363"},{"key":"S1471068423000030_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10428-7_41"},{"key":"S1471068423000030_ref25","doi-asserted-by":"crossref","unstructured":"Martins, R. , Manquinho, V. M. and Lynce, I. Open-wbo: A modular maxsat solver,. In SAT 2014 2014, vol. 8561 of LNCS. Springer, 438\u2013445.","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"S1471068423000030_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91167-6_8"},{"key":"S1471068423000030_ref28","unstructured":"Roussel, O. and Manquinho, V. 2012. Input\/Output Format and Solver Requirements for the Competitions of Pseudo-Boolean Solvers."},{"key":"S1471068423000030_ref31","doi-asserted-by":"crossref","unstructured":"Saikko, P. , Berg, J. and J\u00e4rvisalo, M. LMHS: A SAT-IP hybrid maxsat solver. In SAT 2016 2016, vol. 9710 of LNCS. Springer, 539\u2013546.","DOI":"10.1007\/978-3-319-40970-2_34"}],"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\/S1471068423000030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T04:15:40Z","timestamp":1710303340000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068423000030\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,17]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["S1471068423000030"],"URL":"https:\/\/doi.org\/10.1017\/s1471068423000030","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2023,4,17]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. 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 (http:\/\/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"}]}}