一种在DL-Lite中计算本体最小不可满足保持子集的算法  

An Algorithm for Calculating Minimal Unsatisfiability-Preserving Subsets of Ontology in DL-Lite

作　　者：周丽平[1,2] 黄厚宽[1] 漆桂林[3] 瞿有利[1] 季秋[3] 

机构地区：[1]北京交通大学计算机与信息技术学院,北京100044 [2]北京北方计算中心,北京100091 [3]东南大学计算机科学与工程学院,南京211189

出　　处：《计算机研究与发展》2011年第12期2334-2342,共9页Journal of Computer Research and Development

基　　金：国家"九七三"重点基础研究发展计划基金项目(2007CB307100;2007CB307106);国家自然科学基金项目(61003157);北京市科技计划基金项目(Z09050600910902)

摘　　要：在本体工程中,寻找不可满足概念或角色的本体最小不可满足保持子集是一个重要的研究课题,因为它可以提供一些有用的信息用于处理本体的不一致任务,比如分析本体、调试本体、修改本体等.现有的方法主要面向推理复杂度很高的高表达能力描述逻辑(DL).针对低复杂度描述逻辑DL-Lite,通过分析DL-Lite中不可满足概念或角色所具有的特点,提出了一种有效地计算DL-Lite本体中不可满足概念或角色的本体最小不可满足保持子集的算法.最后将算法与当前最有代表性的算法进行了比较,结果表明所提出的算法对于DL-Lite本体来说是有效的.Inconsistencies occur frequently in ontology lifecycle, such as ontology construction, ontology evolution and ontology merging. Handling inconsistencies, especially, handling logical inconsistency in ontologies is increasingly recognized as an important research topic. Finding all the MUPS （minimal unsatisfiability-preserving sub-TBox） of an ontology for an unsatisfiable concept or role is an important problem because it can provide valuable information for many different tasks of inconsistency handling, such as diagnosing ontology, debugging ontologies and revising ontologies. Many approaches have been proposed to deal with this issue, however, the main drawback of these algorithms is their high computational complexity. One of the main sources of high complexity is the intractability of the underlying description logics （DLs） which may hinder practical applications to very large real life ontologies. In this paper, we focus on DL-Lite, an important tractable description logic which can keep all reasoning tasks tractable and is tailored specifically to deal with large amounts of data. After analyzing some features of unsatisfiable concepts or unsatisfiable roles in DL-Lite, we present an algorithm for computing all MUPS of an ontology for an unsatisfiable concept or role in a DL-Lite ontology. We also present a comparison of our algorithm with another representative algorithm. The results indicate that the proposed algorithm is effecient for real-life DL-Lite ontologies.

关 键 词：语义WEB 描述逻辑 DL-Lite 本体 MUPS 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]