{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:47:33Z","timestamp":1780444053258,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["96-2221-E-002-278-MY398-2221-E-030-016"],"award-info":[{"award-number":["96-2221-E-002-278-MY398-2221-E-030-016"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1837274.1837398","type":"proceedings-article","created":{"date-parts":[[2010,10,28]],"date-time":"2010-10-28T14:47:40Z","timestamp":1288277260000},"page":"499-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["BooM"],"prefix":"10.1145","author":[{"given":"Chih-Fan","family":"Lai","sequence":"first","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie-Hong R.","family":"Jiang","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuo-Hua","family":"Wang","sequence":"additional","affiliation":[{"name":"Fu Jen Catholic University, Hsinchuang, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391635"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2016547"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923256"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875533"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/264995.264996"},{"key":"e_1_3_2_1_6_1","unstructured":"Berkeley Logic Synthesis and Verification Group. ABC: A system for sequential synthesis and verification. http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/  Berkeley Logic Synthesis and Verification Group. ABC: A system for sequential synthesis and verification . http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/"},{"key":"e_1_3_2_1_7_1","volume-title":"Bericht Nr.","author":"Borchert B.","year":"1995","unstructured":"B. Borchert , D. Ranjan , and F. Stephan . On the computational complexity of some classical equivalence relations on Boolean functions. Forschungsberichte Mathematische Logik, Universit\u00e4t Heidelberg , Bericht Nr. 18, Dec. 1995 . B. Borchert, D. Ranjan, and F. Stephan. On the computational complexity of some classical equivalence relations on Boolean functions. Forschungsberichte Mathematische Logik, Universit\u00e4t Heidelberg, Bericht Nr. 18, Dec. 1995."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.945303"},{"key":"e_1_3_2_1_9_1","unstructured":"DepQBF: http:\/\/fmv.jku.at\/depqbf\/  DepQBF: http:\/\/fmv.jku.at\/depqbf\/"},{"key":"e_1_3_2_1_10_1","first-page":"502","volume-title":"Proc. SAT","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n and N. S\u00f6rensson . An extensible SAT-solver . In Proc. SAT , pp. 502 -- 518 , 2003 . N. E\u00e9n and N. S\u00f6rensson. An extensible SAT-solver. In Proc. SAT, pp. 502--518, 2003."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687546"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/224818.224955"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090100039"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_3_2_1_16_1","first-page":"466","volume-title":"Studies in Constructive Mathematics and Mathematical Logic","author":"Tseitin G.","year":"1970","unstructured":"G. Tseitin . On the complexity of derivation in propositional calculus . Studies in Constructive Mathematics and Mathematical Logic , pp. 466 -- 483 , 1970 . G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, pp. 466--483, 1970."},{"key":"e_1_3_2_1_17_1","first-page":"234","volume-title":"Proc. ICCAD","author":"Wang K.-H.","year":"2007","unstructured":"K.-H. Wang and C.-M. Chan . Incremental learning approach and SAT model for Boolean matching with don't cares . In Proc. ICCAD , pp. 234 -- 239 , 2007 . K.-H. Wang and C.-M. Chan. Incremental learning approach and SAT model for Boolean matching with don't cares. In Proc. ICCAD, pp. 234--239, 2007."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2006.65"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630016"}],"event":{"name":"DAC '10: The 47th Annual Design Automation Conference 2010","location":"Anaheim California","acronym":"DAC '10","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA"]},"container-title":["Proceedings of the 47th Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837274.1837398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1837274.1837398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:35Z","timestamp":1750246775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837274.1837398"}},"subtitle":["a decision procedure for boolean matching with abstraction and dynamic learning"],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":19,"alternative-id":["10.1145\/1837274.1837398","10.1145\/1837274"],"URL":"https:\/\/doi.org\/10.1145\/1837274.1837398","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}