{"created":"2025-01-18T22:47:07.813562+00:00","updated":"2025-01-23T01:26:51.401848+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00012897","sets":["581:716:717"]},"path":["717"],"owner":"1","recid":"12897","title":["飽和節の構造分析に基づいた再帰的論理プログラムの帰納"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-12-15"},"_buckets":{"deposit":"afd203da-66c1-41d4-901f-3d326b693bba"},"_deposit":{"id":"12897","pid":{"type":"depid","value":"12897","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"飽和節の構造分析に基づいた再帰的論理プログラムの帰納","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"飽和節の構造分析に基づいた再帰的論理プログラムの帰納"},{"subitem_title":"Induction of Recursive Logic Programs Based on Structural Analysis of Saturations","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1998-12-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋工業大学"},{"subitem_text_value":"三菱電気エンジニアリング株式会社"},{"subitem_text_value":"名古屋工業大学"},{"subitem_text_value":"名古屋工業大学"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Mitsubishi Electric Engineering Company Limited","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/12897/files/IPSJ-JNL3912001.pdf"},"date":[{"dateType":"Available","dateValue":"2000-12-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3912001.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"98171dde-d5b5-4fb1-9b10-ef28ff04f2ee","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"犬塚, 信博"},{"creatorName":"古澤, 光枝"},{"creatorName":"世木, 博久"},{"creatorName":"伊藤, 英則"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nobuhiro, Inuzuka","creatorNameLang":"en"},{"creatorName":"Mitsue, Furuzawa","creatorNameLang":"en"},{"creatorName":"Hirohisa, Seki","creatorNameLang":"en"},{"creatorName":"Hidenori, Itoh","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，論理プログラムを事例から帰納するためのボトムアップ方式の帰納学習アルゴリズム，MRIを提案する．MRIは，非常に少数の事例から，非再帰節1つと，1つあるいはそれ以上の再帰節を含む論理プログラムを帰納することができる．この方法は事例の飽和節の分析に基づいている．Idestam?Almquistは，ILPシステムTIMのアルゴリズムにおいて，述語で処理され受け渡される値の組の流れを表すため，経路構造と呼ぶ概念を用い，経路の中の繰返し構造を分析した．本論文では，経路構造の延長および経路構造の差分の概念を新たに導入し，再帰呼び出しを延長された経路構造に対応づけ，再帰節を経路間の差分に対応づけた．アルゴリズムでは，まず飽和節から作られる事例の経路構造を選択し，それによって，非再帰節で処理されるまでの項の流れが表現されると仮定する．次に，これを順次短縮することで，再帰節で処理されるまでの経路構造を求め，対応する差分から各再帰呼び出しをする再帰節を求める．これにより，従来よりボトムアップ法で求められなかった複数の再帰節を持つプログラムを帰納することが可能となった．論文では，本方法に基づいたアルゴリズムとその実装について述べ，他のシステムとの比較実験の結果を示す．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper we present a bottom-up algorithm called MRI to induce logic programs from their examples.This method can induce programs with a base clause and one or more recursive clauses from a very small number of examples.MRI is based on the analysis of saturations of examples.An ILP system TIM,developed by Idestam-Almquist,introduced a path structure to express a stream of terms processed by predicates.In this paper,we introduce the concepts of extension and difference of path structures.A recursive call corresponds with an extension of path structure and a recursive clause can be expressed as a difference between a path structure and its extension.First,MRI assumes a path structure that expresses a last recursive call,which should be processed by a non-recursive clause.Then MRI generates path structures of which the path structure of the last call is an extension.A recursive clause corresponds with a difference of them.MRI is the first bottom-up ILP algorithm that can induce programs with more than one recursive clause.The paper describes the algorithm and its implementation.Experimental results are shown comparing with another system.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3164","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"3155","bibliographicIssueDates":{"bibliographicIssueDate":"1998-12-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"39"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"知識処理"}]},"weko_creator_id":"1"},"id":12897,"links":{}}