{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:31:35Z","timestamp":1743006695566,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031742088"},{"type":"electronic","value":"9783031742095"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_5","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"57-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ASP-Based Large Neighborhood Prioritized Search for\u00a0Course Timetabling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5837-1169","authenticated-orcid":false,"given":"Irumi","family":"Sugimori","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2717-9122","authenticated-orcid":false,"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3752-2518","authenticated-orcid":false,"given":"Hidetomo","family":"Nabeshima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5897-9192","authenticated-orcid":false,"given":"Takehide","family":"Soh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5466-1010","authenticated-orcid":false,"given":"Naoyuki","family":"Tamura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5388-727X","authenticated-orcid":false,"given":"Mutsunori","family":"Banbara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"issue":"1","key":"5_CR1","first-page":"1","volume":"147","author":"M Abseher","year":"2016","unstructured":"Abseher, M., Gebser, M., Musliu, N., Schaub, T., Woltran, S.: Shift design with answer set programming. Fund. Inform. 147(1), 1\u201325 (2016)","journal-title":"Fund. Inform."},{"issue":"2","key":"5_CR2","first-page":"109","volume":"12","author":"M Alviano","year":"2018","unstructured":"Alviano, M., Dodaro, C., Maratea, M.: Nurse (re)scheduling via answer set programming. Intell. Artif. 12(2), 109\u2013124 (2018)","journal-title":"Intell. Artif."},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","volume":"275","author":"M Banbara","year":"2019","unstructured":"Banbara, M., et al.: teaspoon: solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1), 3\u201337 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"4\u20135","key":"5_CR4","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1017\/S1471068413000495","volume":"13","author":"M Banbara","year":"2013","unstructured":"Banbara, M., Soh, T., Tamura, N., Inoue, K., Schaub, T.: Answer set programming as a modeling language for course timetabling. Theory Pract. Logic Program. 13(4\u20135), 783\u2013798 (2013)","journal-title":"Theory Pract. Logic Program."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., Toth, P.: An overview of curriculum-based course timetabling. TOP 23(2), 313\u2013349 (2015)","journal-title":"TOP"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","volume":"194","author":"A Bonutti","year":"2012","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., Schaerf, A.: Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results. Ann. Oper. Res. 194(1), 59\u201370 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1017\/S1471068423000030","volume":"24","author":"M Cardellini","year":"2024","unstructured":"Cardellini, M., et al.: Solving rehabilitation scheduling problems via a two-phase ASP approach. Theory Pract. Logic Program. 24(2), 344\u2013367 (2024)","journal-title":"Theory Pract. Logic Program."},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1017\/S1471068421000363","volume":"21","author":"C Dodaro","year":"2021","unstructured":"Dodaro, C., Galat\u00e0, G., Grioni, A., Maratea, M., Mochi, M., Porro, I.: An ASP-based solution to the chemotherapy treatment scheduling problem. Theory Pract. Logic Program. 21(6), 835\u2013851 (2021)","journal-title":"Theory Pract. Logic Program."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., Stepanova, D.: ALASPO: an adaptive large-neighbourhood ASP optimiser. In: Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2022) (2022)","DOI":"10.24963\/kr.2022\/58"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Eiter, T., Geibinger, T., Higuera, N.R., Musliu, N., Oetsch, J., Stepanova, D.: Large-neighbourhood search for optimisation in answer-set solving. Proceedings of the Thirty-sixth AAAI Conference on Artificial Intelligence (AAAI 2022), pp. 5616\u20135625. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i5.20502"},{"issue":"3","key":"5_CR11","first-page":"53","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of ASP. AI Mag. 37(3), 53\u201368 (2016)","journal-title":"AI Mag."},{"key":"5_CR12","unstructured":"Gaspero, L.D., McCollum, B., Schaerf, A.: The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). In: Proceedings of the First International Workshop on Scheduling a Scheduling Competition (SSC 2007) (2007)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Glover, F.W., Laguna, M.: Tabu Search. Kluwer (1997)","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-030-05998-9_3","volume-title":"Practical Aspects of Declarative Languages","author":"MK Kahraman","year":"2019","unstructured":"Kahraman, M.K., Erdem, E.: Personalized course schedule planning using answer set programming. In: Alferes, J.J., Johansson, M. (eds.) PADL 2019. LNCS, vol. 11372, pp. 37\u201345. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05998-9_3"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-016-2151-2","volume":"252","author":"A Kiefer","year":"2017","unstructured":"Kiefer, A., Hartl, R.F., Schnell, A.: Adaptive large neighborhood search for the curriculum-based course timetabling problem. Ann. Oper. Res. 252(2), 255\u2013282 (2017)","journal-title":"Ann. Oper. Res."},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24658-7","volume-title":"Answer Set Programming","author":"V Lifschitz","year":"2019","unstructured":"Lifschitz, V.: Answer Set Programming. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24658-7"},{"key":"5_CR17","unstructured":"M\u00fcller, T., Rudov\u00e1, H., M\u00fcllerov\u00e1, Z.: University course timetabling and International Timetabling Competition 2019. In: Proceedings of the Twelfth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2018), pp. 5\u201331 (2018)"},{"key":"5_CR18","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-91086-4_4","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2019","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 99\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_4"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13(2), 87\u2013127 (1999)","journal-title":"Artif. Intell. Rev."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Sugimori, I., et al.: Large neighborhood prioritized search for combinatorial optimization with answer set programming. In: Proceedings of the Twenty-first International Conference on Principles of Knowledge Representation and Reasoning (KR 2024) (2024, to appear)","DOI":"10.24963\/kr.2024\/72"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:02:42Z","timestamp":1736614962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","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":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}