Term rewriting systems are a general model of computation.The normaliza-tion property of a reduction strategy for TRS's plays an important role in the application of TRS's,and overlapping rules and other types of ambiguities complicates reduction strate-gies greatly.This paper deals with these ambiguities in general and proposes art approach to a general class of problems involving ambiguities.