In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology, which can be formulated in a description logic (DL) or using existential rules. In the literature, there exists a multitude of complex techniques for incorporating ontological knowledge into queries. However, few of these approaches were designed for explainability of the query answers. We tackle this challenge by adapting an existing proof framework toward conjunctive query answering, based on the notion of universal models. 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 the query, we obtain an overview of the complexity of this problem for several Horn DLs.
翻译:在以本科为媒介的问答中,对不完整数据源的获取由由本科构成的概念层进行调解,这个概念层可以用描述逻辑(DL)或使用存在规则来形成,在文献中,在将本科知识纳入查询方面存在着多种复杂的技术,然而,这些方法中很少是为了解释查询答案而设计的。我们通过根据通用模型的概念,将现有证据框架调整为同时查询回答,来应对这一挑战。我们调查在确定某一质量阈值以下是否存在证据的数据和综合复杂性,可以不同方式加以衡量。通过区分查询形状等各种参数,我们获得了对几个非洲之角DL问题复杂性的概述。