{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T18:08:19Z","timestamp":1759342099573},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030310943"},{"type":"electronic","value":"9783030310950"}],"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-31095-0_1","type":"book-chapter","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:02:53Z","timestamp":1568361773000},"page":"3-18","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Borgwardt","sequence":"first","affiliation":[]},{"given":"Walter","family":"Forkel","sequence":"additional","affiliation":[]},{"given":"Alisa","family":"Kovtunova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181\u2013204 (1994)","journal-title":"J. ACM"},{"key":"1_CR2","unstructured":"Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: First-order rewritability of ontology-mediated temporal queries. In: Proceedings IJCAI, pp. 2706\u20132712. AAAI Press (2015)"},{"key":"1_CR3","unstructured":"Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: Ontology-mediated query answering over temporal data: a survey (invited talk). In: Proceedings TIME, pp. 1:1\u20131:37. Schloss Dagstuhl (2017)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Artale, A., Kontchakov, R., Lutz, C., Wolter, F., Zakharyaschev, M.: Temporalising tractable description logics. In: Proceedings TIME, pp. 11\u201322. IEEE Press (2007)","DOI":"10.1109\/TIME.2007.62"},{"key":"1_CR5","unstructured":"Artale, A., Kontchakov, R., Wolter, F., Zakharyaschev, M.: Temporal description logic for ontology-based data access. In: Proceedings IJCAI, pp. 711\u2013717. AAAI Press (2013)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Borgwardt, S., Forkel, W.: Patient selection for clinical trials using temporalized ontology-mediated query answering. In: Proceedings HQA, pp. 1069\u20131074. ACM (2018)","DOI":"10.1145\/3184558.3191538"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-66167-4_4","volume-title":"Frontiers of Combining Systems","author":"F Baader","year":"2017","unstructured":"Baader, F., Borgwardt, S., Koopmann, P., Ozaki, A., Thost, V.: Metric temporal description logics with interval-rigid names. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 60\u201376. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_4"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.websem.2014.11.008","volume":"33","author":"F Baader","year":"2015","unstructured":"Baader, F., Borgwardt, S., Lippmann, M.: Temporal query entailment in the description logic $$\\cal{SHQ}$$ . J. Web Sem. 33, 71\u201393 (2015)","journal-title":"J. Web Sem."},{"key":"1_CR9","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Proceedings IJCAI, pp. 364\u2013369. Professional Book Center (2005)"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699444","volume":"62","author":"D Basin","year":"2015","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S., Z\u0103linescu, E.: Monitoring metric first-order temporal properties. J. ACM 62(2), 1\u201345 (2015)","journal-title":"J. ACM"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.jbi.2017.12.007","volume":"78","author":"L Bonomi","year":"2018","unstructured":"Bonomi, L., Jiang, X.: Patient ranking with temporally annotated data. J. Biomed. Inf. 78, 43\u201353 (2018)","journal-title":"J. Biomed. Inf."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-19570-0_24","volume-title":"Logics in Artificial Intelligence","author":"S Borgwardt","year":"2019","unstructured":"Borgwardt, S., Forkel, W.: Closed-world semantics for conjunctive queries with negation over $$\\cal{ELH}_\\bot $$ ontologies. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 371\u2013386. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_24"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.websem.2014.11.007","volume":"33","author":"S Borgwardt","year":"2015","unstructured":"Borgwardt, S., Lippmann, M., Thost, V.: Temporalizing rewritable query languages over knowledge bases. J. Web Sem. 33, 50\u201370 (2015)","journal-title":"J. Web Sem."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1613\/jair.1.11229","volume":"62","author":"S Brandt","year":"2018","unstructured":"Brandt, S., Kalayc\u0131, E.G., Ryzhikov, V., Xiao, G., Zakharyaschev, M.: Querying log data with metric temporal logic. J. Artif. Intell. Res. 62, 829\u2013877 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.artint.2012.10.003","volume":"195","author":"D Calvanese","year":"2013","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Art. Intell. 195, 335\u2013360 (2013)","journal-title":"Art. Intell."},{"key":"1_CR16","first-page":"173","volume":"2015","author":"CL Crowe","year":"2015","unstructured":"Crowe, C.L., Tao, C.: Designing ontology-based patterns for the representation of the time-relevant eligibility criteria of clinical protocols. AMIA Jt. Summits Transl. Sci. Proc. 2015, 173\u2013177 (2015)","journal-title":"AMIA Jt. Summits Transl. Sci. Proc."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, 9\u201311 June 2008, Vancouver, BC, Canada, pp. 149\u2013158 (2008)","DOI":"10.1145\/1376916.1376938"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85762-4_9","volume-title":"Theoretical Aspects of Computing - ICTAC 2008","author":"CA Furia","year":"2008","unstructured":"Furia, C.A., Spoletini, P.: Tomorrow and all our yesterdays: MTL satisfiability over the integers. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 126\u2013140. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85762-4_9"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2015.06.002","volume":"35","author":"V Guti\u00e9rrez-Basulto","year":"2015","unstructured":"Guti\u00e9rrez-Basulto, V., Ib\u00e1\u00f1ez-Garc\u00eda, Y., Kontchakov, R., Kostylev, E.V.: Queries with negation and inequalities over lightweight ontologies. J. Web Sem. 35, 184\u2013202 (2015)","journal-title":"J. Web Sem."},{"key":"1_CR20","unstructured":"Guti\u00e9rrez-Basulto, V., Jung, J.C., Kontchakov, R.: Temporalized $$\\cal{EL}$$ ontologies for accessing temporal data: complexity of atomic queries. In: Proceedings IJCAI, pp. 1102\u20131108. AAAI Press (2016)"},{"key":"1_CR21","unstructured":"Guti\u00e9rrez-Basulto, V., Jung, J.C., Ozaki, A.: On metric temporal description logics. In: Proceedings ECAI, pp. 837\u2013845. IOS Press (2016)"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1197\/jamia.M1623","volume":"12","author":"G Hripcsak","year":"2005","unstructured":"Hripcsak, G., Zhou, L., Parsons, S., Das, A.K., Johnson, S.B.: Modeling electronic discharge summaries as a simple temporal constraint satisfaction problem. J. Am. Med. Inform. Assn. 12(1), 55\u201363 (2005)","journal-title":"J. Am. Med. Inform. Assn."},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"ND Jones","year":"1976","unstructured":"Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theore. Comput. Sci. 3(1), 105\u2013117 (1976)","journal-title":"Theore. Comput. Sci."},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-75560-9_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Krisnadhi","year":"2007","unstructured":"Krisnadhi, A., Lutz, C.: Data complexity in the $$\\cal{EL}$$ family of description logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 333\u2013347. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75560-9_25"},{"key":"1_CR25","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Conjunctive queries for $$\\cal{EL}$$ with role composition. In: Proceedings DL, pp. 355\u2013362 (2007)"},{"key":"1_CR26","unstructured":"Lindell, S.: A purely logical characterization of circuit uniformity. In: Proceedings of the 7th Annual Structure in Complexity Theory Conference, pp. 185\u2013192 (1992)"},{"key":"1_CR27","unstructured":"Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic $$\\cal{EL}$$ using a relational database system. In: Proceedings IJCAI, pp. 2070\u20132075. AAAI Press (2009)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Lutz, C., Wolter, F., Zakharyaschev, M.: Temporal description logics: a survey. In: Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), pp. 3\u201314. IEEE Press (2008)","DOI":"10.1109\/TIME.2008.14"},{"key":"1_CR29","unstructured":"Rosati, R.: On conjunctive query answering in $$\\cal{EL}$$ . In: Proceedings DL, pp. 451\u2013458 (2007)"},{"key":"1_CR30","unstructured":"Thost, V.: Metric temporal extensions of DL-Lite and interval-rigid names. In: Proceedings KR, pp. 665\u2013666. AAAI Press (2018)"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proceedings STOC, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"},{"key":"1_CR32","unstructured":"Wolter, F., Zakharyaschev, M.: Temporalizing description logics. In: Frontiers of Combining Systems 2, pp. 379\u2013402. Research Studies Press\/Wiley (2000)"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31095-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T12:15:16Z","timestamp":1611144916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31095-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310943","9783030310950"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31095-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.ruleml-rr.org","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":"26","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":"10","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":"5","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":"38% - 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":"2","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)"}},{"value":"Authors were able to respond to the reviews.","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)"}}]}}