ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "7899cc30-9b4e-407e-8306-e1a914c207ee"}, "_deposit": {"id": "19066", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "19066"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00019066"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2013-11", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "10", "bibliographicPageStart": "1", "bibliographicVolumeNumber": "134", "bibliographic_titles": [{"bibliographic_title": "EPTCS"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of constrained term rewriting systems enables us to relax the side conditions of some inference rules in the proving method. These two properties can be reduced to intersection emptiness problems related to sets of ground instances for constrained terms. This paper proposes a method to construct deterministic, complete, and constraint-complete constrained tree automata recognizing ground instances of constrained terms.", "subitem_description_type": "Abstract"}]}, "item_10_description_5": {"attribute_name": "\u5185\u5bb9\u8a18\u8ff0", "attribute_value_mlt": [{"subitem_description": "Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers (Hanoi, Vietnam, Oct 19, 2013)", "subitem_description_type": "Other"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/21172"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "Electronic Proceedings in Theoretical Computer Science (EPTCS)"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "http://dx.doi.org/10.4204/EPTCS.134.1", "subitem_relation_type_select": "DOI"}}]}, "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": "2075-2180", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Nishida, Naoki"}], "nameIdentifiers": [{"nameIdentifier": "55713", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "55714", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nakano, Yasuhiro"}], "nameIdentifiers": [{"nameIdentifier": "55715", "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": "1311_5567.pdf", "filesize": [{"value": "218.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 218500.0, "url": {"label": "1311_5567.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/19066/files/1311_5567.pdf"}, "version_id": "4a62e092-3428-4b23-a7e4-cf77d28fd361"}]}, "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": "On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms"}]}, "item_type_id": "10", "owner": "1", "path": ["312/598/599"], "permalink_uri": "http://hdl.handle.net/2237/21172", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2015-01-30"}, "publish_date": "2015-01-30", "publish_status": "0", "recid": "19066", "relation": {}, "relation_version_is_last": true, "title": ["On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms"], "weko_shared_id": 3}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500e 会議資料
  3. 国際会議

On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms

http://hdl.handle.net/2237/21172
17b2ba9a-100b-498b-91b6-50fc55ae6529
名前 / ファイル ライセンス アクション
1311_5567.pdf 1311_5567.pdf (218.5 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2015-01-30
タイトル
タイトル On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms
著者 Nishida, Naoki

× Nishida, Naoki

WEKO 55713

Nishida, Naoki

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 55714

Sakai, Masahiko

Search repository
Nakano, Yasuhiro

× Nakano, Yasuhiro

WEKO 55715

Nakano, Yasuhiro

Search repository
抄録
内容記述 An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of constrained term rewriting systems enables us to relax the side conditions of some inference rules in the proving method. These two properties can be reduced to intersection emptiness problems related to sets of ground instances for constrained terms. This paper proposes a method to construct deterministic, complete, and constraint-complete constrained tree automata recognizing ground instances of constrained terms.
内容記述タイプ Abstract
内容記述
内容記述 Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers (Hanoi, Vietnam, Oct 19, 2013)
内容記述タイプ Other
出版者
出版者 Electronic Proceedings in Theoretical Computer Science (EPTCS)
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
DOI
関連識別子
識別子タイプ DOI
関連識別子 http://dx.doi.org/10.4204/EPTCS.134.1
ISSN
収録物識別子タイプ ISSN
収録物識別子 2075-2180
書誌情報 EPTCS

巻 134, p. 1-10, 発行日 2013-11
著者版フラグ
値 publisher
URI
識別子 http://hdl.handle.net/2237/21172
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

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