东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

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

ISSN号：1000-1239
期刊名称：《计算机研究与发展》
时间：0
分类：TP301[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
作者机构：[1]广西师范大学计算机科学与信息工程学院,广西桂林541004, [2]中山大学计算机科学系,广州510275
相关基金：国家自然科学基金项目（60663001,60573010,60673135,60373081）;中国博士后科学基金项目（20060400226）;广西自然科学基金项目（桂科青0640030.桂科自0832103）;广西科学研究与技术开发计划基金项目（桂科攻0719001-11）

关键词：描述逻辑, 循环术语集, 不动点语义, 描述语义, 混合推理, description logics, terminological cycle, fixpoint semantics, descriptive semantics, hybrid reasoning

中文摘要：

循环术语集是描述逻辑长期以来的研究难点,它最基本的问题即语义及推理问题没有得到合理的解决.分析了描述逻辑循环术语集的研究现状和存在的问题,在Baader和Brandt的基础上进一步研究了描述逻辑εL循环术语集的混合推理问题.给出了εL的混合循环知识库的语法和语义（包括不动点语义和描述语义）.针对εL循环术语集混合推理的需要,提出了TBox-完全的概念,并重新定义了描述图（包括语法描述图和语义描述图）.使用描述图之间的模拟关系和TBox-完全概念给出了最大不动点语义和描述语义下εL混合循环知识库的实例检测推理算法,证明了推理算法的正确性,并给出了推理算法的复杂性定理.

英文摘要：

Description logic is a logical reconstruction of the frame-based knowledge representation languages, with the aim of providing a simple well-established declarative semantics to capture the meaning of structured representation of knowledge. Terminological cycles have been a difficult spot in the study of description logic 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 logic are analyzed in this paper. Based on the works of Baader and Brandt, the hybrid reasoning of terminological cycles in description logic εL is further studied. The syntax and semantics （including fixpoint semantics and descriptive semantics） of hybrid knowledge bases in εL are given. Aiming at the requirement of hybrid reasoning of terminological cycles in εL, TBox-completion is presented, and the description graphs （including syntax description graph and semantics description graph） are redefined. The instance checking reasoning algorithms of hybrid knowledge bases in εL w. r. t. greatest fixpoint semantics and descriptive semantics are presented using TBox-completion and description graphs. The correctness of reasoning algorithms is proved, and the complexity property of reasoning algorithms is given. Theoretical foundation for the hybrid reasoning of terminological cycles in eL is provided through the instance checking reasoning algorithms.

同期刊论文项目