{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:24:14Z","timestamp":1763810654241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030911669"},{"type":"electronic","value":"9783030911676"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91167-6_8","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T14:13:49Z","timestamp":1638454429000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Two-Phase ASP Encoding for Solving Rehabilitation Scheduling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3788-9475","authenticated-orcid":false,"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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-4469","authenticated-orcid":false,"given":"Giuseppe","family":"Galat\u00e0","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":[]},{"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,1,1]]},"reference":[{"key":"8_CR1","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 (LPNMR 2019)","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, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-20528-7_18"},{"key":"8_CR2","unstructured":"Alviano, M., et al.: 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. CEUR Workshop Proceedings, vol. 2745. CEUR-WS.org (2020)"},{"issue":"3\u20134","key":"8_CR3","first-page":"271","volume":"176","author":"M Alviano","year":"2020","unstructured":"Alviano, M., Dodaro, C.: Unsatisfiable core analysis and aggregates for optimum stable model search. Fund. Inform. 176(3\u20134), 271\u2013297 (2020)","journal-title":"Fund. Inform."},{"key":"8_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":"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.A. (eds.) AI*IA 2017. LNCS, vol. 10640, pp. 468\u2013482. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70169-1_35"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1093\/logcom\/exv061","volume":"30","author":"M Alviano","year":"2020","unstructured":"Alviano, M., Dodaro, C., Marques-Silva, J., Ricca, F.: Optimum stable model search: algorithms and implementation. J. Log. Comput. 30(4), 863\u2013897 (2020)","journal-title":"J. Log. Comput."},{"key":"8_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003). https:\/\/doi.org\/10.1017\/CBO9780511543357"},{"issue":"12","key":"8_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"8_CR8","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."},{"issue":"10267","key":"8_CR9","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1016\/S0140-6736(20)32340-0","volume":"396","author":"A Cieza","year":"2020","unstructured":"Cieza, A., Causey, K., Kamenov, K., Hanson, S.W., Chatterji, S., Vos, T.: Global estimates of the need for rehabilitation based on the global burden of disease study 2019: a systematic analysis for the global burden of disease study 2019. Lancet 396(10267), 2006\u20132017 (2020)","journal-title":"Lancet"},{"key":"8_CR10","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"},{"key":"8_CR11","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Carro, M., King, A., Saeedloei, N., Vos, M.D. (eds.) Proceedings of ICLP (Technical Communications). OASICS, vol. 52, pp. 2:1\u20132:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-23264-5_31","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., Schaub, T.: Progress in clasp Series 3. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 368\u2013383. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_31"},{"key":"8_CR13","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":"8_CR14","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"},{"issue":"3\u20134","key":"8_CR15","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. Logic Program. 18(3\u20134), 520\u2013534 (2018)","journal-title":"Theory Pract. Logic Program."},{"issue":"3\/4","key":"8_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New. Gener. Comput. 9(3\/4), 365\u2013386 (1991). https:\/\/doi.org\/10.1007\/BF03037169","journal-title":"New. Gener. Comput."},{"key":"8_CR17","first-page":"348","volume":"29","author":"YC Huang","year":"2012","unstructured":"Huang, Y.C., Zheng, J.N., Chien, C.F.: Decision support system for rehabilitation scheduling to enhance the service quality and the effectiveness of hospital resource management. J. Chin. Inst. Ind. Eng. 29, 348\u2013363 (2012)","journal-title":"J. Chin. Inst. Ind. Eng."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.cie.2018.08.030","volume":"125","author":"NT Huynh","year":"2018","unstructured":"Huynh, N.T., Huang, Y.C., Chien, C.F.: A hybrid genetic algorithm with 2D encoding for the scheduling of rehabilitation patients. Comput. Ind. Eng. 125, 221\u2013231 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"8_CR19","first-page":"012009","volume":"1848","author":"X Li","year":"2021","unstructured":"Li, X., Chen, H.: Physical therapy scheduling of inpatients based on improved genetic algorithm. J. Phys.: Conf. Ser. 1848(1), 012009 (2021)","journal-title":"J. Phys.: Conf. Ser."},{"issue":"3\u20134","key":"8_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. AMAI 25(3\u20134), 241\u2013273 (1999). https:\/\/doi.org\/10.1023\/A:1018930122475","journal-title":"AMAI"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986). https:\/\/doi.org\/10.1007\/BF00116251","journal-title":"Mach. Learn."},{"issue":"3","key":"8_CR22","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. Logic Program. 12(3), 361\u2013381 (2012)","journal-title":"Theory Pract. Logic Program."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.3389\/fneur.2021.643251","volume":"12","author":"A Saverino","year":"2021","unstructured":"Saverino, A., Baiardi, P., Galata, G., Pedemonte, G., Vassallo, C., Pistarini, C.: The challenge of reorganizing rehabilitation services at the time of Covid-19 pandemic: a new digital and artificial intelligence platform to support team work in planning and delivering safe and high quality care. Front. Neurol. 12, 501 (2021)","journal-title":"Front. Neurol."},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00291-011-0273-0","volume":"34","author":"K Schimmelpfeng","year":"2012","unstructured":"Schimmelpfeng, K., Helber, S., Kasper, S.: Decision support for rehabilitation hospital scheduling. OR Spectr. 34(2), 461\u2013489 (2012). https:\/\/doi.org\/10.1007\/s00291-011-0273-0","journal-title":"OR Spectr."}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91167-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T14:29:24Z","timestamp":1638455364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91167-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030911669","9783030911676"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91167-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leuven","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/declarativeai2021.net\/ruleml-rr\/","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":"39","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":"17","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":"2","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":"44% - 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.9","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","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":"5 reviews were done by sub-reviewers, who were invited by individual PC members.","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)"}}]}}