描述逻辑FL-循环术语集的语义及推理  

Semantics and Reasoning of Terminological Cycles in Description Logic FL^-

作　　者：蒋运承[1] 王驹[1] 邓培民[2] 汤庸[3] 

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

出　　处：《计算机学报》2008年第2期185-195,共11页Chinese Journal of Computers

基　　金：国家自然科学基金(60663001,60673135,60373081,60573010);广东省自然科学重点基金(04105503);广西青年科学基金(桂科青0640030)资助

摘　　要：循环术语集是描述逻辑长期以来的研究难点,它的最基本的问题即语义及推理问题没有得到合理的解决.文中分析了描述逻辑循环术语集的研究现状和存在的问题,在Baader的基础上进一步研究了描述逻辑FL^-循环术语集的语义及推理问题.给出了FL^-循环术语集的语法、语义和不动点模型的构造方法.针对FL^-循环术语集的需要,提出了一种新的有限自动机,使用有限自动机给出了不动点语义和描述语义下FL^-循环术语集的可满足性和包含推理算法,证明了推理算法的正确性,并给出了推理算法的复杂性定理.Terminological cycles have been a difficult spot in the study of description logics for quite a few years. The basic problems, such as their semantics and reasoning mechanisms, have not been reasonably well settled. The current research progresses and the existing problems of terminological cycles in description logics are analyzed in this paper. Based on the work of Baader F, the semantics and reasoning of terminological cycles in description logic FL- are further studied. The syntax, semantics, and construction method of fixpoint models of terminololgical cycles in FL^- are given. Aiming at the requirement of terminololgical cycles in FL^-, a kind of new finite automata is presented, and the satisfiability and subsumption reasoning algorithms of terminological cycles in FL^- w. r. t. fixpoint semantics and descriptive semantics are presented using finite automata. The correctness of reasoning algorithms is proved, and the complexity property of reasoning algorithms is given.

关 键 词：描述逻辑 循环术语集 不动点语义 描述语义 有限自动机 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]