图表示下的知识约简

 知识约简主要有代数表示下的知识约简和信息表示下的知识约简.本文提出图表示下的知识约简,给出图表示下求最小约简的完备递归算法.借鉴人工智能理论中的图搜索技术,提出旋转剪枝和回溯剪枝两个搜索算子求最小约简,并证明了在这种表示下求最小约简的完备性,理论分析和实验结果表明,在图表示下求最小约简是有效可行的.

Knowledge Reduction Algorithm under Graph View

Knowledge reduction is widely studied under algebra view and information view.In this paper,knowledge reduction under graph view is presented.A complete recursive algorithm for minimal reduction under graph view is designed.In virtue of graph searching methods of artificial intelligence,rotation pruning operator and backtracking pruning operator for answering the minimal reduction question are proposed.These methods’ completeness for the minimal reduction is proved.In order to test the efficiency of the algorithm,some experiments are made on simulative data.Theoretical analysis and experimental results show that the reduction algorithm under graph view is efficient and feasible.