ログイン
言語:

WEKO3

  • トップ
  • コミュニティ
  • ランキング
AND
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "7e269811-5262-4d17-9eb4-cdd778a07bb9"}, "_deposit": {"id": "19053", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "19053"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00019053"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2010-05", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "5", "bibliographicPageEnd": "962", "bibliographicPageStart": "953", "bibliographicVolumeNumber": "E93D", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on information and systems"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "In this paper, we show that the termination and the innermost termination properties are decidable for the class of term rewriting systems (TRSs for short) all of whose dependency pairs are right-linear and right-shallow. We also show that the innermost termination is decidable for the class of TRSs all of whose dependency pairs are shallow. The key observation common to these two classes is as follows: for every TRS in the class, we can construct, by using the dependency-pairs information, a finite set of terms such that if the TRS is non-terminating then there is a looping sequence beginning with a term in the finite set. This fact is obtained by modifying the analysis of argument propagation in shallow dependency pairs proposed by Wang and Sakai in 2006. However we gained a great benefit that the resulted procedures do not require any decision procedure of reachability problem used in Wang\u0027s procedure for shallow case, because known decidable classes of reachability problem are not larger than classes discussing in this paper.", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "https://search.ieice.org/"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/21159"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "\u4e00\u822c\u793e\u56e3\u6cd5\u4eba\u96fb\u5b50\u60c5\u5831\u901a\u4fe1\u5b66\u4f1a"}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "(c)\u4e00\u822c\u793e\u56e3\u6cd5\u4eba\u96fb\u5b50\u60c5\u5831\u901a\u4fe1\u5b66\u4f1a\u3002\u672c\u6587\u30c7\u30fc\u30bf\u306f\u5b66\u5354\u4f1a\u306e\u8a31\u8afe\u306b\u57fa\u3065\u304dCiNii\u304b\u3089\u8907\u88fd\u3057\u305f\u3082\u306e\u3067\u3042\u308b"}]}, "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": "0916-8532", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "UCHIYAMA, Keita"}], "nameIdentifiers": [{"nameIdentifier": "55635", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SAKAI, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "55636", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SAKABE, Toshiki"}], "nameIdentifiers": [{"nameIdentifier": "55637", "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": "e93-d_5_953.pdf", "filesize": [{"value": "505.8 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 505800.0, "url": {"label": "e93-d_5_953.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/19053/files/e93-d_5_953.pdf"}, "version_id": "a091b25b-2c6d-49db-9364-f278a6117983"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "attribute_value_mlt": [{"subitem_subject": "looping sequence", "subitem_subject_scheme": "Other"}, {"subitem_subject": "argument propagation", "subitem_subject_scheme": "Other"}]}, "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 Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs"}]}, "item_type_id": "10", "owner": "1", "path": ["312/313/314"], "permalink_uri": "http://hdl.handle.net/2237/21159", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2015-01-29"}, "publish_date": "2015-01-29", "publish_status": "0", "recid": "19053", "relation": {}, "relation_version_is_last": true, "title": ["Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs"], "weko_shared_id": null}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs

http://hdl.handle.net/2237/21159
1fe75a88-0b6b-49fe-a666-0dcf5460cfc4
名前 / ファイル ライセンス アクション
e93-d_5_953.pdf e93-d_5_953.pdf (505.8 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2015-01-29
タイトル
タイトル Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs
著者 UCHIYAMA, Keita

× UCHIYAMA, Keita

WEKO 55635

UCHIYAMA, Keita

Search repository
SAKAI, Masahiko

× SAKAI, Masahiko

WEKO 55636

SAKAI, Masahiko

Search repository
SAKABE, Toshiki

× SAKABE, Toshiki

WEKO 55637

SAKABE, Toshiki

Search repository
権利
権利情報 (c)一般社団法人電子情報通信学会。本文データは学協会の許諾に基づきCiNiiから複製したものである
キーワード
主題Scheme Other
主題 looping sequence
キーワード
主題Scheme Other
主題 argument propagation
抄録
内容記述 In this paper, we show that the termination and the innermost termination properties are decidable for the class of term rewriting systems (TRSs for short) all of whose dependency pairs are right-linear and right-shallow. We also show that the innermost termination is decidable for the class of TRSs all of whose dependency pairs are shallow. The key observation common to these two classes is as follows: for every TRS in the class, we can construct, by using the dependency-pairs information, a finite set of terms such that if the TRS is non-terminating then there is a looping sequence beginning with a term in the finite set. This fact is obtained by modifying the analysis of argument propagation in shallow dependency pairs proposed by Wang and Sakai in 2006. However we gained a great benefit that the resulted procedures do not require any decision procedure of reachability problem used in Wang's procedure for shallow case, because known decidable classes of reachability problem are not larger than classes discussing in this paper.
内容記述タイプ Abstract
出版者
出版者 一般社団法人電子情報通信学会
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
ISSN
収録物識別子タイプ ISSN
収録物識別子 0916-8532
書誌情報 IEICE transactions on information and systems

巻 E93D, 号 5, p. 953-962, 発行日 2010-05
著者版フラグ
値 publisher
URI
識別子 https://search.ieice.org/
識別子タイプ URI
URI
識別子 http://hdl.handle.net/2237/21159
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 16:24:06.757231
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Cite as

Export

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

Confirm


Powered by CERN Data Centre & Invenio


Powered by CERN Data Centre & Invenio