{"_buckets": {"deposit": "87d48a93-c67d-40cd-9287-b4afb802aa8e"}, "_deposit": {"id": "21419", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "21419"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00021419", "sets": ["314"]}, "author_link": ["62165", "62166", "62167", "62168", "62169", "62170", "62171", "62172", "62173", "62174"], "item_10_alternative_title_19": {"attribute_name": "その他のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "Construction of Constrained Tree Automata Recognizing Ground Instances of Constrained Terms", "subitem_alternative_title_language": "en"}]}, "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2013-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "373", "bibliographicPageEnd": "12", "bibliographicPageStart": "7", "bibliographicVolumeNumber": "112", "bibliographic_titles": [{"bibliographic_title": "電子情報通信学会技術研究報告. SS, ソフトウェアサイエンス", "bibliographic_titleLang": "ja"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "制約付き項書換え系の書換え帰納法に基づいた定理自動証明の際に、制約付き項書換え系のR完全性の判定手続きが必要である。また、対象の制約付き項書換え系が十分完全性を持つ場合に、定理自動証明中の推論規則の適用条件を緩和することができる。これらの性質は、制約付き項のインスタンスの集合に関する積集合空問題に帰着できる。本論文では、制約付き項のインスタンスを受理する制約付き木オートマトンの構成法を提案する。さらに、制約付き木オートマトン中でどの入力基底項も到達することのない状態を削除する手法を提案することで、R完全性や十分完全性の判定の精度向上と効率化をめざす。 ", "subitem_description_language": "ja", "subitem_description_type": "Abstract"}, {"subitem_description": "A theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for R-completeness of constrained term rewriting systems. In addition, sufficient completeness of constrained term rewriting systems enables us to relax the side conditions of some inference rules in the proving method. These two properties of constrained term rewriting systems can be reduced to intersection emptiness problems related to sets of ground instances for constrained terms. In this paper, we propose a method to construct constrained tree automata recognizing ground instances of constrained terms. We also propose a method to remove states from a constrained tree automaton, to which no ground term transitions, thus improving the accuracy for the judgements of R-completeness and sufficient completeness.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_description_5": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "IEICE Technical Report;SS2012-47", "subitem_description_language": "en", "subitem_description_type": "Other"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://ci.nii.ac.jp/naid/110009728075/"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/23563"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "一般社団法人電子情報通信学会", "subitem_publisher_language": "ja"}]}, "item_10_relation_40": {"attribute_name": "シリーズ", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "IEICE Technical Report;SS2012-47"}]}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://ci.nii.ac.jp/naid/110009728075/", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "(c)一般社団法人電子情報通信学会 本文データは学協会の許諾に基づきCiNiiから複製したものである", "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": "0913-5685", "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": "中野, 靖大", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "62165", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "西田, 直樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "62166", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "酒井, 正彦", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "62167", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "坂部, 俊樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "62168", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "草刈, 圭一朗", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "62169", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "NAKANO, Yasuhiro", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "62170", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "NISHIDA, Naoki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "62171", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SAKAI, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "62172", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SAKABE, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "62173", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KUSAKARI, Keiichirou", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "62174", "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": "110009728075.pdf", "filesize": [{"value": "911.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 911000.0, "url": {"label": "110009728075.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/21419/files/110009728075.pdf"}, "version_id": "74de108c-97f9-443e-a3bc-571e2575acda"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "制約付き項書換え系", "subitem_subject_scheme": "Other"}, {"subitem_subject": "積集合空問題", "subitem_subject_scheme": "Other"}, {"subitem_subject": "十分完全性", "subitem_subject_scheme": "Other"}, {"subitem_subject": "constrained term rewriting system", "subitem_subject_scheme": "Other"}, {"subitem_subject": "intersection emptiness problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "suficient completeness", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "制約付き項のインスタンスを受理する制約付き木オートマトンの構成法", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "制約付き項のインスタンスを受理する制約付き木オートマトンの構成法", "subitem_title_language": "ja"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/23563", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2016-02-23"}, "publish_date": "2016-02-23", "publish_status": "0", "recid": "21419", "relation": {}, "relation_version_is_last": true, "title": ["制約付き項のインスタンスを受理する制約付き木オートマトンの構成法"], "weko_shared_id": -1}