Tableau算法在粗糙描述逻辑中的扩展应用

Extension Application of Tableau Algorithm in Rough Description Logic

Tableau算法是描述逻辑中判断概念的可满足性最常用的方法,但传统的Tableau算法只适用于标准的描述逻辑。对于粗糙描述逻辑的情况,有的学者是把粗糙描述逻辑先通过一个转换函数转换为标准描述逻辑,然后再用Tableau算法实现推理,这就需要在Tableau算法中增加一些规则,这增加了算法不必要的工作。文中给出了粗糙描述逻辑中概念包含关系的一种新的推理的Tableau算法,在这种改进的算法中只需用到概念的子概念和出现在概念中的角色就可以判断一个概念的可满足性,并证明了它的正确性,通过实例说明了它的有效性。

Tableau algorithm is the most frequently used algorithm in the reasoning problem of description logic. While the traditional Tableau algorithm is appropriate for only standard description logic. When it comes to rough description logic, some scholars convert it to standard description logic via a transfer function and then enable reasoning with the traditional Tableau algorithm, which needs to add some rules in Tableau algorithm and this approach will add extra work which can be avoided. A new kind of reasoning algorithm is pro- posed, in which needs no other information except for the sub-concepts of the concept and the rules which present to the concept. The correctness of the improvement is illustrated. And at last its validity is verified with an example.