## ＜学術雑誌論文＞INDUCTIVE INFERENCE OF FORMAL SYSTEMS FROM POSITIVE DATA

作成者 作成者名 所属機関 所属機関名 Computer Center, Kyushu University 九州大学大型計算機センター 英語 Research Association of Statistical Sciences 統計科学研究会 1986-03 22 1/2 9 18 Version of Record open access https://doi.org/10.5109/13373 Bulletin of informatics and cybernetics || 22(1/2) || p9-18 http://bic.math.kyushu-u.ac.jp/ Bulletin of informatics and cybernetics || 22(1/2) || p9-18 http://bic.math.kyushu-u.ac.jp/ Bulletin of informatics and cybernetics || 22(1/2) || p9-18 http://bic.math.kyushu-u.ac.jp/ 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 501

### 詳細

PISSN 0286-522X 2435-743X AA10634475 13373 査読有 学術雑誌論文 2009.04.22 2020.10.22