{"_buckets": {"deposit": "70548760-f31d-4ff4-8a08-1542e1652eaf"}, "_deposit": {"id": "7548", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7548"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00007548"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2007-06", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "27", "bibliographicPageStart": "16", "bibliographic_titles": [{"bibliographic_title": "Proceedings of 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS2007) Paris"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ground term rewriting systems. The decidability was shown by the fact that every non-terminating TRS in the class has a loop. In this paper we modify the proof of [9] to show that both innermost termination and \u03bc-termination are decidable properties for the class of semi-constructor TRSs.", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/9238"}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_text_14": {"attribute_name": "\u30d5\u30a9\u30fc\u30de\u30c3\u30c8", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Uchiyama, Keita"}], "nameIdentifiers": [{"nameIdentifier": "21262", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "21263", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki"}], "nameIdentifiers": [{"nameIdentifier": "21264", "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-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "sakai_2.pdf", "filesize": [{"value": "239.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 239400.0, "url": {"label": "sakai_2.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/7548/files/sakai_2.pdf"}, "version_id": "d57673fb-e494-4224-a2f4-1b6988c658da"}]}, "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": "Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems"}]}, "item_type_id": "10", "owner": "1", "path": ["312/598/599"], "permalink_uri": "http://hdl.handle.net/2237/9238", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_name_i18n": "\u516c\u958b\u65e5", "attribute_value": "2008-01-04"}, "publish_date": "2008-01-04", "publish_status": "0", "recid": "7548", "relation": {}, "relation_version_is_last": true, "title": ["Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems"], "weko_shared_id": null}