ERA

Download the full-sized PDF of The Alternating Semantics for Default Theories and Logic ProgramsDownload the full-sized PDF

Analytics

Share

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

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)

The Alternating Semantics for Default Theories and Logic Programs Open Access

Descriptions

Author or creator
Yuan, Li-Yan
You, Jia-Huai
Additional contributors
Subject/Keyword
Reiter's default logic
Gelder's alternating fixpoint theory
semantics for default theories
Type of item
Computing Science Technical Report
Computing science technical report ID
TR92-16
Language
English
Place
Time
Description
Technical report TR92-16. Recent proposals for semantics of default theories are all based on some types of weaker notion of extensions. This is typified in the well-founded semantics and the extension class semantics for default theories. Although these semantics solve the no-extension problem in Reiter's default logic, they also present a departure from Reiter's original extension semantics, even for default theories which can be completely characterized by the extension semantics. This results in a weaker capability for skeptical reasoning. In this paper we propose a semantics for default theories, based on van Gelder's alternating fixpoint theory. The distinct feature of this semantics is its preservation of Reiter's semantics when a default theory is not considered ``problematic'' under Reiter's semantics. Differences arise only when a default theory has no extensions, or has only ``biased extensions'' under Reiter's semantics. This feature allows skeptical reasoning in Reiter's logic to be properly preserved in the new semantics. By the familiar, natural translation from logic programs to default theories, the semantics proposed for default theories provides a natural extension to the stable model semantics of normal logic programs.
Date created
1992
DOI
doi:10.7939/R3KW57J21
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-29T17:22:46.598+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: 296403
Last modified: 2015:10:12 13:50:07-06:00
Filename: TR92-16.pdf
Original checksum: ffc00615b933e6e724c00bb5383ff04c
Well formed: true
Valid: true
Page count: 16
Activity of users you follow
User Activity Date