| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
The semantic tableaux system is a procedure to decide whether or not a given formula is valid. The system also works for finding minimal models of formulas. In this paper, we apply this function to ci...rcumscription. We show that we can obtain the minimal models of circumscription just by checking the models produced by the system, and hence we do not need to check all possible models of it. We also present an algorithm to produce the models of circumscription based on the system.続きを見る
|
Mendeley出力
