{"id":220600,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220600","sets":["6504:11035:11037"]},"path":["11037"],"owner":"44499","recid":"220600","title":["チャネリング制約を用いた alldifferent 制約の SAT 符号化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-17"},"_buckets":{"deposit":"8f416d9f-af84-46a2-b347-2100954bba8f"},"_deposit":{"id":"220600","pid":{"type":"depid","value":"220600","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"チャネリング制約を用いた alldifferent 制約の SAT 符号化","author_link":["577178","577179","577177","577176"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"チャネリング制約を用いた alldifferent 制約の SAT 符号化"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2022-02-17","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名大"},{"subitem_text_value":"神戸大"},{"subitem_text_value":"神戸大"},{"subitem_text_value":"名大"}]},"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/220600/files/IPSJ-Z84-1L-03.pdf","label":"IPSJ-Z84-1L-03.pdf"},"date":[{"dateType":"Available","dateValue":"2022-10-22"}],"format":"application/pdf","filename":"IPSJ-Z84-1L-03.pdf","filesize":[{"value":"215.2 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"88d0892d-1362-4147-bd11-19fcb0d2282c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小菅, 脩司"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"宋, 剛秀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"田村, 直之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"番原, 睦則"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"alldifferent（x<sub>1</sub>,...,x<sub>n</sub>） 制約は，制約プログラミングにおける代表的なグローバル制約の一つである．この制約は，与えられた変数 x<sub>i</sub> が互いに異なる値を取ることを意味する．alldifferent 制約は，グラフ彩色問題や時間割問題など様々な問題に現れる．本発表では，alldifferent 制約の SAT 符号化について，順序符号化法と直接符号化法をチャネリング制約を用いて融合した手法について述べる．考案した SAT 符号化の評価として，Knuth のThe Art of Computer Programming でも取り上げられているクイーングラフ彩色問題を用いた実験結果を示す．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"268","bibliographic_titles":[{"bibliographic_title":"第84回全国大会講演論文集"}],"bibliographicPageStart":"267","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T14:30:23.038368+00:00","created":"2025-01-19T01:20:38.100531+00:00","links":{}}