Minimal Well-Founded Semantics and Autoepistemic Circumscription

• Author(s) / Creator(s)

  • Yuan, Li-Yan

• 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

  • Logic program semantics
  • Autoepistemic logic
  • Circumscription

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/R3TT4FS75

• License

  Attribution 3.0 International