{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:12:06Z","timestamp":1743145926959,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030757748"},{"type":"electronic","value":"9783030757755"}],"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-75775-5_30","type":"book-chapter","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:46:09Z","timestamp":1620776769000},"page":"442-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Multi-shot ASP Encoding for the Aircraft Routing and Maintenance Planning Problem"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Tassel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Rbaia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,12]]},"reference":[{"unstructured":"https:\/\/github.com\/prosysscience\/Aircraft_Scheduling","key":"30_CR1"},{"issue":"1","key":"30_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)","journal-title":"Fundam. Inform."},{"doi-asserted-by":"crossref","unstructured":"Brewka, G., Delgrande, J., Romero, J., Schaub, T.: asprin: customizing answer set preferences without a headache. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1467\u20131474. AAAI Press (2015)","key":"30_CR3","DOI":"10.1609\/aaai.v29i1.9398"},{"issue":"12","key":"30_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1017\/S1471068418000546","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., Dodaro, C., Fusc\u00e0, D., Perri, S., Zangari, J.: Efficiently coupling the I-DLV grounder with ASP solvers. Theory Pract. Logic Program. 20(2), 205\u2013224 (2020)","journal-title":"Theory Pract. Logic Program."},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-319-18615-3_11","volume-title":"RoboCup 2014: Robot World Cup XVIII","author":"K Chen","year":"2015","unstructured":"Chen, K., Lu, D., Chen, Y., Tang, K., Wang, N., Chen, X.: The intelligent techniques in robot KeJia\u2013the champion of RoboCup@Home 2014. In: Bianchi, R.A.C., Akin, H.L., Ramamoorthy, S., Sugiura, K. (eds.) RoboCup 2014. LNCS (LNAI), vol. 8992, pp. 130\u2013141. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18615-3_11"},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S1471068418000583","volume":"19","author":"Y Dimopoulos","year":"2019","unstructured":"Dimopoulos, Y., Gebser, M., L\u00fchne, P., Romero, J., Schaub, T.: Pasp 3: towards effective ASP planning. Theory Pract. Logic Program. 19(3), 477\u2013504 (2019)","journal-title":"Theory Pract. Logic Program."},{"unstructured":"Gebser, M., et al.: Potassco User Guide. University of Potsdam (2019). https:\/\/potassco.org","key":"30_CR8"},{"doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Morgan & Claypool Publishers (2012). https:\/\/www.cs.uni-potsdam.de\/wv\/publications\/DBLP_series\/synthesis\/2012Gebser.html","key":"30_CR9","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Logic Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Logic Program."},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.3233\/AIC-2011-0496","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Sabuncu, O., Schaub, T.: An incremental answer set programming based system for finite model computation. AI Commun. 24(2), 195\u2013212 (2011)","journal-title":"AI Commun."},{"unstructured":"Gr\u00f6nkvist, M.: The tail assignment problem. Ph.D. thesis, Chalmers University of Technology (2005)","key":"30_CR12"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.jairtraman.2016.08.008","volume":"58","author":"A Jamili","year":"2017","unstructured":"Jamili, A.: A robust mathematical model and heuristic algorithms for integrated aircraft routing and scheduling, with consideration of fleet assignment problem. J. Air Transp. Manage. 58, 21\u201330 (2017)","journal-title":"J. Air Transp. Manage."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-0-387-88617-6_12","volume-title":"Optimization and Logistics Challenges in the Enterprise","author":"Z Liang","year":"2009","unstructured":"Liang, Z., Chaovalitwongse, W.: The aircraft maintenance routing problem. In: Chaovalitwongse, W., Furman, K., Pardalos, P. (eds.) Optimization and Logistics Challenges in the Enterprise, vol. 30, pp. 327\u2013348. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-88617-6_12"},{"issue":"1","key":"30_CR15","first-page":"33","volume":"6","author":"P Obermeier","year":"2019","unstructured":"Obermeier, P., Romero, J., Schaub, T.: Multi-shot stream reasoning in answer set programming: a preliminary report. Open J. Databases 6(1), 33\u201338 (2019)","journal-title":"Open J. Databases"},{"issue":"1","key":"30_CR16","first-page":"73","volume":"5","author":"\u0130 Orhan","year":"2011","unstructured":"Orhan, \u0130., Kapano\u011flu, M., Karako\u00e7, T.: Concurrent aircraft routing and maintenance scheduling. J. Aeronaut. Space Technol. 5(1), 73\u201379 (2011)","journal-title":"J. Aeronaut. Space Technol."},{"key":"30_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6329-7","volume-title":"Decomposition Methods for Complex Factory Scheduling Problems","author":"I Ovacik","year":"2012","unstructured":"Ovacik, I., Uzsoy, R.: Decomposition Methods for Complex Factory Scheduling Problems. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4615-6329-7"},{"doi-asserted-by":"crossref","unstructured":"Roy, K., Tomlin, C.: Solving the aircraft routing problem using network flow algorithms. In: Proceedings of the American Control Conference, pp. 3330\u20133335. IEEE (2007)","key":"30_CR18","DOI":"10.1109\/ACC.2007.4282854"},{"doi-asserted-by":"crossref","unstructured":"Sch\u00e4pers, B., Niemueller, T., Lakemeyer, G., Gebser, M., Schaub, T.: ASP-based time-bounded planning for logistics robots. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 509\u2013517. AAAI Press (2018)","key":"30_CR19","DOI":"10.1609\/icaps.v28i1.13927"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jairtraman.2015.04.002","volume":"47","author":"B Vaaben","year":"2015","unstructured":"Vaaben, B., Larsen, J.: Mitigation of airspace congestion impact on airline networks. J. Air Transp. Manage. 47, 54\u201365 (2015)","journal-title":"J. Air Transp. Manage."},{"doi-asserted-by":"crossref","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo acyclicity. In: Proceedings of the Twenty-First European Conference on Artificial Intelligence, ECAI\u201914, pp. 351\u2013356. IOS Press, Prague (2014)","key":"30_CR21","DOI":"10.1007\/978-3-319-11558-0_10"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75775-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T01:47:54Z","timestamp":1672105674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75775-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757748","9783030757755"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75775-5_30","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":"12 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","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":"jelia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2021.aau.at\/","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":"68","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":"27","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":"3","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":"40% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}