<学術雑誌論文>
INDUCTIVE INFERENCE OF FORMAL SYSTEMS FROM POSITIVE DATA

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
Crossref DOI
概要 A formal system, we deal with in this paper, is a set of formulas of the form $ P_1(t_1) leftarrow P_2(t_2) \binampersand cdots \binampersand P_n(t_n) $, where $ P_1, P_2, cdots, P_n $ are predicate s...ymbols and $ t_1, t_2, cdots, t_n $ are strings of constant symbols and variable symbols. The language defined by a formal system $ E $ is a set of constant strings $ t $ such that $ P_i(t) $ is provable from $ E $ by using rules of modus ponens and substitutions of constant strings for variable symbols. We restrict formal systems so as to contain only two formulas of a predicate, and also restrict substitutions not to map any variable to empty string. The class of languages defined by our restricted formal systems is a natural extension of Angluin's pattern languages. We show that the class is inferable from positive data.続きを見る

本文情報を非表示

p009 pdf 626 KB 132  

詳細

PISSN
EISSN
NCID
レコードID
査読有無
関連情報
タイプ
登録日 2009.04.22
更新日 2020.10.22

この資料を見た人はこんな資料も見ています