Minimal Well-Founded Semantics and Autoepistemic Circumscription
Li-Yan Yuan · ERA: Education and Research Archive (University of Alberta) · 1992
In this paper we propose the minimalwell founded semantics for logic programs with negation based on the xpoint of the double Gelfond Lifschitz transformation which overcomes the existing problems associated with the stable the well founded and the stable class semantics By representing logic programs as autoepistemic theories we are able to represent various semantics as simple circumscription formulas