Several recent problem-solving programs have indicated improved methods for controlling program actions. Some of these methods operate by analyzing the time-independent antecedent-consequent dependency relationships between the components of knowledge about the problem for solution. This paper is a revised version of a thesis proposal which indicates how a general system of automatically maintained dependency relationships can be used to effect many forms of control on reasoning in an antecedent reasoning framework. 1 Introduction A major problem encountered in building automatic problem-solving systems is the necessity of providing controls on program reasoning and action. When faced with this problem, however, some researchers have divided reasoning into the categories of antecedent (datadirected) and consequent (goal-directed) reasoning. They then claim that the problem of control is just that of deciding on a proper balance between antecedent and consequent representations of prog...