{"id":187611,"updated":"2025-01-20T02:09:31.146569+00:00","links":{},"created":"2025-01-19T00:54:16.394753+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00187611","sets":["6504:9465:9472"]},"path":["9472"],"owner":"6748","recid":"187611","title":["順序木言語のプリミティブ形式体系に対する1つの正例と所属性質問による学習アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-03-13"},"_buckets":{"deposit":"40389b05-3cd1-456f-b938-af8800f3e39c"},"_deposit":{"id":"187611","pid":{"type":"depid","value":"187611","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"順序木言語のプリミティブ形式体系に対する1つの正例と所属性質問による学習アルゴリズム","author_link":["424944","424943","424941","424940","424942"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"順序木言語のプリミティブ形式体系に対する1つの正例と所属性質問による学習アルゴリズム"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2018-03-13","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東海大"},{"subitem_text_value":"広島市大"},{"subitem_text_value":"九州国際大"},{"subitem_text_value":"広島市大"},{"subitem_text_value":"広島市大"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/187611/files/IPSJ-Z80-7A-05.pdf","label":"IPSJ-Z80-7A-05.pdf"},"date":[{"dateType":"Available","dateValue":"2018-04-25"}],"format":"application/pdf","filename":"IPSJ-Z80-7A-05.pdf","filesize":[{"value":"640.0 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"e0fd102e-6aec-4959-a0e5-54957046d558","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松本, 哲志"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"内田, 智之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"正代, 隆義"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鈴木, 祐介"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"宮原, 哲浩"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"順序木言語のプリミティブ形式体系(pFOTS)とは、ラベル付き順序木言語を定義する形式体系であり、1階述語論理の項の代わりに項木パタンを用いた論理プログラミングシステムである。pFOTSプログラムは、確定節であるグラフ書き換えルール(pFOTSルール)の有限集合として定義される。そのため、pFOTSプログラムは順序木言語の背景知識の表現に適している。質問学習モデルは、計算論的学習理論における質問を用いた学習の数学的モデルである。pFOTSプログラムによる背景知識Γと1つのpFOTSルールで定義される順序木言語のクラスが、1つの正例と多項式回の所属性質問を用いた質問学習モデルにより学習可能となる背景知識Γの条件を示す。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"168","bibliographic_titles":[{"bibliographic_title":"第80回全国大会講演論文集"}],"bibliographicPageStart":"167","bibliographicIssueDates":{"bibliographicIssueDate":"2018-03-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2018"}]},"relation_version_is_last":true,"weko_creator_id":"6748"}}