点別サーカムスクリプションに基づく孤立式の一般化
書誌事項
- タイトル別名
-
- Generalization of Solitary Formulas Using Pointwise Circumscription
この論文をさがす
抄録
<p>Circumscription is a very useful concept for commonsense and nonmonotonic reasoning. But circumscription is formalized as a higher-order formula, therefore its direct treatment is very difficult. For this problem, Lifschitz proposed equivalent transformations of predicate circumscription into first-order formulas. He showed that a class of predicate circumscription in a solitary formula can be translated into first-order formulas. Also, by using a concept of pointwise circumscription, he showed another class can be translated into first-order formulas. In this paper, we give more powerful transformation rules of predicate circumscription. At first, we discuss and clarify some problems of Lifschitz's transformation methods. Next, we give two transformation rules for simplifying predicate circumscription, which are very important and useful methods to solve the above problems. And we clarify the concept of pointwise circumscription and strengthen Lifschitz's theorem. Finally, we give an equivalent transformation theorem of predicate circumscription into first-order formulas. A class of predicate circumscription which can be translated by the theorem includes Lifschitz's two classes mentioned above as its proper subsets.</p>
収録刊行物
-
- 人工知能
-
人工知能 4 (5), 556-565, 1989-09-20
一般社団法人 人工知能学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390004222628446592
-
- NII論文ID
- 110002807241
-
- NII書誌ID
- AN10067140
-
- ISSN
- 24358614
- 21882266
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可