论文标题
找到良好的证据，以获取由轻量级本体论介导的连接查询的答案（技术报告）
Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Technical Report)
论文作者
论文摘要
在本体介导的查询答案中，对不完整的数据源的访问是由本体论构成的概念层介导的。为了正确计算查询的答案，有必要对本体学表达的约束进行复杂的推理。在文献中，存在多种将本体论知识纳入查询的技术。但是，这些方法中很少有用于查询答案的可理解性。在本文中，我们试图通过调整最初应用于公理需要的证明框架来弥合这两个素质，以进行连接。我们研究了确定在给定质量阈值下方证明的存在的数据和复杂性，可以以不同的方式进行测量。通过区分各种参数，例如查询的形状，我们获得了轻量级本体论语言dl-lite_r和el的复杂性的概述，并且还简要介绍了时间查询的答案。
In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology. To correctly compute answers to queries, it is necessary to perform complex reasoning over the constraints expressed by the ontology. In the literature, there exists a multitude of techniques incorporating the ontological knowledge into queries. However, few of these approaches were designed for comprehensibility of the query answers. In this article, we try to bridge these two qualities by adapting a proof framework originally applied to axiom entailment for conjunctive query answering. We investigate the data and combined complexity of determining the existence of a proof below a given quality threshold, which can be measured in different ways. By distinguishing various parameters such as the shape of a query, we obtain an overview of the complexity of this problem for the lightweight ontology languages DL-Lite_R and EL, and also have a brief look at temporal query answering.
