带RVM的描述逻辑εL混合循环术语集的语义及推理  

Semantics and Reasoning of Hybrid Terminological Cycles in Description Logic εL with RVM

作　　者：蒋运承[1,2] 王驹[1] 周生明[1] 汤庸[2] 

机构地区：[1]广西师范大学计算机科学与信息工程学院,桂林541004 [2]中山大学计算机科学系,广州510275

出　　处：《模式识别与人工智能》2008年第1期18-27,共10页Pattern Recognition and Artificial Intelligence

基　　金：国家自然科学基金项目(No.60663001,60673135,60373081,60573010);中国博士后科学基金项目(No.20060400226);广西青年科学基金项目(No.桂科青0640030)资助

摘　　要：分析描述逻辑循环术语集的研究现状和存在的问题,在F.Baader和S.Brandt的基础上进一步研究带RVM的描述逻辑εL混合循环术语集的语义及推理问题.给出带RVM的εL混合循环术语集的语法和语义.针对带RVM的εL混合循环术语集包含推理的需要,提出TBox-完全的概念,并重新定义描述图,使用描述图之间的模拟关系和TBox-完全给出最大不动点语义和描述语义下带RVM的εL混合循环术语集的概念包含推理算法,证明推理算法的正确性,并证明推理算法是多项式时间复杂的.The current research progresses and problems of terminological cycles in description logics are analyzed in this paper. Based on the research of Baader F and Brandt S, the semantics and reasoning of hybrid terminological cycles in description logic eL with RVM is further studied. The syntax and semantics of hybrid terminological cycles in description logic eL with RVM are given. Aiming at the requirement of subsumption reasoning of hybrid terminological cycles in description logic eL with RVM, TBox-completion is presented and the description graph is redefined. The subsumption reasoning algorithms of hybrid terminological cycles in description logic eL with RVM w. r. t. greatest fixpoint semantics and descriptive semantics are presented using TBox-completion and description graph.The correctness of reasoning algorithms has been proved. And it is also proved that the subsumption reasoning w. r. t. greatest fixpoint semantics and descriptive semantics can be computed in polynomial time.

关 键 词：描述逻辑 混合循环术语集 不动点语义 描述语义 关系-值-映射(RVM) 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]