ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "8a62b1e6-e1b7-41ee-82f3-d4044783e5d5"}, "_deposit": {"id": "19068", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "19068"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00019068", "sets": ["314"]}, "author_link": ["55718", "55719", "55720"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2008-04", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "34", "bibliographicPageStart": "21", "bibliographicVolumeNumber": "204", "bibliographic_titles": [{"bibliographic_title": "Electronic Notes in Theoretical Computer Science", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Yi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in Computer Science, pages 343–356, 2006.] 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. 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 [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in Computer Science, pages 343–356, 2006.] to show that both innermost termination and μ-termination are decidable properties for the class of semi-constructor TRSs.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_description_5": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007)", "subitem_description_language": "en", "subitem_description_type": "Other"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "DOI", "subitem_identifier_uri": "http://dx.doi.org/10.1016/j.entcs.2008.03.051"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/21174"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Elsevier", "subitem_publisher_language": "en"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1016/j.entcs.2008.03.051", "subitem_relation_type_select": "DOI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "2008 Elsevier B.V. Open access under CC BY-NC-ND license.", "subitem_rights_language": "en"}]}, "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": "1571-0661", "subitem_source_identifier_type": "EISSN"}]}, "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": "Uchiyama, Keita", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55718", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55719", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55720", "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": "1-s2_0-S1571066108001564-main.pdf", "filesize": [{"value": "355.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 355500.0, "url": {"label": "1-s2_0-S1571066108001564-main.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/19068/files/1-s2_0-S1571066108001564-main.pdf"}, "version_id": "f9f9eb2b-fc33-4f8e-be33-865eff15f847"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Context-Sensitive Termination", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Dependency Pair", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Innermost Termination", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "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": "タイトル", "attribute_value_mlt": [{"subitem_title": "Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/21174", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2015-02-04"}, "publish_date": "2015-02-04", "publish_status": "0", "recid": "19068", "relation": {}, "relation_version_is_last": true, "title": ["Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems"], "weko_shared_id": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

http://hdl.handle.net/2237/21174
http://hdl.handle.net/2237/21174
6ff3e6e3-3c3a-4a31-8a4f-30cfd918b87f
名前 / ファイル ライセンス アクション
1-s2_0-S1571066108001564-main.pdf 1-s2_0-S1571066108001564-main.pdf (355.5 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2015-02-04
タイトル
タイトル Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
言語 en
著者 Uchiyama, Keita

× Uchiyama, Keita

WEKO 55718

en Uchiyama, Keita

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 55719

en Sakai, Masahiko

Search repository
Sakabe, Toshiki

× Sakabe, Toshiki

WEKO 55720

en Sakabe, Toshiki

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 2008 Elsevier B.V. Open access under CC BY-NC-ND license.
キーワード
主題Scheme Other
主題 Context-Sensitive Termination
キーワード
主題Scheme Other
主題 Dependency Pair
キーワード
主題Scheme Other
主題 Innermost Termination
抄録
内容記述 Yi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in Computer Science, pages 343–356, 2006.] 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. 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 [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in Computer Science, pages 343–356, 2006.] to show that both innermost termination and μ-termination are decidable properties for the class of semi-constructor TRSs.
言語 en
内容記述タイプ Abstract
内容記述
内容記述 Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007)
言語 en
内容記述タイプ Other
出版者
言語 en
出版者 Elsevier
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
DOI
関連タイプ isVersionOf
識別子タイプ DOI
関連識別子 https://doi.org/10.1016/j.entcs.2008.03.051
ISSN
収録物識別子タイプ EISSN
収録物識別子 1571-0661
書誌情報 en : Electronic Notes in Theoretical Computer Science

巻 204, p. 21-34, 発行日 2008-04
著者版フラグ
値 publisher
URI
識別子 http://dx.doi.org/10.1016/j.entcs.2008.03.051
識別子タイプ DOI
URI
識別子 http://hdl.handle.net/2237/21174
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 16:23:30.777433
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3