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

FU Xue-feng; QI Gui-lin; ZHANG Yong

doi:10.3969/j.issn.0372-2112.2016.09.002

您当前的位置：

首页 >

文章列表页 >

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

更新时间：2025-07-16

- A Graph-Based Approach for Calculating Minimal Unsatisfiability-Preserving Subsets of Ontology in DL-Lite
- Acta Electronica Sinica Vol. 44, Issue 9, Pages: 2040-2045(2016)
- 作者机构：
  
  1. 南昌工程学院信息工程学院,江西,南昌,330099
  2. 东南大学计算机科学与工程学院,江苏,南京,210096
  3. 南昌工程学院信息工程学院,江西,南昌,330099
  4. 东南大学计算机科学与工程学院,江苏,南京,210096
- 作者简介：
- 基金信息：
  
  Program supported by National High-tech R&D Program of China (863 Program) (No.2015AA015406);National Natural Science Foundation of China (No.61272378);Youth Science Foundation Project of Education Department of Jiangxi Province (No.GJJ12643)
- DOI：10.3969/j.issn.0372-2112.2016.09.002
  CLC： TP391
- Published Online：25 September 2016，
  
  Published：2016
- 稿件说明：
移动端阅览
FU Xue-feng, QI Gui-lin, ZHANG Yong. A Graph-Based Approach for Calculating Minimal Unsatisfiability-Preserving Subsets of Ontology in DL-Lite[J]. Acta Electronica Sinica, 2016, 44(9): 2040-2045.
DOI：

FU Xue-feng, QI Gui-lin, ZHANG Yong. A Graph-Based Approach for Calculating Minimal Unsatisfiability-Preserving Subsets of Ontology in DL-Lite[J]. Acta Electronica Sinica, 2016, 44(9): 2040-2045. DOI： 10.3969/j.issn.0372-2112.2016.09.002.

摘要

演变中的本体常出现不一致性问题，这将导致标准推理失效.针对不一致性问题，最小不可满足保持子集能够提供本体中概念不可满足的解释.计算最小不可满足保持子集是本体工程中的一项重要的非标准推理任务，但多数计算方法须借助外部的推理机，导致计算的效率不高.为了减少对推理机的依赖，本文提出了一种基于图的最小不可满足保持子集的计算方法.新的方法面向DL-Lite描述逻辑家族，将DL-Lite本体转换成图，将本体中的最小不可满足保持子集转换成图上的最小不可满足保持路径对.对比实验表明，基于图的方法提高了计算的效率和稳定性.

Abstract

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.

关键词

Keywords

references

Views

427

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An Interactive Query Generation Method for Semantics-based Component Retrieval

Related Author

FONT

OUYANG Dang-tong

YE Yu-xin

Verdana

FONT face

MING Zhong

CAI Shu-bin

LI Shi-xian

Related Institution

Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education

College of Computer Science and Technology, Jilin University

Jiangxi Electric Information and Communication CompanyNanchangJiangxi 330077China

School of Computer and SoftwareShenzhen UniversityShenzhenGuangdong 518060China

Department of Computer ScienceSUN Yat-sen UniversityGuangzhouGuangdong 510275China

⁰