关键词: 认知角色, 逆角色, K算子, 查询表算法, 复杂度

Abstract: Aiming at epistemic role being not capable of expressing bi-directional relationship between individuals, this paper embeds inverse role into description logic ALCK and obtains ALCIK in order to extend expressiveness, models practical problems more conveniently while keeping capturing minimal knowledge and introspecting. It gives semantic and syntax of ALCIK and designs query tableau algorithm on condition that Tbox is empty and Abox is K-free. It also proves that the algorithm which will terminate definitely is sound and complete by induction on structure of ALCIK concept and investigates its computational complexity at last. The theoretical analysis shows that in this situation epistemic query problem is decidable and complexity is in PSpace-hard class.

Key words: epistemic role, inverse role, K operator, query tableau algorithm, complexity