arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.4604cs.AIcs.LO
收藏

不完备本体推理的完备性保证:理论与实践

Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice

University of Oxford(牛津大学)

Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos, Ian Horrocks

摘要:

为了实现查询应答的可伸缩性,语义Web应用程序的开发人员往往被迫使用不完整的OWL 2推理机,它不能为至少一个查询,本体和数据集得出所有的答案。然而,缺乏完整性保证对于医疗保健和国防等领域的应用程序可能是不可接受的,在这些领域,缺少答案可能会对应用程序功能产生不利影响。此外,即使应用程序可以容忍某种程度的不完整性,估计丢失了多少和什么类型的答案通常也是有利的。在本文中,我们提出了一种新的基于逻辑的框架,允许检查是否是一个推理机是完整的给定的查询Q和本体T-也就是说,是否保证计算所有的答案Q w.r.t. T和任意数据集A。由于本体和典型的查询往往是固定在应用程序设计时,我们的方法允许应用程序开发人员检查是否一个推理已知是不完整的一般是实际上是完整的各种输入相关的应用程序。我们还提出了一种技术,给定查询Q,本体T,以及满足某些假设的推理机R_1和R_2,可以用于确定对于每个数据集A,推理机R_1是否计算出Q的更多答案w.r.t. T和A比推理机R_2。这允许应用程序开发人员选择为Q和T提供最高程度的完整性的推理器,该推理器与应用程序可伸缩性需求兼容。因此,我们的研究结果提供了一个理论和实践的基础,为未来的基于本体的信息系统,最大限度地提高可扩展性,同时最大限度地减少甚至消除查询答案的不完整性的设计。

英文摘要:

To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at least one query, ontology, and data set. The lack of completeness guarantees, however, may be unacceptable for applications in areas such as health care and defence, where missing answers can adversely affect the applications functionality. Furthermore, even if an application can tolerate some level of incompleteness, it is often advantageous to estimate how many and what kind of answers are being lost. In this paper, we present a novel logic-based framework that allows one to check whether a reasoner is complete for a given query Q and ontology T---that is, whether the reasoner is guaranteed to compute all answers to Q w.r.t. T and an arbitrary data set A. Since ontologies and typical queries are often fixed at application design time, our approach allows application developers to check whether a reasoner known to be incomplete in general is actually complete for the kinds of input relevant for the application. We also present a technique that, given a query Q, an ontology T, and reasoners R_1 and R_2 that satisfy certain assumptions, can be used to determine whether, for each data set A, reasoner R_1 computes more answers to Q w.r.t. T and A than reasoner R_2. This allows application developers to select the reasoner that provides the highest degree of completeness for Q and T that is compatible with the applications scalability requirements. Our results thus provide a theoretical and practical foundation for the design of future ontology-based information systems that maximise scalability while minimising or even eliminating incompleteness of query answers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑