{"links":{},"id":60663,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00060663","sets":["934:935:936:5591"]},"path":["5591"],"owner":"10","recid":"60663","title":["Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-07-10"},"_buckets":{"deposit":"2aa0aa29-eeb9-4579-a9cd-7611a1cd61f6"},"_deposit":{"id":"60663","pid":{"type":"depid","value":"60663","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems"},{"subitem_title":"Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"通常論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2009-07-10","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/60663/files/IPSJ-TPRO0203003.pdf"},"date":[{"dateType":"Available","dateValue":"2011-07-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO0203003.pdf","filesize":[{"value":"640.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":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"805d7beb-136d-45d7-b77b-bebaaf9dd5a3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshiharu, Kojima"},{"creatorName":"Masahiko, Sakai"},{"creatorName":"Naoki, Nishida"},{"creatorName":"Keiichirou, Kusakari"},{"creatorName":"Toshiki, Sakabe"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshiharu, Kojima","creatorNameLang":"en"},{"creatorName":"Masahiko, Sakai","creatorNameLang":"en"},{"creatorName":"Naoki, Nishida","creatorNameLang":"en"},{"creatorName":"Keiichirou, Kusakari","creatorNameLang":"en"},{"creatorName":"Toshiki, Sakabe","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802 ","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"The reachability problem for given an initial term, a goal term, and a term rewriting system (TRS) is to decide whether the initial one is reachable to the goal one by the TRS or not. A term is shallow if each variable in the term occurs at depth 0 or 1. Innermost reduction is a strategy that rewrites innermost redexes, and context-sensitive reduction is a strategy in which rewritable positions are indicated by specifying arguments of function symbols. In this paper, we show that the reachability problem under context-sensitive innermost reduction is decidable for linear right-shallow TRSs. Our approach is based on the tree automata technique that is commonly used for analysis of reachability and its related properties. We show a procedure to construct tree automata accepting the sets of terms reachable from a given term by context-sensitive innermost reduction of a given linear right-shallow TRS.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The reachability problem for given an initial term, a goal term, and a term rewriting system (TRS) is to decide whether the initial one is reachable to the goal one by the TRS or not. A term is shallow if each variable in the term occurs at depth 0 or 1. Innermost reduction is a strategy that rewrites innermost redexes, and context-sensitive reduction is a strategy in which rewritable positions are indicated by specifying arguments of function symbols. In this paper, we show that the reachability problem under context-sensitive innermost reduction is decidable for linear right-shallow TRSs. Our approach is based on the tree automata technique that is commonly used for analysis of reachability and its related properties. We show a procedure to construct tree automata accepting the sets of terms reachable from a given term by context-sensitive innermost reduction of a given linear right-shallow TRS.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"20","bibliographicIssueDates":{"bibliographicIssueDate":"2009-07-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:23:03.274344+00:00","updated":"2025-01-22T03:02:50.502966+00:00"}