ERA

Download the full-sized PDF of Minimal Well-Founded Semantics and Autoepistemic CircumscriptionDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3TT4FS75

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

Minimal Well-Founded Semantics and Autoepistemic Circumscription Open Access

Descriptions

Author or creator
Yuan, Li-Yan
Additional contributors
Subject/Keyword
circumscription
logic program semantics
autoepistemic logic
Type of item
Computing Science Technical Report
Computing science technical report ID
TR92-15
Language
English
Place
Time
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.
Date created
1992
DOI
doi:10.7939/R3TT4FS75
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-29T16:22:18.244+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 249829
Last modified: 2015:10:12 13:04:24-06:00
Filename: TR92-15.pdf
Original checksum: cf40f5b1209d89a390adcaf76bf8ad80
Well formed: true
Valid: true
Page count: 12
Activity of users you follow
User Activity Date