| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
This paper presents a unifying framework for language leanling, especially for inductive inference of various classes of languages. The elementary formal systems (EFS for short), Smullyan invented to ...develop his recursive function theory, are proved suitable to generate languages. In this paper we first point out that EFS can also work as a logic programming languages, and the resolution procedure for EFS can be used to accept languages. We give a theoretical foundation to EFS from the viewpoint of semantics of logic progralms. Hence, Shapiro's theory of model inference can naturally be applied to our language learning by EFS. We introduce some subclasses of EFS's which correspond to Chomsky hierarchy and other important classes of languages. We discuss the computations of unifiers between two terms. Then we give, in a uniform way, inductive inference algorithms including refinement oparators for these subclasses and show their completeness.続きを見る
|
Mendeley出力
rifis-tr-14