ISSN 1000-1239 CN 11-1777/TP

• 人工智能 •

### 描述逻辑FL0的包含推理及其保守扩充

1. 1(贵州工程应用技术学院理学院 贵州毕节 551700); 2(广西师范大学计算机科学与信息工程学院 广西桂林 541004) ; 3(广西师范大学漓江学院 广西桂林 541004) (niedengguo@126.com)
• 出版日期: 2015-01-01
• 基金资助:
基金项目：贵州省2013年度贵州省科技厅毕节市科技局毕节学院科技联合基金计划项目(黔科合J字LKB［2013］23号)|国家自然科学基金项目(61103169)|北京大学国家高性能计算重点实验室开放课题(HCST201302)

### 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

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.