计算机科学 ›› 2017, Vol. 44 ›› Issue (Z11): 136-140.doi: 10.11896/j.issn.1002-137X.2017.11A.028
王勇红,申宇铭,聂登国,王驹
WANG Yong-hong, SHEN Yu-ming, NIE Deng-guo and WANG Ju
摘要： 在计算机科学中,本体是动态的实体。为了适应新领域的发展,需要对原始本体增加新的公理或者与另一个本体融合。在本体的开发过程中,用户根据不同的需求和应用领域选择合适的本体导入另一个本体,从而实现对已建本体的扩充。判定扩充后的本体是否是扩充前本体的保守扩充是非常重要的。如果扩充后的本体不是扩充前本体的保守扩充,那么用户使用扩充后的本体将产生不可预知的影响。Lutz 等研究了描述逻辑εL的保守扩充问题,并且论证了εL的保守扩充是指数时间完全的。在Lutz等人的研究基础上研究了描述逻辑循环术语集的保守扩充问题。首先,给出了循环术语集在最大不动点语义下的保守扩充的充分条件是两个TBox 具有相同的原始概念,并论证了该算法是多项式时间复杂的。其次,给出最大不动点模型来处理循环术语集的保守扩充,并论证了该算法是指数时间复杂的。
| [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! |
|
||
首页