Revision of stratified OWL ontologiesbased on integer linear programming  

基于整数线性规划的分层OWL本体修正

作　　者：Ji Qiu Qi Guilin Boutouhami Khaoula 季秋;漆桂林;Boutouhami Khaoula(南京邮电大学现代邮政学院,南京210023;东南大学计算机科学与工程学院,南京211189;东南大学教育部计算机网络与信息整合重点实验室,南京211189)

机构地区：[1]School of Modern Posts, Nanjing University of Posts and Telecommunications, Nanjing 210023, China [2]School of Computer Science and Engineering, Southeast University, Nanjing 211189, China [3]Key Laboratory of Computer Network and Information Integration of Ministry of Education,Southeast University, Nanjing 211189, China

出　　处：《Journal of Southeast University(English Edition)》2020年第1期1-7,共7页东南大学学报（英文版）

基　　金：The National Natural Science Foundation of China(No.61602259,U1736204);Research Foundation for Advanced Talents of Nanjing University of Posts and Telecommunications(No.NY216022);the National Key Research and Development Program of China(No.2018YFC0830200).

摘　　要：To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-based model considers an optimization problem of minimizing a linear objective function which is suitable for selecting the minimal number of axioms to remove when revising ontologies.Based on the incision function,a revision algorithm is proposed to apply ILP to all minimal incoherence-preserving subsets(MIPS).Although this algorithm can often find a minimal number of axioms to remove,it is very time-consuming to compute MIPS.Thus,an adapted revision algorithm to deal with unsatisfiable concepts individually is also given.Experimental results reveal that the proposed ILP-based revision algorithm is much more efficient than the commonly used algorithm based on the hitting set tree.In addition,the adapted algorithm can achieve higher efficiency,while it may delete more axioms.为了修正分层OWL(web ontology language)本体,通过定义新的冲突分层和基于整数线性规划(ILP)的切割函数扩展了核修正算子.基于ILP的模型考虑了最小化线性目标函数的优化问题,适合于修正本体时移除最少数量的公理.基于该切割函数,提出了一个修正算法,将ILP应用到所有最小的不协调保持子集(MIPS)上.该算法虽然能够经常找到用于移除的最少公理,但计算MIPS非常耗时.因此,又提出另一个改进的修正算法用于逐个处理不可满足概念.实验结果表明:提出的基于ILP的修正算法比经常使用的基于碰集树的算法更加高效;改进的修正算法能够达到更高的效率,但可能会删除更多的公理.

关 键 词：ontology revision inconsistency handling semantic web integer linear programming 

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