In general, the application of the meaning function T P to a normal logic program P results in innnite expressions and, hence, is infeasible in practice. On the other hand, the iteration of T P is of interest for several elds in AI. Therefore, we introduce a new representation of interpretations and adopt T P to this. The resulting function always results in nite expressions of tractable length...