Graph-based approaches to debugging and revision of terminologies in DL-Lite
Graph-based approaches to debugging and revision of terminologies in DL-Lite
复制标题
基于图形的方法来调试和修订 DL-Lite 中的术语
DOI：
10.1016/j.knosys.2016.01.039
复制
发表时间：
2016-05
影响因子：
8.8
通讯作者：
Zhou, Zhangquan
中科院分区：
文献类型：
--
作者：
Fu, Xuefeng;Qi, Guilin;Zhang, Yong;Zhou, Zhangquan
在本文中，我们处理的问题，调试和修改不连贯的术语。本体调试的目的是解释不一致的原因，本体修改的目的是消除不一致。为此，我们提出了基于图的方法来处理调试和修订的术语的一个家庭的轻量级本体语言，DL-Lite。首先，我们将DL-Lite本体转换为图。为了解决本体调试问题，我们通过计算基于转换图的最小不一致保持路径对（MIPP）来计算本体的最小不一致保持子集（MIPS）。为了解决本体修正的问题，我们提出了修正状态的概念，它将本体的术语分为两个不相交的集合：想要的公理集和不想要的公理集。我们进一步根据修订状态定义修订操作符。之后，提出了两种修正算法来实例化修正算子：一种是基于评分函数的修正算法，另一种是基于碰集树的修正算法。我们实现了这些算法，并进行了本体调试和本体修改几个适应真实的本体的实验。本体调试实验结果表明，基于图的MIPS计算方法是有效的，优于现有技术;本体修改实验结果表明，基于评分函数的算法比基于碰集树的算法效率更高。
In this paper, we deal with the problem of debugging and revision of incoherent terminologies. Ontology debugging aims to provide the explanation of the causes of incoherence and ontology revision aims to eliminate the incoherence. For this purpose, we propose the graph-based approaches to deal with the debugging and revision of terminologies for a family of lightweight ontology languages, DL-Lite. First of all, we transform DL-Lite ontologies to graphs. To deal with the problem of ontology debugging, we calculate the minimal incoherence-preserving subsets (MIPS) of an ontology by computing the minimal incoherence-preserving path-pairs (MIPP) based on the transformed graph. To deal with the problem of ontology revision, we propose the notion of revision state which separates the terminology of an ontology into two disjoint sets: the set of wanted axioms and the set of unwanted axioms. We further define a revision operator based on the revision state. Afterward, two revision algorithms are proposed to instantiate the revision operator: one is based on a scoring function, and the other one is based on a hitting set tree. We implement these algorithms and conduct experiments of ontology debugging and ontology revision on several adapted real ontologies. The experimental results of ontology debugging show that our approach of calculating MIPS based on graph is efficient and outperforms the state of the art. The experimental results of ontology revision show that the algorithm based on a scoring function is more efficient than the algorithm based on a hitting set tree.
登录
查看更多内容
DOI：
10.1609/aaai.v28i1.8868
发表时间：
2014-06
期刊：
--
影响因子：
--
作者：
Zhiqiang Zhuang;Zhe Wang;Kewen Wang;G. Qi
通讯作者：
Zhiqiang Zhuang;Zhe Wang;Kewen Wang;G. Qi
DOI：
10.1007/978-3-540-76298-0_20
发表时间：
2007-11
期刊：
--
影响因子：
--
作者：
Aditya Kalyanpur;B. Parsia;M. Horridge;E. Sirin
通讯作者：
Aditya Kalyanpur;B. Parsia;M. Horridge;E. Sirin
DOI：
10.1609/aaai.v24i1.7593
发表时间：
2010-07
期刊：
Proceedings of the AAAI Conference on Artificial Intelligence
影响因子：
--
作者：
Zhe Wang;Kewen Wang;R. Topor
通讯作者：
Zhe Wang;Kewen Wang;R. Topor
DOI：
10.1007/s10817-007-9078-x
发表时间：
2007-10
期刊：
Journal of Automated Reasoning
影响因子：
--
作者：
Diego Calvanese;Giuseppe De Giacomo;D. Lembo;M. Lenzerini;R. Rosati
通讯作者：
Diego Calvanese;Giuseppe De Giacomo;D. Lembo;M. Lenzerini;R. Rosati
影响因子：
7.5
作者：
Amailef, Khaled;Lu, Jie
通讯作者：
Lu, Jie