arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.02898cs.LO
收藏

修复优先级和不一致DL-Lite知识库的递归算法

Recursive algorithms to repair prioritized and inconsistent dl-lite knowledge base

Ghassen Hamdi, Abdelmoutia Telli, Mohamed Nazih Omri

摘要:

优先级知识库的不一致性是因为断言(ABoxes)来自不同可靠性级别的多个来源。我们介绍了这种不一致的问题,查询不一致的\textit{DL-Lite}知识库的处理。在文献中,首先,修复\textit{DL-Lite}的不一致知识库的所有不一致断言。然而,我们的算法直接对知识库进行询问,以恢复给定查询的详尽答案列表。在第二次,修复这个列表的答案。我们的文章的新颖之处是一个经常性的功能,计算排名的一致性,以管理的不一致的反应集的命题。与现有算法相比,这种策略使我们能够减少执行时间。我们进行的实验研究以及结果的分析表明,我们的算法比其他算法更有生产力,因为它给出了最大数量的答案,同时从执行时间的角度保持最佳。最后,如我们的实验研究所示,它们允许有效地处理不一致性。这些事实使得所有维修都适合\textit {DL-Lite

英文摘要:

The inconsistency in prioritized knowledge base is because the assertions (ABoxes) come from several sources with different levels of reliability. We introduce the handling of this inconsistency problem to query inconsistent \textit{DL-Lite} knowledge bases. In the literature, firstly, repair all the inconsistent assertions of the \textit{DL-Lite}'s inconsistent knowledge base. Then, interrogate it. However, our algorithm, on proceeds directly with an interrogation of the knowledge base in order to recover an exhaustive list of answers to a given query. In a second time, to repair the answers of this list. The novelty of our article is the proposition of a recurring function that calculates the rank of coherence in order to manage the inconsistencies in the set of responses. This strategy allowed us to reduce execution time compared to existing algorithms. The experimental study as well as the analysis of the results, which we carried out, showed that our algorithm is much more productive than the other algorithms since it gives the greatest number of answers while remaining the best from the point of view of the execution time. Finally, as shown in our experimental studies, they allow an efficient handling of inconsistency. Such facts make all the repairs suitable for \textit{DL-Lite

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

↑