{"created":"2023-05-15T11:55:16.340363+00:00","id":125,"links":{},"metadata":{"_buckets":{"deposit":"03cac957-9cfb-45ab-a6e7-a32084359012"},"_deposit":{"created_by":3,"id":"125","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"125"},"status":"published"},"_oai":{"id":"oai:kyutech.repo.nii.ac.jp:00000125","sets":["8:24"]},"author_link":["597","17609","596"],"item_21_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-04-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"50","bibliographicPageStart":"21","bibliographicVolumeNumber":"298","bibliographic_titles":[{"bibliographic_title":"Theoretical Computer Science"}]}]},"item_21_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Abstract"}]},"item_21_description_60":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"Journal Article","subitem_description_type":"Other"}]},"item_21_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"affiliations":[{"affiliationNames":[{"affiliationName":"","lang":"ja"}],"nameIdentifiers":[]}],"familyNames":[{"familyName":"Hirata","familyNameLang":"en"},{"familyName":"平田","familyNameLang":"ja"},{"familyName":"ヒラタ","familyNameLang":"ja-Kana"}],"givenNames":[{"givenName":"Kouichi","givenNameLang":"en"},{"givenName":"耕一","givenNameLang":"ja"},{"givenName":"コウイチ","givenNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"597","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"20274558","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/ja/nrid/1000020274558"},{"nameIdentifier":"55730619500","nameIdentifierScheme":"Scopus著者ID","nameIdentifierURI":"https://www.scopus.com/authid/detail.uri?authorId=55730619500"},{"nameIdentifier":"189","nameIdentifierScheme":"九工大研究者情報","nameIdentifierURI":"https://hyokadb02.jimu.kyutech.ac.jp/html/189_ja.html"}],"names":[{"name":"Hirata, Kouichi","nameLang":"en"},{"name":"平田, 耕一","nameLang":"ja"},{"name":"ヒラタ, コウイチ","nameLang":"ja-Kana"}]}]},"item_21_publisher_7":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Elsevier"}]},"item_21_relation_12":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1016/S0304-3975(02)00417-6","subitem_relation_type_select":"DOI"}}]},"item_21_relation_14":{"attribute_name":"情報源","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"http://www.sciencedirect.com/science/journal/03043975"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.sciencedirect.com/science/journal/03043975","subitem_relation_type_select":"URI"}}]},"item_21_rights_13":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"Copyright (c) 2002 Published by Elsevier Science B.V."}]},"item_21_select_59":{"attribute_name":"査読の有無","attribute_value_mlt":[{"subitem_select_item":"yes"}]},"item_21_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0304-3975","subitem_source_identifier_type":"ISSN"}]},"item_21_text_36":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics, Kyushu University, Hakozaki 6-10-1, Fukuoka 812-8581, Japan"},{"subitem_text_value":"Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka 820-8502, Japan"},{"subitem_text_value":"PRESTO, Japan Science and Technology Co., Japan"}]},"item_21_version_type_58":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorAffiliations":[{"affiliationNameIdentifiers":[],"affiliationNames":[{"affiliationName":""}]}],"creatorNames":[{"creatorName":"Sakamoto, Hiroshi","creatorNameLang":"en"},{"creatorName":"坂本, 比呂志","creatorNameLang":"ja"},{"creatorName":"サカモト, ヒロシ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{},{},{},{}]},{"creatorAffiliations":[{"affiliationNameIdentifiers":[],"affiliationNames":[{"affiliationName":""}]}],"creatorNames":[{"creatorName":"Hirata, Kouichi","creatorNameLang":"en"},{"creatorName":"平田, 耕一","creatorNameLang":"ja"},{"creatorName":"ヒラタ, コウイチ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{},{},{}]},{"creatorNames":[{"creatorName":"Arimura, Hiroki"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2007-11-20"}],"displaytype":"detail","filename":"S0304-3975(02)00417-6.pdf","filesize":[{"value":"352.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"S0304-3975(02)00417-6.pdf","url":"https://kyutech.repo.nii.ac.jp/record/125/files/S0304-3975(02)00417-6.pdf"},"version_id":"962cce46-940f-4be8-a478-aa9445dcfa8a"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Learning Elementary Formal Systems with Queries","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Learning Elementary Formal Systems with Queries"}]},"item_type_id":"21","owner":"3","path":["24"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-11-20"},"publish_date":"2007-11-20","publish_status":"0","recid":"125","relation_version_is_last":true,"title":["Learning Elementary Formal Systems with Queries"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-10-25T08:43:06.121427+00:00"}