Computer Science ›› 2016, Vol. 43 ›› Issue (Z6): 83-86, 115.doi: 10.11896/j.issn.1002-137X.2016.6A.019

Previous Articles     Next Articles

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

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   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .