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

摘要

循环术语集是描述逻辑长期以来的研究难点,它的最基本的问题即语义及推理问题没有得到合理的解决.分析了描述逻辑循环术语集的研究现状和存在的问题,基于图的互模拟的方法,给出了描述逻辑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 Flo, which may include terminological cycles is presented, is given. And it is also proved that the model of description logic Flo can be reasoned in polynomial time.