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.