一种基于图的DL-Lite本体最小不可满足保持子集的计算方法  

A Graph-Based Approach for Calculating Minimal Unsatisfiability-Preserving Subsets of Ontology in DL-Lite

作　　者：付雪峰[1] 漆桂林[2] 张勇[2] 

机构地区：[1]南昌工程学院信息工程学院,江西南昌330099 [2]东南大学计算机科学与工程学院,江苏南京210096

出　　处：《电子学报》2016年第9期2040-2045,共6页Acta Electronica Sinica

基　　金：国家"八六三"高技术研究发展计划基金项目(No.2015AA015406);国家自然科学基金(No.61272378);江西省教育厅青年科学基金项目(No.GJJ12643)

摘　　要：演变中的本体常出现不一致性问题,这将导致标准推理失效.针对不一致性问题,最小不可满足保持子集能够提供本体中概念不可满足的解释.计算最小不可满足保持子集是本体工程中的一项重要的非标准推理任务,但多数计算方法须借助外部的推理机,导致计算的效率不高.为了减少对推理机的依赖,本文提出了一种基于图的最小不可满足保持子集的计算方法.新的方法面向DL-Lite描述逻辑家族,将DL-Lite本体转换成图,将本体中的最小不可满足保持子集转换成图上的最小不可满足保持路径对.对比实验表明,基于图的方法提高了计算的效率和稳定性.Inconsistency often occurs during ontology evolution,and leads to the invalidity of standard reasoning.Minimal unsatisfiablility-preserving sub-TBox（ MUPS） can provide an explanation of the unsatisfiability of a concept in an ontology. Finding all MUPS is an important nonstandard reasoning task in ontology engineering. Most of the approaches for calculating MUPS are built on external description logic reasoners. However,a reasoner-based method can hardly achieve positive efficiency and stability. In this paper,we propose a reasoner-independent approach to calculating MUPS using graph representation. We first transform DL ontologies to graphs,and find MUPS by computing the minimal unsatisfiability-preserving path-pair（ MUPP） based on the transformed graphs. We implement and evaluate our approach. The experimental results demonstrate that our approach performs well in efficiency and stability.

关 键 词：本体 描述逻辑 不一致处理 最小不可满足保持子集 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]