WEKO3
アイテム
Learning Elementary Formal Systems with Queries
http://hdl.handle.net/10228/370
http://hdl.handle.net/10228/37062239adf-6723-4ede-b850-98e3db26829c
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
S0304-3975(02)00417-6.pdf (352.2 kB)
|
|
| アイテムタイプ | 学術雑誌論文 = Journal Article(1) | |||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2007-11-20 | |||||||||||||||||||||
| 資源タイプ | ||||||||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||||||||
| 資源タイプ | journal article | |||||||||||||||||||||
| タイトル | ||||||||||||||||||||||
| タイトル | Learning Elementary Formal Systems with Queries | |||||||||||||||||||||
| 言語 | en | |||||||||||||||||||||
| 言語 | ||||||||||||||||||||||
| 言語 | eng | |||||||||||||||||||||
| 著者 |
坂本, 比呂志
× 坂本, 比呂志
WEKO
17609
× 平田, 耕一
WEKO
597
× Arimura, Hiroki |
|||||||||||||||||||||
| 抄録 | ||||||||||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||||||||||
| 内容記述 | The elementary formal system (EFS) is a kind of logic programs which directlymanipulates strings, and the learnability of the subclass called hereditary EFSs(HEFSs) has been investigated in the frameworks of the PAC-learning, query-learning, and inductive inference models. The hierarchy of HEFS is expressed byHEFS(m; k; t; r), where m, k, t and r denote the number of clauses, the occurrencesof variables in the head, the number of atoms in the body, and the arity of predi-cate symbols. The present paper deals with the learnability of HEFS in the querylearning model using equivalence queries and additional queries such as membership,predicate membership, entailment membership, and dependency queries. We showthat the class HEFS( ; k; t; r) is polynomial-time learnable with the equivalence andpredicate membership queries and the class HEFS( ; k; ; r) with termination prop-erty is polynomial-time learnable with the equivalence, entailment membership, anddependency queries for the unbounded parameter . A lowerbound on the numberof queries is presented. We also show that the class HEFS( ; k; t; r) is hard to learnwith the equivalence and membership queries under the cryptographic assumptions.Furthermore, the learnability of the class of unions of regular pattern languages,which is a subclass of HEFSs, is investigated. The bounded unions of regular pat-tern languages are polynomial-time predictable with membership query. However, allunbounded unions of regular pattern languages are not polynomial-time predictablewith membership queries if neither are the DNF formulas. | |||||||||||||||||||||
| 書誌情報 |
Theoretical Computer Science 巻 298, 号 1, p. 21-50, 発行日 2003-04-04 |
|||||||||||||||||||||
| 出版社 | ||||||||||||||||||||||
| 出版者 | Elsevier | |||||||||||||||||||||
| DOI | ||||||||||||||||||||||
| 関連タイプ | isVersionOf | |||||||||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||||||||
| 関連識別子 | https://doi.org/10.1016/S0304-3975(02)00417-6 | |||||||||||||||||||||
| ISSN | ||||||||||||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||||||||||||
| 収録物識別子 | 0304-3975 | |||||||||||||||||||||
| 著作権関連情報 | ||||||||||||||||||||||
| 権利情報 | Copyright (c) 2002 Published by Elsevier Science B.V. | |||||||||||||||||||||
| 出版タイプ | ||||||||||||||||||||||
| 出版タイプ | AM | |||||||||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||||||||
| 査読の有無 | ||||||||||||||||||||||
| 値 | yes | |||||||||||||||||||||
| 情報源 | ||||||||||||||||||||||
| 識別子タイプ | URI | |||||||||||||||||||||
| 関連識別子 | http://www.sciencedirect.com/science/journal/03043975 | |||||||||||||||||||||
| 関連名称 | http://www.sciencedirect.com/science/journal/03043975 | |||||||||||||||||||||
