{"_buckets": {"deposit": "b82f248f-5b65-45b2-9076-ac1bfd8262f7"}, "_deposit": {"id": "19058", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "19058"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00019058"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2009-07", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "32", "bibliographicPageStart": "20", "bibliographicVolumeNumber": "2", "bibliographic_titles": [{"bibliographic_title": "\u60c5\u5831\u51e6\u7406\u5b66\u4f1a\u8ad6\u6587\u8a8c, \u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "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": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://id.nii.ac.jp/1001/00060663/"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/21164"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "\u4e00\u822c\u793e\u56e3\u6cd5\u4eba\u60c5\u5831\u51e6\u7406\u5b66\u4f1a"}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "\u3053\u3053\u306b\u63b2\u8f09\u3057\u305f\u8457\u4f5c\u7269\u306e\u5229\u7528\u306b\u95a2\u3059\u308b\u6ce8\u610f \u672c\u8457\u4f5c\u7269\u306e\u8457\u4f5c\u6a29\u306f\u60c5\u5831\u51e6\u7406\u5b66\u4f1a\u306b\u5e30\u5c5e\u3057\u307e\u3059\u3002\u672c\u8457\u4f5c\u7269\u306f\u8457\u4f5c\u6a29\u8005\u3067\u3042\u308b\u60c5\u5831\u51e6\u7406\u5b66\u4f1a\u306e\u8a31\u53ef\u306e\u3082\u3068\u306b\u63b2\u8f09\u3059\u308b\u3082\u306e\u3067\u3059\u3002\u3054\u5229\u7528\u306b\u5f53\u305f\u3063\u3066\u306f\u300c\u8457\u4f5c\u6a29\u6cd5\u300d\u306a\u3089\u3073\u306b\u300c\u60c5\u5831\u51e6\u7406\u5b66\u4f1a\u502b\u7406\u7db1\u9818\u300d\u306b\u5f93\u3046\u3053\u3068\u3092\u304a\u9858\u3044\u3044\u305f\u3057\u307e\u3059\u3002Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan. Comments are welcome. Mail to address editj\uff20ipsj.or.jp, please."}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0387-5806", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Kojima, Yoshiharu"}], "nameIdentifiers": [{"nameIdentifier": "55664", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "55665", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nishida, Naoki"}], "nameIdentifiers": [{"nameIdentifier": "55666", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kusakari, Keiichirou"}], "nameIdentifiers": [{"nameIdentifier": "55667", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki"}], "nameIdentifiers": [{"nameIdentifier": "55668", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "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": "IPSJ-TPRO0203003.pdf", "filesize": [{"value": "640.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 640700.0, "url": {"label": "IPSJ-TPRO0203003.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/19058/files/IPSJ-TPRO0203003.pdf"}, "version_id": "0ec442a6-4812-4043-8592-ffe871a025d2"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems"}]}, "item_type_id": "10", "owner": "1", "path": ["312/313/314"], "permalink_uri": "http://hdl.handle.net/2237/21164", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2015-01-30"}, "publish_date": "2015-01-30", "publish_status": "0", "recid": "19058", "relation": {}, "relation_version_is_last": true, "title": ["Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems"], "weko_shared_id": null}