| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Inductive inference from positive data is shown to be remarkably powerful using a frmework of elementary formal system. An elementary formal system, EFS for short, is a kind of logic prragm on $ Sigma... ^+$ consisting of finitely many axioms. Any context-sensitive language is definable by a restricted EFS, called lengthbounded EFS. Length-bounded EFS's with at most n axioms are considered to show that inductive inference from positive data works successfully for their models as well as for their languages. From this it follows that any class of usual logic programs, like Prolog programs, corresponding to length-bounded EFS" can be inferred -from positive facts.続きを見る
|
Mendeley出力
rifis-tr-20