- AutorIn
- Stefan Borgwardt Chair for Automata Theory, Technische Universität Dresden
- Walter ForkelChair for Automata Theory, Technische Universität Dresden
- Alisa KovtunovaChair for Automata Theory, Technische Universität Dresden
- Titel
- Finding New Diamonds
- Untertitel
- Temporal Minimal-World Query Answering over Sparse ABoxes
- Extended Version
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-887820
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 19-12
- Erstveröffentlichung
- 2019
- DOI
- https://doi.org/10.25368/2023.223
- Abstract (EN)
- Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a completion algorithm for our logic, which shows that entailment remains tractable. Based on this, we develop a minimal-world semantics for answering metric temporal conjunctive queries with negation. We show that query answering is combined first-order rewritable, and hence in polynomial time in data complexity.
- Andere Ausgabe
- Zuerst erschienen in „Rules and Reasoning. RuleML+RR 2019. Lecture Notes in Computer Science (Vol. 11784)”.
DOI: 10.1007/978-3-030-31095-0_1 - Freie Schlagwörter (DE)
- Beschreibungslogik, Metrische Temporallogik, Anfragebeantwortung, Geschlossene-Welt-Semantik
- Freie Schlagwörter (EN)
- description logic, metric temporal logic, query answering, closed-world semantics
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Herausgeber (Institution)
- Technische Universität Dresden
- Förder- / Projektangaben
- Deutsche Forschungsgemeinschaft Generating & AnSwering Ontological Queries
(GoAsQ)
ID: BA 1122/19-1 - Deutsche Forschungsgemeinschaft TRR 248: Foundations of Perspicuous Software Systems
(CPEC)
ID: 389792660 - Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-887820
- Veröffentlichungsdatum Qucosa
- 29.12.2023
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0