ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2015, Vol. 52 ›› Issue (1): 221-228.doi: 10.7544/issn1000-1239.2015.20131135

• 人工智能 • 上一篇    下一篇



  1. 1(贵州工程应用技术学院理学院 贵州毕节 551700); 2(广西师范大学计算机科学与信息工程学院 广西桂林 541004) ; 3(广西师范大学漓江学院 广西桂林 541004) (
  • 出版日期: 2015-01-01
  • 基金资助: 

Containing Reasoning and Its Conservative Extensionsin Description Logic FL0

Nie Dengguo1,Kang Wangqiang3,Cao Fasheng1,Wang Ju2   

  1. 1(College of Science, Guizhou University of Engineering Science, Bijie, Guizhou 551700); 2(College of Computer Science and Information Engineering, Guangxi Normal University, Guilin, Guangxi 541004); 3(College of Lijiang, Guangxi Normal University, Guilin, Guangxi 541004)
  • Online: 2015-01-01

摘要: 本体作为知识库表示知识已经成为计算机理论与应用的研究热点.在描述逻辑中,将本体看作一个逻辑理论,一个本体被形式化为给定的描述逻辑系统的一个Tbox.本体是动态的实体,为了适应新领域的发展,需要对原始本体进行扩充.但是扩充后的本体与原始本体是否保持逻辑一致性是目前研究者们所关注的焦点.在Lutz等人研究的基础上探究FL0的保守扩充问题.首先构建了FL0的典范模型,将包含推理问题转换为典范模型的模拟问题;其次由典范模型之间的最大模拟是多项式时间复杂的,证明了FL0的包含推理是多项式时间复杂的;最后给出描述逻辑FL0的保守扩充及其判定算法,证明了FL0的保守扩充的判定算法是指数时间复杂的.

关键词: 描述逻辑, 典范模型, 保守扩充, 本体, 包含推理

Abstract: Conservative extension is an important property in the mathematical logic. Its notion plays acentral role in ontology design and integration. It can be used to formalize ontology refinements,safe mergings of two ontologies, and independent modules inside an ontology. Regarding reasoning support, the most basic task is to decide whether one ontology is a conservative extension of another. If this is not the case, the evolution of the ontology with the original ontology will not be able to maintain the same logical conclusion. In recent years, lightweight description logics (DLs) have gained increasing popularity. In fact ontology is definitely the structured knowledge base in description logic. As we know, knowledge is not always the same, so it needs to be extended as long as new improvement appears in this field. It is concerned that whether it is consistent with the primitive one after extension. The conservative extension of FL0 system is analyzed based on Lutzs’ work. Firstly the FL0 canonical model is constructed and the inclusion inference is reduced to the simulations between two FL0 canonical models. The complexity is pointed out to be polynomial based on the fact that the canonical models’ largest simulation is polynomial. After that the FL0 conservative extension algorithm is presented and its complexity is proved to be exponential.

Key words: description logic, canonical model, conservative expansion, ontology, contain reasoning