{"_buckets": {"deposit": "f210d553-0434-4dc4-bcb4-18cfce88f7a8"}, "_deposit": {"id": "18995", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "18995"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00018995", "sets": ["314"]}, "author_link": ["55338", "55339", "55340", "55341", "55342", "55343", "55344", "55345", "55346", "55347"], "item_10_alternative_title_19": {"attribute_name": "その他のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "Recognizable Approximation of Descendant Sets for Left-Linear Oriented Conditional Term Rewriting Systems", "subitem_alternative_title_language": "en"}]}, "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2007-07", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "176", "bibliographicPageEnd": "6", "bibliographicPageStart": "1", "bibliographicVolumeNumber": "107", "bibliographic_titles": [{"bibliographic_title": "電子情報通信学会技術研究報告SS, ソフトウェアサイエンス", "bibliographic_titleLang": "ja"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "項書換え系(TRS)の到達可能性問題とは,与えられた2つの項の一方からもう一方にTRSでの書換えにより到達できるか否かという問題であり,一般には決定不能である.そこで,到達可能な項集合(の近似集合)を認識する木オートマトンの生成法が広く研究されている.条件付きTRS(CTRS)に関しては,左線形な結合CTRSについて生成手続きが提案されているが,木オートマトンの自動生成の基準となる近似関数はCTRSについて提案されていない.本稿では,結合CTRSを含むクラスである定向CTRSに着目し,左線形な定向CTRSで到達可能な項集合の近似集合を認識する木オートマトンの生成手続きを提案する.さらに,結合CTRSと定向CTRSのための近似関数,結合CTRSを定向CTRSで表現する方法を提案し,結合CTRSについての生成手続きと比較する.", "subitem_description_language": "ja", "subitem_description_type": "Abstract"}, {"subitem_description": "The reachability problem for term rewriting systems (TRSs) is to decide whether one of two given terms is reachable to the other with respect to rewriting by a given TRS. Unfortunately, this problem is undecidable in general. Hence, several methods have been widely studied in order to construct a tree automaton that accepts all terms reachable from terms in a given recognizable set. In conditional rewriting, such methods have been proposed only for left-linear join conditional TRSs. However, the techniques of approximation functions used in automatically constructing tree automata have not been formalized. In this paper, we focus on oriented conditional TRSs since every join conditional TRS can be simulated completely by an oriented one. We first propose a method that, given a left-linear oriented conditional TRS and a recognizable set of terms, constructs a tree automaton recognizing an over-approximated set of reachable terms. Then, we formalize approximation functions for join conditional TRSs and oriented ones, respectively, and compare the constructions for join and oriented systems.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://ci.nii.ac.jp/naid/110006388627"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/21099"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "一般社団法人電子情報通信学会", "subitem_publisher_language": "ja"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://ci.nii.ac.jp/naid/110006388627", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "(c)一般社団法人電子情報通信学会。本文データは学協会の許諾に基づきCiNiiから複製したものである", "subitem_rights_language": "ja"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0913-5685", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "村田, 俊樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55338", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "西田, 直樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55339", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "酒井, 正彦", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55340", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "坂部, 俊樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55341", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "草刈, 圭一朗", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "55342", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "MURATA, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55343", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "NISHIDA, Naoki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55344", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SAKAI, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55345", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SAKABE, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55346", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KUSAKARI, Keiichirou", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55347", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-21"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "110006388627.pdf", "filesize": [{"value": "938.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 938100.0, "url": {"label": "110006388627.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/18995/files/110006388627.pdf"}, "version_id": "221d8b8d-8e60-45b6-ab4b-7a48aa23b0bf"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "左線形な定向条件付き項書換え系における到達可能な項集合の近似集合を認識する木オートマトン", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "左線形な定向条件付き項書換え系における到達可能な項集合の近似集合を認識する木オートマトン", "subitem_title_language": "ja"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/21099", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2015-01-19"}, "publish_date": "2015-01-19", "publish_status": "0", "recid": "18995", "relation": {}, "relation_version_is_last": true, "title": ["左線形な定向条件付き項書換え系における到達可能な項集合の近似集合を認識する木オートマトン"], "weko_shared_id": -1}