计算机科学 ›› 2016, Vol. 43 ›› Issue (Z6): 83-86.doi: 10.11896/j.issn.1002-137X.2016.6A.019

• 智能计算 • 上一篇    下一篇

描述逻辑εVL的保守扩充

聂登国,余泉,张维,申宇铭   

  1. 贵州工程应用技术学院理学院 毕节551700,黔南民族师范学院数学系 都匀 558000,黔南民族师范学院数学系 都匀 558000,广东外语外贸大学思科信息学院 广州510420
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受贵州省2013年度贵州省科技厅、毕节市科技局、毕节学院科技联合基金计划项目(黔科合J字LKB[2013]23号),贵州省科学技术基金资助

Conservative Extensions in Description Logic εVL

NIE Deng-guo, YU Quan, ZHANG Wei and SHEN Yu-ming   

  • Online:2018-12-01 Published:2018-12-01

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

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

Abstract: 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 εVL system was analyzed based on Lutzs’ work.Firstly the εVL canonical model was constructed and the inclusion inference was reduced to the simulations between two εVL canonical model.The complexity was pointed out to be polynomial based on that the canonical models’ largest simulation is polynomial.After that the εVL conservative extension algorithm was presented and its complexity was proved to be exponential.

Key words: Description logic,Canonical model,Conservative expansion,Ontology

[1] 唐素勤,蔡自兴,王驹,等.基于最大不动点模型的描述逻辑系统FLE的有穷基[J].计算机研究与发展,2010,7(9):1514-1521
[2] 孙晋永,古天龙,常亮.基于描述逻辑的事例推理综述[J].计算机科学,2014,1(11):1-6,39
[3] 蒋运承,唐素勤,王驹,等.带传递关系和存在量词的描述逻辑MSC推理[J].计算机研究与发展,2009,6(6):979-987
[4] Antoniou G,Kehagias A.On the refinement of ontologiess [J].International Journal of Intelligent System,2000,5(7):623-632
[5] Lutz C,Wolter F.Deciding inseparability and conservative ex-tensions in the description logic EL [J].Journal of Symbolic Computation,2010,45(2):194-228
[6] Ghilardi S,Lutz C,Wolter F.Did I damage my ontology?[C]∥Int Conf on Principles of Knowledge Representation and Reasoning.Menlo Park,CA:AAAI Press,2006:187-197
[7] Lutz C,Walther D,Wolter F.Conservative extensions in expressive description logics[C]∥Proc of the 20th Int Conf on Artifical Intelligence.San Francisco.CA:Morgan Kaufmann Publi-shers,2007:453-458
[8] Lutz C,Wolter F.Deciding inseparability and conservative ex-tensions in the description logic EL[J].Journal of Symbolic Computation,2010,45(2):194-228
[9] 聂登国.描述逻辑系统VL的保守扩充[D].桂林:广西师范大学,2012
[10] 聂登国,康旺强,曹发生,等.描述逻辑FL_0的包含推理及其保守扩充[J].计算机研究与发展,2015(1):221-228
[11] 康旺强.轻量级描述逻辑FL的保守扩充[D].桂林:广西师范大学,2012
[12] 申宇铭,王驹,唐素勤.描述逻辑εLU概念及术语公理集的表达能力刻画[J].软件学报,2014(8):1794-1805
[13] 王驹,蒋运承,申宇铭.描述逻辑系统 VL 循环术语集的可满足性及推理机制[J].中国科学信息科学,2009,39(2):205-211
[14] 申宇铭,文习明,王驹.描述逻辑FL_0概念及术语公理集的表达能力刻画[J].计算机科学,2014,41(12):206-210,215

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!