{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00212819","sets":["1164:4402:10541:10706"]},"path":["10706"],"owner":"44499","recid":"212819","title":["ADSAT：敵対者が存在するMaxSAT"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-09-08"},"_buckets":{"deposit":"294a7a1e-b6ae-4aea-8d39-e9f03e83cb4a"},"_deposit":{"id":"212819","pid":{"type":"depid","value":"212819","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ADSAT：敵対者が存在するMaxSAT","author_link":["543540","543539","543538"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ADSAT：敵対者が存在するMaxSAT"}]},"item_type_id":"4","publish_date":"2021-09-08","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"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/212819/files/IPSJ-ICS21204013.pdf","label":"IPSJ-ICS21204013.pdf"},"date":[{"dateType":"Available","dateValue":"2023-09-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ICS21204013.pdf","filesize":[{"value":"756.6 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":"25"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ebfecd36-36d9-48b5-8101-f952d72cd9e6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11135936","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-885X","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，ADSAT (Attacker Defender SAT) と呼ばれる，防御者と敵対者が存在する場合の MaxSAT について論じる．MaxSAT は，充足可能性問題 (SAT) を最適化問題に拡張したものであり，その目的は充足する節の数の最大化である．ADSAT において，防御者は充足する節の数の最大化を目的とし，敵対者はその最小化を目的とする．本研究の目的は，敵対者のあらゆる攻撃を想定した防御者の最適解を求めることである．このような頑健な解を求めることは理論上のみならず実用上も重要である．先行研究において，ADSAT を解くアルゴリズムとして IBR (Iterated Best Response) が提案されている．しかしながら，ADSAT は ΣP2 完全問題であるため，小さいサイズの問題でも実用的な時間で最適解を求めることが非常に困難である．そこで本論文では，ADSAT の近似解を求めるアルゴリズムとして，IBR を簡略化した BP-BR (Best Preference Best Response) と AE (Attack Enumeration) の 2 種を提案する．特に敵対者の攻撃を限定した場合，AE は効率的に近似解を求めることができる．また，計算機実験により 3 つのアルゴリズムの性能を比較し，評価を行う．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告知能システム（ICS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-09-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"13","bibliographicVolumeNumber":"2021-ICS-204"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":212819,"updated":"2025-01-19T17:21:47.609851+00:00","links":{},"created":"2025-01-19T01:13:44.935808+00:00"}