| その他のタイトル |
|
| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
|
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連HDL |
|
| 関連情報 |
|
|
|
|
|
|
|
| 概要 |
The extension, one of the most important notions in Reiter's default logic, is not computable in general. This paper proposes new notions of sub-extension and approximate extension which can successiv...ely be constructed from a given default theory. By introducing a time-bound into them, we show that every step of our construction terminates in a finite time. We also prove that the set of approximate extensions contains the set of extensions in Reiter's sense.続きを見る
|
Mendeley出力
rifis-tr-47