描述逻辑εL循环术语集的保守扩充  

Conservative Extension in Description Logic εL with Cyclic Terminologies

作　　者：王勇红 申宇铭[2] 聂登国 王驹[4] 

机构地区：[1]江西师范高等专科学校数学与信息技术学院,鹰潭335000 [2]广东外语外贸大学思科信息学院,广州510420 [3]贵州工程应用技术学院理学院,毕节551700 [4]桂林电子科技大学广西可信软件重点实验室,桂林541004

出　　处：《计算机科学》2017年第B11期136-140,147,共6页Computer Science

基　　金：江西省教育厅科学技术研究项目(GJJ151348);国家自然科学基金项目(61103169;61463044);广西可信软件重点实验室研究课题(kx201330)资助

摘　　要：在计算机科学中,本体是动态的实体。为了适应新领域的发展,需要对原始本体增加新的公理或者与另一个本体融合。在本体的开发过程中,用户根据不同的需求和应用领域选择合适的本体导入另一个本体,从而实现对已建本体的扩充。判定扩充后的本体是否是扩充前本体的保守扩充是非常重要的。如果扩充后的本体不是扩充前本体的保守扩充,那么用户使用扩充后的本体将产生不可预知的影响。Lutz等研究了描述逻辑εL的保守扩充问题,并且论证了εL的保守扩充是指数时间完全的。在Lutz等人的研究基础上研究了描述逻辑循环术语集的保守扩充问题。首先,给出了循环术语集在最大不动点语义下的保守扩充的充分条件是两个TBox具有相同的原始概念,并论证了该算法是多项式时间复杂的。其次,给出最大不动点模型来处理循环术语集的保守扩充,并论证了该算法是指数时间复杂的。In computer science,ontologies are dynamic entities. To make them adapt to new and evolving applications,it is necessary to constantly perform modifications such as the extension with new axioms and merging with other ontolo-gies. Based on the different requires and application domains,users choose the appropriate ontology to import another ontology and implement the extension of the existing ontology in many application domains of developing ontologies. We argued that it is very significant to know that the resulting ontology remains a conservative extension of the original one after performing such modifications. If this is not the case, there may be unexpected consequences when using the modi-fied ontology in the place of the the existing one in applications. Lutz et al. studied the conservative extension problem of description logic and proved that conservative extension remaines ExpTime-completeness. The conservative extension in the description logic with cyclic terminolgies was analyzed based on Lutzes work. On the one hand, the sufficient con-dition of conservative extensions with respect to greatest fixpoint semantics in the description logic with cyclic termino-logies has the same primitive concepts, and its complexity is proved to be polynomial. On the other hand, conservative extension ofterminological cycles with respect to the greatest fixpoint semantics is prestented and its complexity is proved to be exponential.

关 键 词：本体 描述逻辑 循环术语集 保守扩充 

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