A central research topic in the area of knowledge engineering is the reuse of problemsolving methods for developing knowledge based systems. For being able to reuse a problem-solving method it is important to know under which restrictions a problem-solving method is appropriate to solve a given problem. This paper describes the problemsolving method propose-and-revise as well as the way this problem-solving method searches in its problem space for a solution. A quantitative analysis of the efficiency of this search process is given. Additionally, task and domain specific properties and restrictions and their influence on the efficiency of the search process are considered. For these purposes an instance of the problem-solving method is transformed to a corre-Ž . sponding instance of a Stanford Research Institute Problem Solver STRIPS planning system. Then the problem-solving method is considered as an additional control strategy for such a planning system. By this way the various insights and analysis results which are available in the area of planning systems may be exploited for the analysis of problemsolving methods.