01254nas a2200133 4500008004100000245009200041210006900133300001300202520080100215653002301016100002101039700002001060856004001080 2004 eng d00aLogic Programs, Iterated Function Systems, and Recurrent Radial Basis Function Networks0 aLogic Programs Iterated Function Systems and Recurrent Radial Ba a273- 3003 aGraphs of the single-step operator for first-order logic programs -displayed in the real plane - exhibit self-similar structures known from topological dynamics, i.e. they appear to be *fractals*, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide with attractors of suitably chosen iterated function systems, and conditions which allow the approximation of such graphs by iterated function systems or by fractal interpolation. Since iterated function systems can easily be encoded using recurrent radial basis function networks, we eventually obtain connectionist systems which approximate logic programs in the presence of function symbols.10aiterated functions1 aBader, Sebastian1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/1635