{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T23:53:07Z","timestamp":1772236387079,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030883607","type":"print"},{"value":"9783030883614","type":"electronic"}],"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-88361-4_38","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T07:07:22Z","timestamp":1632899242000},"page":"648-664","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Leveraging Semantic Technologies for\u00a0Digital Interoperability in\u00a0the\u00a0European Railway Domain"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6645-1264","authenticated-orcid":false,"given":"Juli\u00e1n Andr\u00e9s","family":"Rojas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Aguado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Polymnia","family":"Vasilopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivo","family":"Velitchkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7195-9935","authenticated-orcid":false,"given":"Dylan","family":"Van Assche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6917-2167","authenticated-orcid":false,"given":"Pieter","family":"Colpaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8596-222X","authenticated-orcid":false,"given":"Ruben","family":"Verborgh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"issue":"5","key":"38_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1038\/scientificamerican0501-34","volume":"284","author":"T Berners-Lee","year":"2001","unstructured":"Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Sci. Am. 284(5), 34\u201343 (2001)","journal-title":"Sci. Am."},{"key":"38_CR2","unstructured":"Bischof, S., Schenner, G.: Towards a railway topology ontology to integrate and query rail data silos. In: SEMWEB (2020)"},{"key":"38_CR3","unstructured":"Chaudhuri, S., Weikum, G.: Rethinking database system architecture: Towards a self-tuning RISC-style database system. In: Proceedings of the 26th International Conference on Very Large Data Bases, VLDB 2000, pp. 1\u201310. Morgan Kaufmann Publishers Inc., San Francisco (2000)"},{"key":"38_CR4","unstructured":"Council of European Union: Council regulation (EU) no 2008\/57 (2008). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=celex%3A32008L0057"},{"key":"38_CR5","unstructured":"Council of European Union: Council regulation (EU) no 2011\/65 (2011). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=celex%3A32011L0065"},{"key":"38_CR6","unstructured":"Council of European Union: Council regulation (EU) no 2012\/34 (2016). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=CELEX%3A32012L0034"},{"key":"38_CR7","unstructured":"Council of European Union: Council regulation (EU) no 2016\/796 (2016). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=CELEX%3A32016R0796"},{"key":"38_CR8","unstructured":"Council of European Union: Council regulation (EU) no 2016\/797 (2016). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=CELEX%3A32016L0797"},{"key":"38_CR9","unstructured":"Council of European Union: Council regulation (EU) no 2018\/1614 (2018). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=uriserv:OJ.L_.2018.268.01.0053.01.ENG&toc=OJ:L:2018:268:TOC"},{"key":"38_CR10","unstructured":"Council of European Union: Council regulation (EU) no 2019\/773 (2019). https:\/\/eur-lex.europa.eu\/eli\/reg_impl\/2019\/773\/oj"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/trsc.2014.0579","volume":"51","author":"D Delling","year":"2017","unstructured":"Delling, D., Goldberg, A., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51, 566\u2013591 (2017)","journal-title":"Transp. Sci."},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886843","volume":"21","author":"J Dibbelt","year":"2016","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. ACM J. Exp. Algorithmics 21, 1\u201349 (2016)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"38_CR13","unstructured":"Dimou, A., Vander Sande, M., Colpaert, P., Verborgh, R., Mannens, E., Van de Walle, R.: RML: a generic language for integrated RDF mappings of heterogeneous data. In: Proceedings of the 7th Workshop on Linked Data on the Web. CEUR Workshop Proceedings, vol. 1184, April 2014"},{"issue":"2","key":"38_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/514183.514185","volume":"2","author":"RT Fielding","year":"2002","unstructured":"Fielding, R.T., Taylor, R.N.: Principled design of the modern web architecture. ACM Trans. Internet Technol. 2(2), 115\u2013150 (2002)","journal-title":"ACM Trans. Internet Technol."},{"key":"38_CR15","unstructured":"Garijo, D., et al.: Zack-83: dgarijo\/Widoco: WIDOCO 1.4.15$$\\_1$$ (pre-release): Namespace prefixes fixes and WebVowl update, December 2020"},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2495\/CR100191","volume":"114","author":"L G\u00e9ly","year":"2010","unstructured":"G\u00e9ly, L., Dessagne, G., Pesneau, P., Vanderbeck, F.: A multi scalable model based on a connexity graph representation. WIT Trans. Built Environ. 114, 193\u2013204 (2010)","journal-title":"WIT Trans. Built Environ."},{"key":"38_CR17","unstructured":"Gubichev, A., Neumann, T.: Path query processing on very large RDF graphs. In: WebDB (2011)"},{"issue":"2","key":"38_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Heath, T., Bizer, C.: Linked Data: Evolving the Web into a Global Data Space (2011). http:\/\/linkeddatabook.com\/editions\/1.0\/","DOI":"10.1007\/978-3-642-24577-0_1"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-98192-5_40","volume-title":"The Semantic Web: ESWC 2018 Satellite Events","author":"P Heyvaert","year":"2018","unstructured":"Heyvaert, P., De Meester, B., Dimou, A., Verborgh, R.: Declarative rules for linked data generation at your fingertips! In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 11155, pp. 213\u2013217. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98192-5_40"},{"key":"38_CR21","doi-asserted-by":"publisher","unstructured":"Hlubu\u010dek, A.: Railtopomodel and railML 3 in overall context. Acta Polytechnica CTU Proceedings 11, 16 (2017). https:\/\/doi.org\/10.14311\/APP.2017.11.0016","DOI":"10.14311\/APP.2017.11.0016"},{"key":"38_CR22","unstructured":"RailTopoModel - Railway Infrastructure Topological Model. Standard, International Union of Railways, Paris, FR (2016)"},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Morris, C., Easton, J., Roberts, C.: Applications of linked data in the rail domain. In: 2014 IEEE International Conference on Big Data (Big Data), pp. 35\u201341 (2014)","DOI":"10.1109\/BigData.2014.7004429"},{"key":"38_CR24","unstructured":"Publications Office of the European Union: New European interoperability framework: promoting seamless services and data flows for European public administrations (2017). https:\/\/ec.europa.eu\/isa2\/sites\/default\/files\/eif_brochure_final.pdf"},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Savenkov, V., Mehmood, Q., Umbrich, J., Polleres, A.: Counting to k or how sparql1.1 property paths can be extended to top-k path queries. In: Proceedings of the 13th International Conference on Semantic Systems, Semantics 2017, pp. 97\u2013103. Association for Computing Machinery, New York (2017)","DOI":"10.1145\/3132218.3132239"},{"key":"38_CR26","doi-asserted-by":"crossref","first-page":"F4015001","DOI":"10.1061\/AJRUA6.0000859","volume":"3","author":"J Tutcher","year":"2017","unstructured":"Tutcher, J., Easton, J., Roberts, C.: Enabling data integration in the rail industry using RDF and OWL: the RaCoOn ontology. ASCE-ASME J. Risk Uncertainty Eng. Syst. Part A: Civil Eng. 3, F4015001 (2017)","journal-title":"ASCE-ASME J. Risk Uncertainty Eng. Syst. Part A: Civil Eng."},{"key":"38_CR27","unstructured":"Verborgh, R., Vander Sande, M., Colpaert, P., Coppens, S., Mannens, E., Van de Walle, R.: Web-scale querying through Linked Data Fragments. In: Bizer, C., Heath, T., Auer, S., Berners-Lee, T. (eds.) Proceedings of the 7$$^{\\rm th}$$ Workshop on Linked Data on the Web. CEUR Workshop Proceedings, vol. 1184, April 2014"},{"issue":"4","key":"38_CR28","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.trc.2010.10.003","volume":"19","author":"S Verstichel","year":"2011","unstructured":"Verstichel, S., et al.: Efficient data integration in the railway domain through an ontology-based methodology. Transp. Res. Part C Emerging Technol. 19(4), 617\u2013643 (2011)","journal-title":"Transp. Res. Part C Emerging Technol."},{"issue":"11","key":"38_CR29","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88361-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:33:35Z","timestamp":1673375615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88361-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030883607","9783030883614"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88361-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","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":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2021.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"202","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":"42","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":"0","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":"21% - 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.5","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":"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 (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}