ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "ffc659b6-0f6d-4ac0-bbe9-c0947fda1f85"}, "_deposit": {"id": "7553", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7553"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00007553", "sets": ["599"]}, "author_link": ["21275", "21276", "21277"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2005-04", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "278", "bibliographicPageStart": "264", "bibliographic_titles": [{"bibliographic_title": "16th International Conference on Term Rewriting and Applications", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already given. In this paper, we propose a partial-inversion compiler of constructor term rewriting systems. The compiler automatically generates a conditional term rewriting system, and then unravels it to an unconditional system. To improve the efficiency of inverse computation, we show that innermost strategy is usable to obtain all solutions if the generated system is right-linear.", "subitem_description_language": "en", "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/9245"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Springer", "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.1007/978-3-540-32033-3_20", "subitem_relation_type_select": "DOI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "The original publication is available at www.springerlink.com.", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_text_14": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "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": "Nishida, Naoki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21275", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21276", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21277", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "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_7.pdf", "filesize": [{"value": "282.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 282500.0, "url": {"label": "sakai_7.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/7553/files/sakai_7.pdf"}, "version_id": "f28b4638-0ed8-4724-8c5a-d91b9ec4f4cb"}]}, "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": "Partial Inversion of Constructor Term Rewriting Systems", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Partial Inversion of Constructor Term Rewriting Systems", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["599"], "permalink_uri": "http://hdl.handle.net/2237/9245", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2008-01-07"}, "publish_date": "2008-01-07", "publish_status": "0", "recid": "7553", "relation": {}, "relation_version_is_last": true, "title": ["Partial Inversion of Constructor Term Rewriting Systems"], "weko_shared_id": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500e 会議資料
  3. 国際会議

Partial Inversion of Constructor Term Rewriting Systems

http://hdl.handle.net/2237/9245
http://hdl.handle.net/2237/9245
c5a32761-c89f-4bb9-8070-5fde4501ff48
名前 / ファイル ライセンス アクション
sakai_7.pdf sakai_7.pdf (282.5 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-01-07
タイトル
タイトル Partial Inversion of Constructor Term Rewriting Systems
言語 en
著者 Nishida, Naoki

× Nishida, Naoki

WEKO 21275

en Nishida, Naoki

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 21276

en Sakai, Masahiko

Search repository
Sakabe, Toshiki

× Sakabe, Toshiki

WEKO 21277

en Sakabe, Toshiki

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 The original publication is available at www.springerlink.com.
抄録
内容記述 Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already given. In this paper, we propose a partial-inversion compiler of constructor term rewriting systems. The compiler automatically generates a conditional term rewriting system, and then unravels it to an unconditional system. To improve the efficiency of inverse computation, we show that innermost strategy is usable to obtain all solutions if the generated system is right-linear.
言語 en
内容記述タイプ Abstract
出版者
言語 en
出版者 Springer
言語
言語 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.1007/978-3-540-32033-3_20
書誌情報 en : 16th International Conference on Term Rewriting and Applications

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

Versions

Ver.1 2021-03-01 12:18:10.577140
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