Computer Science ›› 2017, Vol. 44 ›› Issue (Z11): 136-140, 147.doi: 10.11896/j.issn.1002-137X.2017.11A.028

Previous Articles     Next Articles

Conservative Extension in Description Logic εL with Cyclic Terminologies

WANG Yong-hong, SHEN Yu-ming, NIE Deng-guo and WANG Ju   

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

Abstract: In computer science,ontologies are dynamic entities.To make them adapt to new and evolving applications,it is necessary to constantly perform modifications such as the extension with new axioms and merging with other ontologies.Based on the different requires and application domains,users choose the appropriate ontology to import another ontology and implement the extension of the existing ontology in many application domains of developing ontologies.We argued that it is very significant to know that the resulting ontology remains a conservative extension of the original one after performing such modifications.If this is not the case,there may be unexpected consequences when using the modified ontology in the place of the the existing one in applications.Lutz et al. studied the conservative extension problem of description logic and proved that conservative extension remaines ExpTime-completeness.The conservative extension in the description logic with cyclic terminolgies was analyzed based on Lutz’s work.On the one hand,the sufficient condition of conservative extensions with respect to greatest fixpoint semantics in the description logic with cyclic termino-logies has the same primitive concepts,and its complexity is proved to be polynomial.On the other hand,conservative extension ofterminological cycles with respect to the greatest fixpoint semantics is prestented and its complexity is proved to be exponential.

Key words: Ontologies,Description logic,Cyclic terminologies,Conservative extension

[1] BAADER F,NUTT W.Basic description logics[M]∥The Description Logic Handbook:Theory,Implementation,and Applications.Cambridge University Press,2003:45-100.
[2] HORROCKS I,PATEL-SCHNEIDER P F,HARMELEN F V.From SHIQ and RDF to OWL:The making of a Web ontology language[J].Journal of Web Semantics,2003,1(1):7-26.
[3] ANTONIOU G,KEHAGIAS A.A note on the refinement ofontologies[J].International Journal of Intelligent System,2000,15(7):623-632.
[4] GHILARDI S,LUTZ C,WOLTER F.Did I damage my ontology? a case for conservative extensions in description logics[C]∥Proceedings of KR’06.AAAI Press,2006:187-197.
[5] LUTZ C,WALTHER F,WOLTER F.Conservative extensions in expressive description logics[C]∥Proceeding of the 20th International Conference on Artificial Intelligence (IJCAI07).Hyderabad,India:AAAI Press,2007:453-458.
[6] LUTZ C,WOLTER F.Conservative extionsions in the light-weight description logic EL[C]∥Proceeding of CADE’07.vol.4603 of LNCS.Springer,2007:84-99.
[8] KONEV B,WALTHER D,WOLTER F.The logical differenceproblem for description logic terminologies[C]∥Proceedings of the 4th International Joint Conference on Automated Reasoning(IJCAR08).Sydney,Australia:Springer,2008:259-274.
[9] KONTCHAKOV R,WOLTER F,ZAKHARASCHEV M.Logic-based ontology commparsion and module extraction with an appliction to DL-Lite[J].Artificial Intelligence,2010,174(15):1093-1141.
[10] 聂登国,康旺强,曹发生,等.描述逻辑的包含推理及其保守扩充[J].计算机研究与发展,2015,2(1):221-228.
[11] 聂登国,余泉,张维,等.描述逻辑的保守扩充[J].计算机科学,2016,3(6A):83-86.
[12] 王驹,陈光喜,余泉.描述逻辑的二阶线性推理机制[J].软件学报,2017,8(2):216-233.
[13] TARSKI A.Lattice-theoretic fixpoint theorem and its application[J].Pacific Journal of Mathemaics,1995(5):285-309.
[14] BADDER F.Terminological cycles in a descript-ion logic withexistential restrictions[C]∥Proc.of IJCAI-03.Morgan Kaufmann Publishers,2003:325-330.
[15] KURTONINA N,DE RIJKE M.Expressive of concept expression in first-order description logics[J].Artificial Intelligence,1999,107(2):303-333.
[16] BRNADT S,MODEL J.Subsumption in w.r.t.hybrid TBoxes[M]∥Ulrich Furbach.KI,Volume 3698 of Lecture Notes in Computer Science.Springer,2005:34-48.

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 .