<journal article>
Stable Model Semantics of Circumscription

Creator
Language
Publisher
Date
Source Title
Vol
Issue
First Page
Last Page
Publication Type
Access Rights
Crossref DOI
Related DOI
Related DOI
Related URI
Relation
Abstract Circumscription, which is an important tool for formalizing nonmonotonic aspects of commonsense reasoning, is a minimization on predicate symbols. In this paper, we apply circumscription to logic prog...rams, and compare the semantics of circumscription with the stable model semantics of logic programs. We introduce two syntactical conditions, a minimality condition and a uniqueness condition, which determine how to minimize predicate symbols. We show that each of them also deter mines a unique model of circumscription of a logic program, and each model coincides with a unique stable model of the program as the declarative semantics.show more

Hide fulltext details.

pdf rifis-tr-62 pdf 721 KB 374 RIFIS Technical Report
pdf p001 pdf 636 KB 302 Bulletin of Informatics and Cybernetics

Details

PISSN
EISSN
NCID
Record ID
Peer-Reviewed
Created Date 2009.04.22
Modified Date 2020.10.22

People who viewed this item also viewed