ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "c98ca9b0-ab00-46f4-8100-1338b868330d"}, "_deposit": {"id": "7562", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7562"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00007562"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2001-10", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "198", "bibliographicPageStart": "188", "bibliographic_titles": [{"bibliographic_title": "The International Workshop on Rewriting in Proof and Computation"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "In this paper, we present an algorithm for generating a conditional TRS that implements the inverses of pure treeless functions defined by a pure treeless TRS which is a restricted orthogonal TRS. Our algorithm constructs conditional rules from a pure treeless TRS in such a way that each rule is reversed and then is modified according to the idea of the fusion transformation. We prove that the conditional TRS constructed by our algorithm implements the inverses of those functions defined by a given pure treeless TRS. Moreover, we show that the conditional TRS generated by our algorithm can be transformed to an equivalent TRS if the input pure treeless TRS of the algorithm is right-linear.", "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/9253"}]}, "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": "Nishida, Naoki"}], "nameIdentifiers": [{"nameIdentifier": "21301", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "21302", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki"}], "nameIdentifiers": [{"nameIdentifier": "21303", "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_13.pdf", "filesize": [{"value": "194.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 194700.0, "url": {"label": "sakai_13.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/7562/files/sakai_13.pdf"}, "version_id": "2e53c472-f678-4a0f-913a-b0ced211a6c5"}]}, "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": "Generation of Inverse Term Rewriting Systems for Pure Treeless Functions", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Generation of Inverse Term Rewriting Systems for Pure Treeless Functions"}]}, "item_type_id": "10", "owner": "1", "path": ["320/502/503"], "permalink_uri": "http://hdl.handle.net/2237/9253", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2008-01-08"}, "publish_date": "2008-01-08", "publish_status": "0", "recid": "7562", "relation": {}, "relation_version_is_last": true, "title": ["Generation of Inverse Term Rewriting Systems for Pure Treeless Functions"], "weko_shared_id": null}
  1. B200 工学部/工学研究科
  2. B200e 会議資料
  3. 国際会議

Generation of Inverse Term Rewriting Systems for Pure Treeless Functions

http://hdl.handle.net/2237/9253
30666832-0ce5-4962-86a6-e9d54fc87300
名前 / ファイル ライセンス アクション
sakai_13.pdf sakai_13.pdf (194.7 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-01-08
タイトル
タイトル Generation of Inverse Term Rewriting Systems for Pure Treeless Functions
著者 Nishida, Naoki

× Nishida, Naoki

WEKO 21301

Nishida, Naoki

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 21302

Sakai, Masahiko

Search repository
Sakabe, Toshiki

× Sakabe, Toshiki

WEKO 21303

Sakabe, Toshiki

Search repository
抄録
内容記述 In this paper, we present an algorithm for generating a conditional TRS that implements the inverses of pure treeless functions defined by a pure treeless TRS which is a restricted orthogonal TRS. Our algorithm constructs conditional rules from a pure treeless TRS in such a way that each rule is reversed and then is modified according to the idea of the fusion transformation. We prove that the conditional TRS constructed by our algorithm implements the inverses of those functions defined by a given pure treeless TRS. Moreover, we show that the conditional TRS generated by our algorithm can be transformed to an equivalent TRS if the input pure treeless TRS of the algorithm is right-linear.
内容記述タイプ Abstract
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
書誌情報 The International Workshop on Rewriting in Proof and Computation

p. 188-198, 発行日 2001-10
フォーマット
application/pdf
著者版フラグ
値 publisher
URI
識別子 http://hdl.handle.net/2237/9253
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 20:09:55.259778
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