{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:40Z","timestamp":1740098980106,"version":"3.37.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319701684"},{"type":"electronic","value":"9783319701691"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-70169-1_35","type":"book-chapter","created":{"date-parts":[[2017,11,5]],"date-time":"2017-11-05T21:14:23Z","timestamp":1509916463000},"page":"468-482","source":"Crossref","is-referenced-by-count":11,"title":["An Advanced Answer Set Programming Encoding for Nurse Scheduling"],"prefix":"10.1007","author":[{"given":"Mario","family":"Alviano","sequence":"first","affiliation":[]},{"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,7]]},"reference":[{"key":"35_CR1","unstructured":"The website of Gurobi. \nhttp:\/\/www.gurobi.com"},{"issue":"1","key":"35_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. Inform. 147(1), 1\u201325 (2016). \nhttps:\/\/doi.org\/10.3233\/FI-2016-1396","journal-title":"Fundam. Inform."},{"issue":"5","key":"35_CR3","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U Aickelin","year":"2004","unstructured":"Aickelin, U., Dowsland, K.A.: An indirect genetic algorithm for a nurse-scheduling problem. Comput. OR 31(5), 761\u2013778 (2004). \nhttps:\/\/doi.org\/10.1016\/S0305-0548(03)00034-0","journal-title":"Comput. OR"},{"issue":"5\u20136","key":"35_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1017\/S147106841600020X","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). \nhttps:\/\/doi.org\/10.1017\/S147106841600020X","journal-title":"TPLP"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-23264-5_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40\u201354. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23264-5_5"},{"key":"35_CR6","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: A MaxSAT algorithm using cardinality constraints of bounded size. In: IJCAI 2015, pp. 2677\u20132683. AAAI Press (2015)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-40564-8_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Faber, W.: The complexity boundary of answer set programming with generalized atoms under the FLP semantics. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 67\u201372. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40564-8_7"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-40970-2_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"G Audemard","year":"2016","unstructured":"Audemard, G., Simon, L.: Extreme cases in SAT problems. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 87\u2013103. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40970-2_7"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0305-0548(03)00249-1","volume":"32","author":"MN Azaiez","year":"2005","unstructured":"Azaiez, M.N., Sharif, S.S.A.: A 0\u20131 goal programming model for nurse scheduling. Comput. OR 32, 491\u2013507 (2005). \nhttps:\/\/doi.org\/10.1016\/S0305-0548(03)00249-1","journal-title":"Comput. OR"},{"key":"35_CR10","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45402-0_39"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ejor.2003.06.046","volume":"164","author":"JF Bard","year":"2005","unstructured":"Bard, J.F., Purnomo, H.W.: Preference scheduling for nurses using column generation. Eur. J. Oper. Res. 164(2), 510\u2013534 (2005). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2003.06.046","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-24318-4_29","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"A Biere","year":"2015","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL variable scoring schemes. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 405\u2013422. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24318-4_29"},{"issue":"12","key":"35_CR13","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). \nhttps:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Commun. ACM"},{"issue":"6","key":"35_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"EK Burke","year":"2004","unstructured":"Burke, E.K., Causmaecker, P.D., Berghe, G.V., Landeghem, H.V.: The state of the art of nurse rostering. J. Sched. 7(6), 441\u2013499 (2004). \nhttps:\/\/doi.org\/10.1023\/B:JOSH.0000046076.75950.0b","journal-title":"J. Sched."},{"key":"35_CR15","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-Core-2 Input Language Format (2013). \nhttps:\/\/www.mat.unical.it\/aspcomp.2013\/files\/ASP-CORE-2.01c.pdf"},{"key":"35_CR16","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). \nhttps:\/\/doi.org\/10.1016\/j.artint.2015.09.008","journal-title":"Artif. Intell."},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-44629-X_10","volume-title":"Practice and Theory of Automated Timetabling III","author":"P Chan","year":"2001","unstructured":"Chan, P., Weil, G.: Cyclical staff scheduling using constraint logic programming. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 159\u2013175. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44629-X_10"},{"issue":"3","key":"35_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B Cheang","year":"2003","unstructured":"Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems - a bibliographic survey. Eur. J. Oper. Res. 151(3), 447\u2013460 (2003). \nhttps:\/\/doi.org\/10.1016\/S0377-2217(03)00021-3","journal-title":"Eur. J. Oper. Res."},{"issue":"5\u20136","key":"35_CR19","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1017\/S1471068416000284","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). \nhttps:\/\/doi.org\/10.1017\/S1471068416000284","journal-title":"TPLP"},{"key":"35_CR20","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: Cate, B., Mileo, A. (eds.) RR 2015. LNCS, vol. 9209, pp. 77\u201392. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-22002-4_7"},{"key":"35_CR21","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-61660-5_27"},{"issue":"1","key":"35_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S1471068413000598","volume":"15","author":"E Erdem","year":"2015","unstructured":"Erdem, E., \u00d6ztok, U.: Generating explanations for biomedical queries. TPLP 15(1), 35\u201378 (2015). \nhttps:\/\/doi.org\/10.1017\/S1471068413000598","journal-title":"TPLP"},{"issue":"6","key":"35_CR23","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). \nhttps:\/\/doi.org\/10.1093\/logcom\/ext065","journal-title":"J. Log. Comput."},{"key":"35_CR24","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with Clingo 5. In: ICLP TCs. OASICS, vol. 52, pp. 2:1\u20132:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). \nhttps:\/\/doi.org\/10.4230\/OASIcs.ICLP.2016.2"},{"key":"35_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-20895-9_39","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., K\u00f6nig, A., Schaub, T.: Advances in gringo series 3. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 345\u2013351. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-20895-9_39"},{"issue":"2","key":"35_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: the Potsdam answer set solving collection. AI Commun. 24(2), 107\u2013124 (2011). \nhttps:\/\/doi.org\/10.3233\/AIC-2011-0491","journal-title":"AI Commun."},{"key":"35_CR27","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). \nhttps:\/\/doi.org\/10.1016\/j.artint.2012.04.001","journal-title":"Artif. Intell."},{"issue":"3","key":"35_CR28","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"WJ Gutjahr","year":"2007","unstructured":"Gutjahr, W.J., Rauner, M.S.: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comput. OR 34(3), 642\u2013666 (2007). \nhttps:\/\/doi.org\/10.1016\/j.cor.2005.03.018","journal-title":"Comput. OR"},{"issue":"4\u20135","key":"35_CR29","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1017\/S1471068415000265","volume":"15","author":"L Koponen","year":"2015","unstructured":"Koponen, L., Oikarinen, E., Janhunen, T., S\u00e4il\u00e4, L.: Optimizing phylogenetic supertrees using answer set programming. TPLP 15(4\u20135), 604\u2013619 (2015). \nhttps:\/\/doi.org\/10.1017\/S1471068415000265","journal-title":"TPLP"},{"issue":"6","key":"35_CR30","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.datak.2010.01.005","volume":"69","author":"MC Marileo","year":"2010","unstructured":"Marileo, M.C., Bertossi, L.E.: The consistency extractor system: answer set programs for consistent query answering in databases. Data Knowl. Eng. 69(6), 545\u2013572 (2010). \nhttps:\/\/doi.org\/10.1016\/j.datak.2010.01.005","journal-title":"Data Knowl. Eng."},{"issue":"5","key":"35_CR31","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1287\/opre.24.5.857","volume":"24","author":"HE Miller","year":"1976","unstructured":"Miller, H.E., Pierskalla, W.P., Rath, G.J.: Nurse scheduling using mathematical programming. Oper. Res. 24(5), 857\u2013870 (1976). \nhttps:\/\/doi.org\/10.1287\/opre.24.5.857","journal-title":"Oper. Res."},{"key":"35_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-319-10428-7_41","volume-title":"Principles and Practice of Constraint Programming","author":"A Morgado","year":"2014","unstructured":"Morgado, A., Dodaro, C., Marques-Silva, J.: Core-guided MaxSAT with soft cardinality constraints. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 564\u2013573. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10428-7_41"},{"key":"35_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-24318-4_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Philipp","year":"2015","unstructured":"Philipp, T., Steinke, P.: PBLib \u2013 a library for encoding pseudo-boolean constraints into CNF. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 9\u201316. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24318-4_2"},{"issue":"3","key":"35_CR34","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S147106841100007X","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). \nhttps:\/\/doi.org\/10.1017\/S147106841100007X","journal-title":"TPLP"},{"issue":"11","key":"35_CR35","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.fss.2009.10.003","volume":"161","author":"S Topaloglu","year":"2010","unstructured":"Topaloglu, S., Selim, H.: Nurse scheduling using fuzzy modeling approach. Fuzzy Sets Syst. 161(11), 1543\u20131563 (2010). \nhttps:\/\/doi.org\/10.1016\/j.fss.2009.10.003","journal-title":"Fuzzy Sets Syst."}],"container-title":["Lecture Notes in Computer Science","AI*IA 2017 Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70169-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,5]],"date-time":"2017-11-05T21:27:28Z","timestamp":1509917248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-70169-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319701684","9783319701691"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70169-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}