| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
In this paper, we give a theoretical foundation of EFS (elementary formal system) as a logic programming language. We show that the set of ail the unifiers of two atoms is finite and computable by res...tricting the form of axioms and goals without losing generality. The restriction makes the negation as failure rule complete. We give two conditions of EFS's such that the negation as failure rule is identical to the closed world assumption. We also give a subclass of EFS's where a procedure of CWA is given as bounding the length of derivations We compare these classes with the Chomsky hierarchy.続きを見る
|
Mendeley出力
rifis-tr-12