{"links":{},"id":50844,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00050844","sets":["1164:4402:4462:4465"]},"path":["4465"],"owner":"1","recid":"50844","title":["アクション言語Aを表現するオートマトンモデル"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-05-14"},"_buckets":{"deposit":"07128c3d-8e5a-4276-9793-42563fd6ec3e"},"_deposit":{"id":"50844","pid":{"type":"depid","value":"50844","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"アクション言語Aを表現するオートマトンモデル","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"アクション言語Aを表現するオートマトンモデル"},{"subitem_title":"Automaton model for action language A","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1996-05-14","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"豊橋技術科学大学情報工学系"},{"subitem_text_value":"豊橋技術科学大学情報工学系"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information and Computer Sciences Toyohashi University of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Sciences Toyohashi University of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/50844/files/IPSJ-ICS96104006.pdf"},"date":[{"dateType":"Available","dateValue":"1998-05-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ICS96104006.pdf","filesize":[{"value":"520.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"25"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"74eba897-a889-4102-bfc7-aa73793aba39","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"鍋島, 英知"},{"creatorName":"井上, 克巳"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hidetomo, Nabeshima","creatorNameLang":"en"},{"creatorName":"Katsumi, Inoue","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11135936","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，高級レベルのアクション言語Aと有限オートマトンの関係について議論する．最も重要な関係はこれらの等価性である．すなわち，Aによる任意の領域記述が決定性有限オートマトンに変換でき，逆に任意の有限オートマトンがAによる記述に変換できる．このことから，あるアクション列が計画を遂行できるかどうかの判定が，対応するオートマトンがそのアクション列を受理するかどうかの問題に帰着され，さらにプランニング問題に対する最良の解も正規表現を用いて表現することができる．ここに，状態変化を伴う推論とオートマトン理論が深く関連付けられ，アクション言語に対する今後の見通しがよくなった．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We investigate the relationship between the high-level action language A and finite automata (FA). We show A and FA are equivalent, that is, any domain description in A can be transformed to an FA, and conversely, any FA can be transformed to a description in A. With these results, planning problems can be characterized by regular expressions, and vice versa. Here, reasoning about action meets the automata theory.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"48","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告知能と複雑系（ICS）"}],"bibliographicPageStart":"41","bibliographicIssueDates":{"bibliographicIssueDate":"1996-05-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"36(1996-ICS-104)","bibliographicVolumeNumber":"1996"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:15:31.637729+00:00","updated":"2025-01-22T07:26:27.832773+00:00"}