Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion

Details Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion

2004-02-09

arxiv.org/abs/cs/0402013v1

Computer Science

Artificial Intelligence

15 pages. Presented at the 18th Workshop on Logic Programming, Potsdam, Germany, March 2004

Scientific paper

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 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.

Affiliated with

Also associated with

No associations

Rating

Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30114