{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T00:26:17Z","timestamp":1776731177509,"version":"3.51.2"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030205270","type":"print"},{"value":"9783030205287","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-20528-7_1","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:34:37Z","timestamp":1558362877000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Train Scheduling with Hybrid ASP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6367-7815","authenticated-orcid":false,"given":"Dirk","family":"Abels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Jordi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Ostrowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1015-2820","authenticated-orcid":false,"given":"Ambra","family":"Toletti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4986-4881","authenticated-orcid":false,"given":"Philipp","family":"Wanko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,12]]},"reference":[{"key":"1_CR1","volume-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"P Baptiste","year":"2012","unstructured":"Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems, vol. 39. Springer, New York (2012)"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-012-9123-1","volume":"17","author":"M Bofill","year":"2012","unstructured":"Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving constraint satisfaction problems with SAT modulo theories. Constraints 17(3), 273\u2013303 (2012)","journal-title":"Constraints"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/opre.50.5.851.362","volume":"50","author":"A Caprara","year":"2002","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Oper. Res. 50, 851\u2013861 (2002)","journal-title":"Oper. Res."},{"issue":"4\u20135","key":"1_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1017\/S1471068415000150","volume":"15","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., Schaub, T.: Abstract gringo. Theory Pract. Log. Program. 15(4\u20135), 449\u2013463 (2015)","journal-title":"Theory Pract. Log. Program."},{"key":"1_CR5","unstructured":"Gebser, M., et al.: Potassco User Guide, 2nd edn. (2015). http:\/\/potassco.org"},{"key":"1_CR6","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Technical Communications of the International Conference on Logic Programming (ICLP 2016), vol. 52, pp. 2:1\u20132:15. OASIcs (2016)"},{"issue":"1","key":"1_CR7","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. Log. Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Log. Program."},{"issue":"5\u20136","key":"1_CR8","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1017\/S1471068417000242","volume":"17","author":"T Janhunen","year":"2017","unstructured":"Janhunen, T., Kaminski, R., Ostrowski, M., Schaub, T., Schellhorn, S., Wanko, P.: Clingo goes linear constraints over reals and integers. Theory Pract. Log. Program. 17(5\u20136), 872\u2013888 (2017)","journal-title":"Theory Pract. Log. Program."},{"key":"1_CR9","unstructured":"Janhunen, T., Liu, G., Niemel\u00e4, I.: Tight integration of non-ground answer set programming and satisfiability modulo theories. In: Proceedings of the Workshop on Grounding and Transformation for Theories with Variables (GTTV 2011), pp. 1\u201313 (2011)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer set planning. In: Proceedings of the International Conference on Logic Programming (ICLP 1999), pp. 23\u201337. MIT Press (1999)","DOI":"10.1007\/3-540-46767-X_28"},{"key":"1_CR11","unstructured":"Liu, G., Janhunen, T., Niemel\u00e4, I.: Answer set programming via mixed integer programming. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pp. 32\u201342. AAAI Press (2012)"},{"key":"1_CR12","unstructured":"Oliveira, E., Smith, B.: A job-shop scheduling model for the single-track railway scheduling problem. University of Leeds, LU SCS RR (21) (2000)"},{"key":"1_CR13","unstructured":"Pellegrini, P., Douchet, G., Marli\u00e8re, G., Rodriguez, J.: Real-time train routing and scheduling through mixed integer linear programming: heuristic approach. In: Proceedings of the International Conference on Industrial Engineering and System Management, pp. 1\u20135 (2013)"},{"issue":"5","key":"1_CR14","doi-asserted-by":"publisher","first-page":"2609","DOI":"10.1109\/TITS.2015.2414294","volume":"16","author":"P Pellegrini","year":"2015","unstructured":"Pellegrini, P., Marli\u00e8re, G., Pesenti, R., Rodriguez, J.: RECIFE-MILP: an effective MILP-based heuristic for the real-time railway traffic management problem. IEEE Trans. Intell. Transp. Syst. 16(5), 2609\u20132619 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.trb.2006.02.006","volume":"41","author":"J Rodriguez","year":"2007","unstructured":"Rodriguez, J.: A constraint programming model for real-time train scheduling at junctions. Transp. Res.: Methodol. 41(2), 231\u2013245 (2007)","journal-title":"Transp. Res.: Methodol."},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR17","unstructured":"T\u00f6rnquist, J.: Computer-based decision support for railway traffic scheduling and dispatching: a review of models and algorithms. In: Proceedings of the Workshop on Algorithmic Methods and Models for Optimization of Railways, vol. 2. OASIcs (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20528-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T09:07:48Z","timestamp":1663492068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20528-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030205270","9783030205287"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20528-7_1","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 May 2019","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":"Philadelphia, PA","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.sju.edu\/plw\/lpnmr-2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}