01133nas a2200133 4500008004100000245006700041210006600108260002600174300001200200520071200212100002200924700002000946856003300966 2001 eng d00aSemantic Operators and Fixed-Point Theory in Logic Programming0 aSemantic Operators and FixedPoint Theory in Logic Programming aOrlando, Florida, USA a224-2293 aWe consider rather general operators mapping valuations to (sets of) valuations in the context of the semantics of logic programming languages. This notion generalizes several of the standard operators encountered in this subject and is inspired by earlier work of M.C. Fitting. The fixed points of such operators play a fundamental role in logic programming semantics by providing standard models of logic programs and also in determining the computability properties of these standard models. We discuss some of our recent work employing topological ideas, in conjunction with order theory, to establish methods by which one can nd the fixed points of the operators arising in logic programming semantics.1 aSeda, Anthony, K.1 aHitzler, Pascal uhttp://knoesis.org/node/1189