| 注册
首页|期刊导航|南京大学学报(自然科学版)|基于关联解释的术语集MUPS求解方法

基于关联解释的术语集MUPS求解方法

崔仙姬 欧阳丹彤 何加亮 高健

南京大学学报(自然科学版)2018,Vol.54Issue(1):56-63,8.
南京大学学报(自然科学版)2018,Vol.54Issue(1):56-63,8.DOI:10.13232/j.cnki.jnju.2018.01.007

基于关联解释的术语集MUPS求解方法

Associate interpretation based MUSP calculation in terminologies

崔仙姬 1欧阳丹彤 2何加亮 2高健3

作者信息

  • 1. 大连民族大学信息与通信工程学院,大连,116600
  • 2. 符号计算与知识工程教育部重点实验室(吉林大学),长春,130012
  • 3. 吉林大学计算机科学与技术学院,长春,130012
  • 折叠

摘要

Abstract

Ontology debugging is one of the non-standard reasoning tasks in artificial intelligence,which is very important for the ontology engineering.Ontology debugging is mainly used to find out the interpretations which may cause the logical conflicts in ontologies,and further revise the ontologies to eliminate these conflicts.Technically,cal-culating minimal unsatisfiability-preserving sub-TBox (MUPS)is the core issue in the ontology debugging.The existing work of MUPS calculation investigates two approaches:one based on modifying the internal of a description logic reasoner(the "glass-box"technology),and other based on using an unmodified external reasoner(the "black-box"technology).In our work,one method using syntactic relevance and associate interpretation is proposed to calculate the MUPS for the unsatisfiable classes and terminologies.This method is based on the traditional black-box technology,and further optimizes the expansion and prune procedure in the traditional black-box technology.Firstly, we extend the candidate unsatisfiable sub-TBox by adding the axioms which are structurally relevant with the axioms that contain unsatisfiable classes.By doing this,we can eliminate the irrelevant axioms for the satisfiability to the extent,which may reduce the size of the axioms in terminologies to be checked.Then,the MUPS calculation can be seen as the procedure of seeking the critical axioms in the MUPS.In this procedure,we propose the definition of the associate interpretation,and the associate interpretation is introduced to construct special interpretation which can be used to check the satisfaction of axioms in candidate minimal unsatisfiable sub-TBox.And the number of reasoner call is reduced and further the reasoning problem in each iteration is also simplified.Finally,we realize the algorithm and compare it with the optimizations of the black box algorithm.The experimental results show that the proposed method can effectively improve the efficiency of MUPS calculation in the terminology.

关键词

描述逻辑/本体调试/极小不可满足保持子术语集/关联解释

Key words

description logics/ontology debugging/minimal unsatisfiability-preserving sub-TBox (MUPS )/associate interpretation

分类

信息技术与安全科学

引用本文复制引用

崔仙姬,欧阳丹彤,何加亮,高健..基于关联解释的术语集MUPS求解方法[J].南京大学学报(自然科学版),2018,54(1):56-63,8.

基金项目

国家自然科学基金(61672261,61502199,61402070),辽宁省自然科学基金(2015020023),符号计算与知识工程教育部重点实验室开放课题(93K172016k02),大连民族大学自主基金(DC201501060) (61672261,61502199,61402070)

南京大学学报(自然科学版)

OACSCDCSTPCD

0469-5097

访问量0
|
下载量0
段落导航相关论文