ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_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", "sets": ["314"]}, "author_link": ["55664", "55665", "55666", "55667", "55668"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2009-07", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "32", "bibliographicPageStart": "20", "bibliographicVolumeNumber": "2", "bibliographic_titles": [{"bibliographic_title": "情報処理学会論文誌, プログラミング", "bibliographic_titleLang": "ja"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "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_language": "en", "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": "出版者", "attribute_value_mlt": [{"subitem_publisher": "一般社団法人情報処理学会", "subitem_publisher_language": "ja"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://id.nii.ac.jp/1001/00060663/", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice 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@ipsj.or.jp, please.", "subitem_rights_language": "ja"}]}, "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": "0387-5806", "subitem_source_identifier_type": "PISSN"}]}, "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": "Kojima, Yoshiharu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55664", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55665", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nishida, Naoki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55666", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kusakari, Keiichirou", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55667", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "55668", "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": "IPSJ-TPRO0203003.pdf", "filesize": [{"value": "640.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 640700.0, "url": {"label": "IPSJ-TPRO0203003.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/19058/files/IPSJ-TPRO0203003.pdf"}, "version_id": "0ec442a6-4812-4043-8592-ffe871a025d2"}]}, "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": "Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/21164", "pubdate": {"attribute_name": "PubDate", "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": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems

http://hdl.handle.net/2237/21164
http://hdl.handle.net/2237/21164
d88394bd-baf0-45b0-b2f1-f2cf9a929a70
名前 / ファイル ライセンス アクション
IPSJ-TPRO0203003.pdf IPSJ-TPRO0203003.pdf (640.7 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2015-01-30
タイトル
タイトル Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems
言語 en
著者 Kojima, Yoshiharu

× Kojima, Yoshiharu

WEKO 55664

en Kojima, Yoshiharu

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 55665

en Sakai, Masahiko

Search repository
Nishida, Naoki

× Nishida, Naoki

WEKO 55666

en Nishida, Naoki

Search repository
Kusakari, Keiichirou

× Kusakari, Keiichirou

WEKO 55667

en Kusakari, Keiichirou

Search repository
Sakabe, Toshiki

× Sakabe, Toshiki

WEKO 55668

en Sakabe, Toshiki

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 ja
権利情報 ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice 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@ipsj.or.jp, please.
抄録
内容記述 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.
言語 en
内容記述タイプ Abstract
出版者
言語 ja
出版者 一般社団法人情報処理学会
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
関連情報
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://id.nii.ac.jp/1001/00060663/
ISSN
収録物識別子タイプ PISSN
収録物識別子 0387-5806
書誌情報 ja : 情報処理学会論文誌, プログラミング

巻 2, 号 3, p. 20-32, 発行日 2009-07
著者版フラグ
値 publisher
URI
識別子 http://id.nii.ac.jp/1001/00060663/
識別子タイプ URI
URI
識別子 http://hdl.handle.net/2237/21164
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 16:23:54.039191
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