{"updated":"2025-01-19T15:54:48.568155+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216133","sets":["1164:2592:10824:10825"]},"path":["10825"],"owner":"44499","recid":"216133","title":["有界モデル検査による独立集合遷移問題の解法に関する考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-01-20"},"_buckets":{"deposit":"9af1256a-ab06-4f60-a0cb-955eedeacac6"},"_deposit":{"id":"216133","pid":{"type":"depid","value":"216133","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"有界モデル検査による独立集合遷移問題の解法に関する考察","author_link":["557594","557595","557592","557593","557590","557591"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"有界モデル検査による独立集合遷移問題の解法に関する考察"},{"subitem_title":"On Solving Independent Set Reconfiguration Problems with Bounded Model Checking","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-01-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学大学院情報理工学研究科"},{"subitem_text_value":"東北大学大学院情報科学研究科"},{"subitem_text_value":"京都大学大学院情報学研究科"},{"subitem_text_value":"神戸大学情報基盤センター"},{"subitem_text_value":"東北大学大学院情報科学研究科"},{"subitem_text_value":"兵庫県立大学大学院情報科学研究科"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/216133/files/IPSJ-AL22186005.pdf","label":"IPSJ-AL22186005.pdf"},"date":[{"dateType":"Available","dateValue":"2024-01-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL22186005.pdf","filesize":[{"value":"885.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"870b8b58-11e7-4ae9-b669-8a62c5b7f970","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"戸田, 貴久"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"伊藤, 健洋"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"川原, 純"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"宋, 剛秀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鈴木, 顕"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"照山, 順一"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"独立集合遷移問題とは，グラフの独立集合に所定の変更操作を繰り返し適用して，初期の独立集合から目標の独立集合へと遷移させることができるかどうか判定する問題である．これは，もっともよく研究されている組合せ遷移問題の一つである．本研究では，変更操作の適用回数が限定された場合において，この問題に対する有界モデル検査を用いた解法を考察する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The INDEPENDENT SET RECONFIGURATION problem, which is one of the most well-studied reconfiguration problems, is to determine whether two given independent sets of a graph can be transformed into each other by repeatedly applying a prescribed operation. In this study, we consider the case where the number of applications of the operation is bounded, and propose methods to solve the case with bounded model checking.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-01-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2022-AL-186"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:16:51.381371+00:00","id":216133,"links":{}}