01243nas a2200145 4500008004100000245010700041210006900148260002100217520075600238100001500994700001401009700001401023700002001037856004001057 2004 eng d00aCorollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion0 aCorollaries on the fixpoint completion studying the stable seman aPotsdam, Germany3 aThe fixpoint completion fix(P) of a normal logic program P is a program transformation such that the stable models of P are exactly the models of the Clark completion of fix(P). This is well-known and was studied by Dung and Kanchanasut (1989). The correspondence, however, goes much further: The Gelfond-Lifschitz operator of P coincides with the immediate consequence operator of fix(P), as shown by Wendt (2002), and even carries over to standard operators used for characterizing the well-founded and the Kripke-Kleene semantics. We will apply this knowledge to the study of the stable semantics, and this will allow us to almost effortlessly derive new results concerning fixed-point and metric-based semantics, and neural-symbolic integration.
1 aSeipel, D.1 aHanus, M.1 aGeske, U.1 aBartenstein, O. uhttp://knoesis.wright.edu/node/1195