| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
|
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連情報 |
|
|
|
|
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
rifis-tr-62