描述逻辑FL0循环术语集的可满足性-计算机工程与应用.PDFVIP

56 2012 ，48 （14） Computer Engineering and Applications 计算机工程与应用 描述逻辑FL 循环术语集的可满足性 0 1 2 ，3 汪天友 ，曹发生 1 2 ，3 WANG Tianyou , CAO Fasheng 1.贵阳学院 数学系，贵阳 550005 2.毕节学院 逻辑与文化研究中心 数学系，贵州 毕节 551700 3.中山大学 逻辑与认知研究所，广州 510275 1.Department of Math, Guiyang University, Guiyang 550005, China 2.Department of Math, Center for Logic, Language and Cognition, Bijie University, Bijie, Guizhou 551700, China 3.Institute of Logic and Cognition ，Sun Yat-sen University ，Guangzhou 510275 ，China WANG Tianyou, CAO Fasheng. Satisfiability of terminological cycles in description logic FL . Computer En- 0 gineering and Applications, 2012, 48 （14）：56-59. Abstract ：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 FL , which may include 0 terminological cycles is presented, is given. And it is also proved that the model of description logic FL0 can be rea- soned in polynomial time. Key words ：description logic; FL ; bisimulation 0 摘 要：循环术语集是描述逻辑长期以来的研究难点，它的最基本的问题即语义及推理问题没有得到合理的 解决。分析了描述逻辑循环术语集的研究现状和存在的问题，基于图的互模拟的方法，给出了描述逻辑FL 循 0 环术语集的可满足性条件。结果证明循环术语集的可满足性的推理是多项式复杂的。 关键词：描述逻辑；FL ；互模拟 0 文章编号：1002-8331（2012 ）14-0056-04