Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes (Extended Abstract)
Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes (Extended Abstract)
复制标题
DOI：
10.1007/978-3-030-31095-0_1
复制
发表时间：
2019-09
期刊：
影响因子：
--
通讯作者：
S. Borgwardt;Walter Forkel;Alisa Kovtunova
中科院分区：
文献类型：
--
作者：
S. Borgwardt;Walter Forkel;Alisa Kovtunova
轻量级时态本体语言是近年来一个非常活跃的研究领域。许多现实世界的应用程序，如处理电子健康记录（EHR），固有地包含一个时间维度，并需要高效的推理算法。此外，由于医疗数据不是定期记录的，因此推理者必须处理具有潜在的大时间间隔的稀疏数据。在本文中，我们介绍了易处理语言的时间扩展 ，它的特点是一类新的凸钻石运算符，可用于弥合时间差距。我们为我们的逻辑开发了一个完成算法，这表明蕴涵仍然是易处理的。在此基础上，我们开发了最小世界语义来回答带有否定的度量时态合取查询。我们发现，查询回答相结合的一阶递归，因此在多项式时间的数据复杂度。
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 , which features a new class ofconvex diamondoperators 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 aminimal-worldsemantics 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.