（时间）属性描述逻辑的几何模型
Geometric Models for (Temporally) Attributed Description Logics
摘要：
在寻找能够捕获本体知识的知识图谱嵌入的过程中，最近引入了存在规则的几何模型。它已被证明，凸几何区域捕获所谓的准链式规则。属性描述逻辑（DL）的定义是为了弥合DL语言和知识图谱之间的差距，知识图谱的事实往往带有各种各样的注释，可能需要考虑推理。特别是，时间属性DL丰富的特定属性，其语义允许一些时间推理。考虑到几何模型和（时间）属性DL是很有前途的工具设计的知识图谱，本文研究了它们的兼容性，侧重于一个霍恩方言的DL-Lite家庭的属性版本。我们首先适应的几何模型的定义，属性DL和显示，每个可满足的本体有一个凸的几何模型。我们的第二个贡献是时间属性的影响的研究。我们表明，时间属性DL可能没有一个凸的几何模型一般，但我们可以恢复几何可满足性施加一些限制的时间属性的使用。
英文摘要：
In the search for knowledge graph embeddings that could capture ontological knowledge, geometric models of existential rules have been recently introduced. It has been shown that convex geometric regions capture the so-called quasi-chained rules. Attributed description logics (DL) have been defined to bridge the gap between DL languages and knowledge graphs, whose facts often come with various kinds of annotations that may need to be taken into account for reasoning. In particular, temporally attributed DLs are enriched by specific attributes whose semantics allows for some temporal reasoning. Considering that geometric models and (temporally) attributed DLs are promising tools designed for knowledge graphs, this paper investigates their compatibility, focusing on the attributed version of a Horn dialect of the DL-Lite family. We first adapt the definition of geometric models to attributed DLs and show that every satisfiable ontology has a convex geometric model. Our second contribution is a study of the impact of temporal attributes. We show that a temporally attributed DL may not have a convex geometric model in general but we can recover geometric satisfiability by imposing some restrictions on the use of the temporal attributes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
