<学術雑誌論文>
Stable Model Semantics of Circumscription

作成者
本文言語
出版者
発行日
雑誌名
開始ページ
終了ページ
出版タイプ
アクセス権
概要 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.続きを見る

本文情報を非表示

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

詳細

レコードID
査読有無
関連情報
ISSN
NCID
登録日 2009.04.22
更新日 2017.01.20