{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:23:43Z","timestamp":1768163023173,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030310943","type":"print"},{"value":"9783030310950","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-31095-0_5","type":"book-chapter","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:02:53Z","timestamp":1568376173000},"page":"67-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An ASP-based Solution for Operating Room Scheduling with Beds Management"],"prefix":"10.1007","author":[{"given":"Carmine","family":"Dodaro","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Galat\u00e0","sequence":"additional","affiliation":[]},{"given":"Muhammad Kamran","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Porro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.promfg.2016.08.005","volume":"5","author":"A Abedini","year":"2016","unstructured":"Abedini, A., Ye, H., Li, W.: Operating room planning under surgery type and priority constraints. Procedia Manufact. 5, 15\u201325 (2016)","journal-title":"Procedia Manufact."},{"key":"5_CR2","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 Advances in Artificial Intelligence. LNCS, pp. 468\u2013482. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-70169-1_35"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.3233\/IA-170030","volume":"12","author":"M Alviano","year":"2018","unstructured":"Alviano, M., Dodaro, C., Maratea, M.: Nurse (re)scheduling via answer set programming. Intelligenza Artificiale 12(2), 109\u2013124 (2018)","journal-title":"Intelligenza Artificiale"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Alviano, M., Dodaro, C., Marques-Silva, J., Ricca, F.: Optimum stable model search: Algorithms and implementation. J. Log. Comput. \n                      https:\/\/doi.org\/10.1093\/logcom\/exv061\n                      \n                     (in press)","DOI":"10.1093\/logcom\/exv061"},{"key":"5_CR5","unstructured":"Amendola, G.: Preliminary results on modeling interdependent scheduling games via answer set programming. In: RiCeRcA@AI*IA CEUR Workshop Proceedings, vol. 2272. CEUR-WS.org (2018)"},{"key":"5_CR6","unstructured":"Amendola, G.: Solving the stable roommates problem using incoherent answer set programs. In: RiCeRcA@AI*IA CEUR Workshop Proceedings, vol. 2272. CEUR-WS.org (2018)"},{"key":"5_CR7","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-49130-1_13"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.cor.2014.08.014","volume":"54","author":"R Aringhieri","year":"2015","unstructured":"Aringhieri, R., Landa, P., Soriano, P., T\u00e0nfani, E., Testi, A.: A two level metaheuristic for the operating room scheduling and assignment problem. Comput. Oper. Res. 54, 21\u201334 (2015)","journal-title":"Comput. Oper. Res."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.endm.2014.11.023","volume":"47","author":"R Aringhieri","year":"2015","unstructured":"Aringhieri, R., Landa, P., T\u00e0nfani, E.: Assigning surgery cases to operating rooms: A VNS approach for leveling ward beds occupancies. Electron. Notes Discrete Math. 47, 173\u2013180 (2015). \n                      https:\/\/doi.org\/10.1016\/j.endm.2014.11.023","journal-title":"Electron. Notes Discrete Math."},{"key":"5_CR10","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). \n                      https:\/\/doi.org\/10.1017\/CBO9780511543357"},{"issue":"12","key":"5_CR11","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":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"F Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845\u2013860 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR13","unstructured":"Calimeri, F., et al.: ASP-Core-2 Input Language Format (2013). \n                      https:\/\/www.mat.unical.it\/aspcomp2013\/files\/ASP-CORE-2.01c.pdf"},{"key":"5_CR14","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":"5_CR15","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). \n                      https:\/\/doi.org\/10.1007\/978-3-030-03840-3_33"},{"key":"5_CR16","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-61660-5_27"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011)","journal-title":"Artif. Intell."},{"key":"5_CR18","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":"5_CR19","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":"5_CR20","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."},{"key":"5_CR21","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, 15\u201319 August 1988, vol. 2, pp. 1070\u20131080. MIT Press (1988)"},{"issue":"3\/4","key":"5_CR22","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)","journal-title":"New Gener. Comput."},{"key":"5_CR23","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). \n                      https:\/\/doi.org\/10.1007\/3-540-45757-7_25"},{"key":"5_CR24","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-45193-8_64"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.orhc.2016.01.001","volume":"8","author":"P Landa","year":"2016","unstructured":"Landa, P., Aringhieri, R., Soriano, P., T\u00e0nfani, E., Testi, A.: A hybrid optimization algorithm for surgeries scheduling. Oper. Res. Health Care 8, 103\u2013114 (2016)","journal-title":"Oper. Res. Health Care"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.cie.2015.10.002","volume":"90","author":"JM Molina-Pariente","year":"2015","unstructured":"Molina-Pariente, J.M., Hans, E.W., Framinan, J.M., Gomez-Cia, T.: New heuristics for planning operating rooms. Comput. Ind. Eng. 90, 429\u2013443 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"3\u20134","key":"5_CR27","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. Ann. Math. Artif. Intell. 25(3\u20134), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"5_CR28","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":"5_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, J., Dridi, M., El Moudni, A.: A stochastic shortest-path MDP model with dead ends for operating rooms planning. In: ICAC, pp. 1\u20136. IEEE (2017)","DOI":"10.23919\/IConAC.2017.8081974"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31095-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:03:39Z","timestamp":1568376219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31095-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310943","9783030310950"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31095-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","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":"Bolzano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.ruleml-rr.org","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":"26","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":"10","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":"5","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":"38% - 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","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)"}},{"value":"Authors were able to respond to the reviews.","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)"}}]}}