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

Pascal Hitzler

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). Th…