{"updated":"2025-01-22T18:42:00.359582+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00027118","sets":["1164:2036:2055:2056"]},"path":["2056"],"owner":"1","recid":"27118","title":["限量子付ブール式の充足可能性判定を用いた論理式の最小因数分解手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-11-30"},"_buckets":{"deposit":"320ebaf7-1849-4021-a9df-10d906abf7bb"},"_deposit":{"id":"27118","pid":{"type":"depid","value":"27118","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"限量子付ブール式の充足可能性判定を用いた論理式の最小因数分解手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"限量子付ブール式の充足可能性判定を用いた論理式の最小因数分解手法"},{"subitem_title":"Exact Minimum Logic Factoring via Quantified Boolean Satisfiability","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2005-11-30","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院工学系研究科電子工学専攻"},{"subitem_text_value":"東京大学大規模集積システム設計教育研究センター（VDEC）"},{"subitem_text_value":"東京大学大規模集積システム設計教育研究センター（VDEC）"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Electronic Engineering University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"VLSI Design and Education Center(VDEC) University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"VLSI Design and Education Center(VDEC) University of Tokyo","subitem_text_language":"en"}]},"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/27118/files/IPSJ-SLDM05122030.pdf"},"date":[{"dateType":"Available","dateValue":"2007-11-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM05122030.pdf","filesize":[{"value":"889.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":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"656bf517-5225-4d6d-850c-82b611d365d0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"書田, 浩章"},{"creatorName":"二瀧田, 誠"},{"creatorName":"浅田, 邦博"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroaki, YOSHIDA","creatorNameLang":"en"},{"creatorName":"Makoto, IKWDA","creatorNameLang":"en"},{"creatorName":"Kunihiro, ASADA","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では不完全定義論理関数の最小因数分解形表現を発見する厳密手法を提案する．提案手法では因数分解問題を限量子付プール式として表現し，この解を汎用の充足可能性判定手法によって求める．また我々はX-B木と呼ばれる新しいグラフ構造を提案する．X-B木は暗黙的にすべての可能な二分木構造を網羅しており，これを用いることにより因数分解問題を効率的に表現することが可能となっている．最後に例題を用いた計算機実験の結果を示し，本手法の妥当性を示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper presents an exact algorithm which finds the minimum factored form of an incompletely specified Boolean function. The problem is formulated as a Quantified Boolean Formula (QBF) and is solved by general-purpose QBF solver. We also propose a novel graph structure, called an X-B tree, which implicitly enumerates binary trees. Using this graph structure, the factoring problem is compactly transformed into a QBF and hence the size of solvable problems is extended. Experimental results show that the proposed algorithm successfully finds the exact minimum solutions to the problems with up to l2 literals.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"178","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"173","bibliographicIssueDates":{"bibliographicIssueDate":"2005-11-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"121(2005-SLDM-122)","bibliographicVolumeNumber":"2005"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:57:33.656995+00:00","id":27118,"links":{}}