{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:12:23Z","timestamp":1763809943397,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030038397"},{"type":"electronic","value":"9783030038403"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03840-3_33","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T01:28:57Z","timestamp":1541640537000},"page":"445-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Operating Room Scheduling via Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Carmine","family":"Dodaro","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Galat\u00e0","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Porro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"33_CR1","first-page":"15","volume":"5","author":"A Abedini","year":"2016","unstructured":"Abedini, A., Ye, H., Li, W.: Operating room planning under surgery type and priority constraints. Proc. Manuf. 5, 15\u201325 (2016)","journal-title":"Proc. Manuf."},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2016-1396","volume":"147","author":"M Abseher","year":"2016","unstructured":"Abseher, M., Gebser, M., Musliu, N., Schaub, T., Woltran, S.: Shift design with answer set programming. Fundam. Inf. 147(1), 1\u201325 (2016)","journal-title":"Fundam. Inf."},{"issue":"5\u20136","key":"33_CR3","first-page":"533","volume":"16","author":"M Alviano","year":"2016","unstructured":"Alviano, M., Dodaro, C.: Anytime answer set optimization via unsatisfiable core shrinking. TPLP 16(5\u20136), 533\u2013551 (2016)","journal-title":"TPLP"},{"key":"33_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"},{"key":"33_CR5","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":"33_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/3-540-45402-0_39","volume-title":"Logic Programming and Nonmotonic Reasoning","author":"M Balduccini","year":"2001","unstructured":"Balduccini, M., Gelfond, M., Watson, R., Nogueira, M.: The USA-advisor: a case study in answer set planning. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 439\u2013442. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45402-0_39"},{"issue":"12","key":"33_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":"5","key":"33_CR8","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":"33_CR9","unstructured":"Calimeri, F., et al.: ASP-Core-2 Input Language Format (2013). https:\/\/www.mat.unical.it\/aspcomp2013\/files\/ASP-CORE-2.01c.pdf"},{"key":"33_CR10","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."},{"issue":"5\u20136","key":"33_CR11","first-page":"653","volume":"16","author":"C Dodaro","year":"2016","unstructured":"Dodaro, C., Gasteiger, P., Leone, N., Musitsch, B., Ricca, F., Schekotihin, K.: Combining answer set programming and domain heuristics for solving hard industrial problems (application paper). TPLP 16(5\u20136), 653\u2013669 (2016)","journal-title":"TPLP"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-22002-4_7","volume-title":"Web Reasoning and Rule Systems","author":"C Dodaro","year":"2015","unstructured":"Dodaro, C., Leone, N., Nardi, B., Ricca, F.: Allotment problem in travel industry: a solution based on ASP. In: ten Cate, B., Mileo, A. (eds.) RR 2015. LNCS, vol. 9209, pp. 77\u201392. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22002-4_7"},{"key":"33_CR13","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":"1","key":"33_CR14","first-page":"35","volume":"15","author":"E Erdem","year":"2015","unstructured":"Erdem, E., \u00d6ztok, U.: Generating explanations for biomedical queries. TPLP 15(1), 35\u201378 (2015)","journal-title":"TPLP"},{"issue":"1","key":"33_CR15","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."},{"issue":"6","key":"33_CR16","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1093\/logcom\/ext065","volume":"25","author":"M Gavanelli","year":"2015","unstructured":"Gavanelli, M., Nonato, M., Peano, A.: An ASP approach for the valves positioning optimization in a water distribution system. J. Log. Comput. 25(6), 1351\u20131369 (2015)","journal-title":"J. Log. Comput."},{"key":"33_CR17","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":"33_CR18","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"},{"issue":"6","key":"33_CR19","first-page":"841","volume":"14","author":"M Maratea","year":"2014","unstructured":"Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. TPLP 14(6), 841\u2013868 (2014)","journal-title":"TPLP"},{"key":"33_CR20","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. Indus. Eng. 90, 429\u2013443 (2015)","journal-title":"Comput. Indus. Eng."},{"issue":"3","key":"33_CR21","first-page":"361","volume":"12","author":"F Ricca","year":"2012","unstructured":"Ricca, F., Grasso, G., Alviano, M., Manna, M., Lio, V., Iiritano, S., Leone, N.: Team-building with answer set programming in the gioia-tauro seaport. TPLP 12(3), 361\u2013381 (2012)","journal-title":"TPLP"},{"key":"33_CR22","unstructured":"Shu, A.C., Subbaraj, I., Phan, L.: Operating Room Rescheduler (2015)"},{"key":"33_CR23","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, pp. 1\u20136, September 2017","DOI":"10.23919\/IConAC.2017.8081974"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2018 \u2013 Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03840-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T21:52:10Z","timestamp":1572558730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03840-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038397","9783030038403"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03840-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"AI*IA","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":"Trento","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aixia2018.fbk.eu\/index.php\/home\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20% - 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"}},{"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"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}