{"updated":"2025-01-21T10:42:01.439811+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00102780","sets":["6164:6165:7651:7653"]},"path":["7653"],"owner":"11","recid":"102780","title":["SAT型制約ソルバーを用いたナンバーリンクの解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-08-21"},"_buckets":{"deposit":"9dd0641e-9b57-4568-9d33-a82d31c442cb"},"_deposit":{"id":"102780","pid":{"type":"depid","value":"102780","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"SAT型制約ソルバーを用いたナンバーリンクの解法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"SAT型制約ソルバーを用いたナンバーリンクの解法"},{"subitem_title":"Solving Numberlink by a SAT-based Constraint Solver","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"アルゴリズム・ソルバ","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2014-08-21","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"神戸大学情報基盤センター"},{"subitem_text_value":"神戸大学情報基盤センター"},{"subitem_text_value":"神戸大学情報基盤センター"},{"subitem_text_value":"山梨大学医学工学総合研究部"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Yamanashi University","subitem_text_language":"en"}]},"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/102780/files/IPSJ-DAS2014040.pdf"},"date":[{"dateType":"Available","dateValue":"2016-08-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DAS2014040.pdf","filesize":[{"value":"135.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"330","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3816e6f5-8e02-4002-a89c-c7beb5c2a6a3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田村, 直之"},{"creatorName":"宋, 剛秀"},{"creatorName":"番原, 睦則"},{"creatorName":"鍋島, 英知"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naoyuki, Tamura","creatorNameLang":"en"},{"creatorName":"Takehide, Soh","creatorNameLang":"en"},{"creatorName":"Mutsunori, Banbara","creatorNameLang":"en"},{"creatorName":"Hidetomo, Nabeshima","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"制約充足問題 (CSP) は与えられた制約を満たす解を探索する問題であり，多くの組合せ問題は CSP として定式化できる．SAT 型制約ソルバーは，CSP を命題論理の充足可能性判定問題 (SAT) に符号化し，SAT ソルバーを用いて探索することにより，CSP の解を求めるプログラムである．ここでは，国際的な競技会で優秀な成績を収めている制約ソルバー Sugar および SAT ソルバー GlueMiniSat を用い，SAT 型制約ソルバーでナンバーリンク問題の高速な求解が可能であることを示す．また，制約記述には Scala 上の制約プログラミングシステムであるCopris を用いる．これにより，提案するシステムは高い拡張性も実現している．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Constraint Satisfaction Problem (CSP) is a problem to find a solution satisfying all given constraints, and many combinatorial problems can be formalized as a CSP. SAT-based constraint solver is a program to find a solution of a given CSP by encoding it to a Boolean satisfiability testing program (SAT) and searching a solution with a SAT solver. In this paper, we show a SAT-based constraint solver can efficiently solve Numberlink puzzles with Sugar and GlueMiniSat solvers which performed well at the international solver competitions. A constraint programming system Copris on a Scala programming language is used for a constraint modeling. Therefore, the proposed Numberlink solver also realizes high extensibility.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"220","bibliographic_titles":[{"bibliographic_title":"DAシンポジウム2014論文集"}],"bibliographicPageStart":"215","bibliographicIssueDates":{"bibliographicIssueDate":"2014-08-21","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2014"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:47:57.646992+00:00","id":102780,"links":{}}