<テクニカルレポート>
Inductive Inference from Positive Data is Powerful

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 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.続きを見る

本文情報を非表示

rifis-tr-20 pdf 2.35 MB 131  

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20