描述逻辑FL_0循环术语集的可满足性  

Satisfiability of terminological cycles in description logic FL_0

作　　者：汪天友[1] 曹发生[2,3] 

机构地区：[1]贵阳学院数学系,贵阳550005 [2]毕节学院逻辑与文化研究中心数学系,贵州毕节551700 [3]中山大学逻辑与认知研究所,广州510275

出　　处：《计算机工程与应用》2012年第14期56-59,共4页Computer Engineering and Applications

基　　金：贵州省教育厅自然科学基金项目(No.黔教科20090068);贵州省重点支持学科(逻辑学)项目

摘　　要：循环术语集是描述逻辑长期以来的研究难点,它的最基本的问题即语义及推理问题没有得到合理的解决。分析了描述逻辑循环术语集的研究现状和存在的问题,基于图的互模拟的方法,给出了描述逻辑FL0循环术语集的可满足性条件。结果证明循环术语集的可满足性的推理是多项式复杂的。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 bisimulation of graphs,the satisfiability condition of description logic FL0,which may include terminological cycles is presented,is given.And it is also proved that the model of description logic FL0 can be reasoned in polynomial time.

关 键 词：描述逻辑 FL0 互模拟 

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