An alternative computational “model” for logic programs is proposed which is based upon control annotations written in first-order predicate calculus. These annotations are used to generate runtime environments within which it is possible to exclude infinite computations. The major advantage of such a model is that it is possible to write conceptually transparent programs which otherwise would not have terminated under an existing naive control mechanism.