Article :Browse 3603 Download 3224
Received:July 31, 2008 Revised:February 16, 2009
Received:July 31, 2008 Revised:February 16, 2009
Abstract:This paper presents an approach to check the satisfiability of acyclic SHOIN(D)-concepts—CDNF (complete disjunctive normal form) algorithm. This calculus can make a direct judgment on the satisfiability of acyclic SHOIN(D)-concept by restructuring it into a hierarchical disjunctive normal form group on concept descriptions which is satisfiability self-telling, and reusing description clauses to block unnecessary extensions. CDNF algorithm eliminates description overlaps to the largest extent for it works on concept description directly. Therefore, CDNF algorithm has much better performance than Tableau as it saves a lot of spatial and temporal costs.
Foundation items:
Author Name | Affiliation |
GU Hua-Mao | 浙江工商大学 计算机与信息工程学院,浙江 杭州 310018 |
WANG Xun | 浙江工商大学 计算机与信息工程学院,浙江 杭州 310018 |
LING Yun | 浙江工商大学 计算机与信息工程学院,浙江 杭州 310018 |
GAO Ji | 浙江大学 人工智能研究所,浙江 杭州 310027 |
Reference text:
GU Hua-Mao,WANG Xun,LING Yun,GAO Ji.Determining the SHOIN(D)-Satisfiability with a Complete Disjunctive Normal Form Group.Journal of Software,2010,21(8):1863-1877
GU Hua-Mao,WANG Xun,LING Yun,GAO Ji.Determining the SHOIN(D)-Satisfiability with a Complete Disjunctive Normal Form Group.Journal of Software,2010,21(8):1863-1877