{"created":"2021-03-01T06:15:23.249487+00:00","id":8663,"links":{},"metadata":{"_buckets":{"deposit":"c9906e41-290c-43ef-a839-2f99647f3c5c"},"_deposit":{"id":"8663","owners":[],"pid":{"revision_id":0,"type":"depid","value":"8663"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00008663","sets":["312:1037:1038"]},"author_link":["24374"],"item_18_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2006-12","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"168","bibliographicPageStart":"161","bibliographic_titles":[{"bibliographic_title":"4th Symposium on \"Intelligent Media Integration for Social Information Infrastructure\" December 7-8, 2006","bibliographic_titleLang":"en"}]}]},"item_18_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We consider several classes of term rewriting systems and prove that termination is decidable for these classes. By showing the cycling property of infinite dependency chains, we prove that termination is decidable for semi-constructor case, which is a superclass of right-ground TRSs. By analyzing argument propagation cycles in the dependency graph, we show that termination is also decidable for left-linear shallow TRSs. Moreover we extend these by combining these two techniques.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_18_identifier_60":{"attribute_name":"URI","attribute_value_mlt":[{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/2237/10414"}]},"item_18_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"INTELLIGENT MEDIA INTEGRATION  NAGOYA UNIVERSITY / COE","subitem_publisher_language":"en"}]},"item_18_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_18_text_14":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_text_value":"application/pdf"}]},"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":"Sakai, Masahiko","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"24374","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-02-19"}],"displaytype":"detail","filename":"p161-168_Classes_whose_termination_is_decidable.pdf","filesize":[{"value":"531.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"p161-168_Classes_whose_termination_is_decidable.pdf","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/8663/files/p161-168_Classes_whose_termination_is_decidable.pdf"},"version_id":"542fbb45-6ca5-4195-bd94-7be606c0bdc4"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"CLASSES WHOSE TERMINATION IS DECIDABLE","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"CLASSES WHOSE TERMINATION IS DECIDABLE","subitem_title_language":"en"}]},"item_type_id":"18","owner":"1","path":["1038"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2008-08-20"},"publish_date":"2008-08-20","publish_status":"0","recid":"8663","relation_version_is_last":true,"title":["CLASSES WHOSE TERMINATION IS DECIDABLE"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T05:08:48.108442+00:00"}