Abstract. Current notions of redundancy and subsumption for knowledge bases under boolean reasoning are extended in this paper to approximate reasoning. The extension is based on the folding of rules under uncertain reasoning as the basic operation for computing rule trees. In this way global subsumption can also be detected under approximate reasoning. A new method for the detection and removal of all redundant and subsumed rules under approximate reasoning, based on graph transformations, is also presented.