Similarity-based relaxed instance queries
Similarity-based relaxed instance queries
复制标题
基于相似性的宽松实例查询
DOI：
10.1016/j.jal.2015.01.002
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Anni
中科院分区：
文献类型：
--
作者：
Andreas Ecke;R. Peñaloza;Anni
摘要在描述逻辑(DL)知识库(KBS)中，信息通常由清晰的概念捕获。对于许多实际应用程序来说，使用清晰的概念查询知识库过于严格；用户可能愿意在查询中失去一些精度，以换取更多的答案选择。相似性度量可以提供一种受控的方式，在用户指定的限制内逐渐放宽查询概念。在本文中，我们使用概念相似度松弛的概念来形式化描述描述语言知识库的实例查询回答任务。我们研究了DL EL中这一任务的计算算法，它们的复杂性和CSMS所采用的特性，无论是使用展开的还是通用的TBox。对于一般Tbox的情况，我们定义了一族CSM，在评估概念的相似性时，它考虑了完整的Tbox信息。
Abstract In Description Logics (DL) knowledge bases (KBs), information is typically captured by clear-cut concepts. For many practical applications querying the KB by crisp concepts is too restrictive; a user might be willing to lose some precision in the query, in exchange of a larger selection of answers. Similarity measures can offer a controlled way of gradually relaxing a query concept within a user-specified limit. In this paper we formalize the task of instance query answering for DL KBs using concepts relaxed by concept similarity measures (CSMs). We investigate computation algorithms for this task in the DL EL, their complexity and properties for the CSMs employed regarding whether unfoldable or general TBoxes are used. For the case of general TBoxes we define a family of CSMs that take the full TBox information into account, when assessing the similarity of concepts.
影响因子：
5
作者：
Motik, Boris;Shearer, Rob;Horrocks, Ian
通讯作者：
Horrocks, Ian