Attribute reduction is a key technique in rough set theory. This study discusses a new algorithm called reduction pruning, which aims to find the most important attributes for effective reasoning when some attributes are missing. By using reduction pruning and back elimination, the algorithm can identify the most relevant attributes efficiently. Comparisons with other methods show that reduction pruning is an effective approach for obtaining accurate reductions in rough set theory.