{"created":"2021-03-01T06:14:13.229889+00:00","id":7556,"links":{},"metadata":{"_buckets":{"deposit":"23c3f845-d5af-4e96-b808-4cd76161e947"},"_deposit":{"id":"7556","owners":[],"pid":{"revision_id":0,"type":"depid","value":"7556"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00007556","sets":["320:502:503"]},"author_link":["21286","21287","21288"],"item_10_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-06","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"211","bibliographicPageStart":"198","bibliographic_titles":[{"bibliographic_title":"12th International Workshop on Functional and (Constraint) Logic Programming","bibliographic_titleLang":"en"}]}]},"item_10_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Term rewriting systems (TRSs) are extended by allowing to contain extra variables in their rewrite rules. We call the extended systems EV-TRSs. They are ill-natured since every one-step reduction by their rules with extra variables is infinitely branching and they are not terminating. To solve these problems, this paper extends narrowing on TRSs into that on EV-TRSs and show that it simulates the reduction sequences of EV-TRSs as the narrowing sequences starting from ground terms. We prove the soundness of ground narrowing-sequences for the reduction sequences. We prove the completeness for the case of right-linear systems, and also for the case that no redex in terms substituted for extra variables is reduced in the reduction sequences. Moreover, we give a method to prove the termination of the simulation, extending the termination proof of TRSs using dependency pairs, to that of narrowing on EV-TRSs starting from ground terms.","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/9247"}]},"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":"21286","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Sakai, Masahiko","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"21287","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Sakabe, Toshiki","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"21288","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-02-19"}],"displaytype":"detail","filename":"sakai_8.pdf","filesize":[{"value":"195.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"sakai_8.pdf","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/7556/files/sakai_8.pdf"},"version_id":"55200612-3754-4bcb-abc3-a2ee64ffb1b2"}]},"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":"Narrowing-based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Narrowing-based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof","subitem_title_language":"en"}]},"item_type_id":"10","owner":"1","path":["503"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2008-01-07"},"publish_date":"2008-01-07","publish_status":"0","recid":"7556","relation_version_is_last":true,"title":["Narrowing-based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T03:53:00.653319+00:00"}