This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
- 201 views
- 189 downloads
Minimal Well-Founded Semantics and Autoepistemic Circumscription
-
- Author(s) / Creator(s)
-
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
-
- Date created
- 1992
-
- Subjects / Keywords
-
- Type of Item
- Report
-
- License
- Attribution 3.0 International