Minimal Well-Founded Semantics and Autoepistemic Circumscription
Loading...
Date
Author(s)
Citation for Previous Publication
Link to Related Item
Abstract
Description
Technical report TR92-15. In this paper we propose the minimal well-founded semantics for logic programs with negation based on the fixpoint 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. | TRID-ID TR92-15
Item Type
http://purl.org/coar/resource_type/c_93fc
Alternative
Other License Text / Link
Subject/Keywords
Language
en