一种基于有向超图的规则库冗余及环路检测方法  

A directed hypergraph-based algorithm for detecting redundancy and circularity in rule base

作　　者：孙伟[1] 郭莉[1] 高天一[1] 马沁怡[1] 

机构地区：[1]大连理工大学机械工程学院,辽宁大连116024

出　　处：《大连理工大学学报》2008年第1期74-78,共5页Journal of Dalian University of Technology

基　　金：国家自然科学基金资助项目(50475156)

摘　　要：当规则库的规模随着知识的更新而不断增大,规则库的维护就变得日益重要.其中,规则库的冗余和环路是影响规则库效率的重要问题.针对含有复合规则的产生式规则库,提出了一种基于有向超图的规则库表达方法,定义了其邻接矩阵和可达矩阵并推导出可达矩阵的计算方法.在此基础上给出了基于可达矩阵的冗余和环路检测算法.与已有的基于有向超图的算法相比,新算法图更简洁,矩阵规模更小,从而检测效率得到提高.实例证明该算法是有效可行的.When the scale of rule base grows with the update of knowledge, maintenance of rule base becomes more and more important. Redundancy and circularity are key problems which lower efficacy of rule base. For rule base which contains compound rules, a representation based on directed hypergraph is established, then its adjacency matrix and reachability matrix are defined and computation of reachability matrix is derived. Furthermore, redundancy and circularity detection algorithm is constructed. Compared with other existing algorithm based on graphs, new algorithm is more efficient since its graph is concise and adjoint matrices are small-scale. The algorithm is validated by practical examples.

关 键 词：有向超图 规则库 冗余 环路 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程]