Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion
Abstract
The 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 wellknown and was studied by Dung and Kanchanasut (1989). The correspondence, however, goes much further: The GelfondLifschitz 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 wellfounded and the KripkeKleene 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 fixedpoint and metricbased semantics, and neuralsymbolic integration.
 Publication:

arXiv eprints
 Pub Date:
 February 2004
 arXiv:
 arXiv:cs/0402013
 Bibcode:
 2004cs........2013H
 Keywords:

 Computer Science  Artificial Intelligence;
 Computer Science  Logic in Computer Science;
 F.4.1
 EPrint:
 15 pages. Presented at the 18th Workshop on Logic Programming, Potsdam, Germany, March 2004