{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:54Z","timestamp":1750307814097,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,4]],"date-time":"2008-05-04T00:00:00Z","timestamp":1209859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,4]]},"DOI":"10.1145\/1366110.1366167","type":"proceedings-article","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T14:37:21Z","timestamp":1210084641000},"page":"225-230","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["SAT-based equivalence checking of threshold logic designs for nanotechnologies"],"prefix":"10.1145","author":[{"given":"Yexin","family":"Zheng","sequence":"first","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael S.","family":"Hsiao","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Huang","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,5,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2003.818327"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1129601.1129656"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.551914"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795678.797348"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/16.277386"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNANO.2006.880889"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.894161"},{"key":"e_1_3_2_1_8_1","first-page":"904","volume-title":"Synthesis and optimization of threshold logic networks with application to nanotechnologies,\" in Proc. Design Automation &amp","author":"Zhang R.","year":"2004","unstructured":"R. Zhang , P. Gupta , L. Zhong , and N. K. Jha , \" Synthesis and optimization of threshold logic networks with application to nanotechnologies,\" in Proc. Design Automation &amp ; Test Europe Conf ., Feb. 2004 , pp. 904 -- 909 . R. Zhang, P. Gupta, L. Zhong, and N. K. Jha, \"Synthesis and optimization of threshold logic networks with application to nanotechnologies,\" in Proc. Design Automation & Test Europe Conf., Feb. 2004, pp. 904--909."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018419.1019651"},{"key":"e_1_3_2_1_10_1","first-page":"578","article-title":"An input weights aware synthesis tool for threshold logic networks,\" in Proc. Wkshp. Circuits, Systems &","author":"Zhang L.","year":"2005","unstructured":"L. Zhang and S. Cotofana , \" An input weights aware synthesis tool for threshold logic networks,\" in Proc. Wkshp. Circuits, Systems & Signal Processing , Nov. 2005 , pp. 578 -- 583 . L. Zhang and S. Cotofana, \"An input weights aware synthesis tool for threshold logic networks,\" in Proc. Wkshp. Circuits, Systems & Signal Processing, Nov. 2005, pp. 578--583.","journal-title":"Signal Processing"},{"key":"e_1_3_2_1_11_1","first-page":"540","volume-title":"Int. Conf. Computer Design","author":"Gupta P.","year":"2004","unstructured":"P. Gupta , R. Zhang , and N. K. Jha , \" An automatic test pattern generation framework for combinational threshold logic networks,\" in Proc . Int. Conf. Computer Design , Oct. 2004 , pp. 540 -- 543 . P. Gupta, R. Zhang, and N. K. Jha, \"An automatic test pattern generation framework for combinational threshold logic networks,\" in Proc. Int. Conf. Computer Design, Oct. 2004, pp. 540--543."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1228784.1228813"},{"key":"e_1_3_2_1_13_1","first-page":"114","volume-title":"Using SAT for combinational equivalence checking,\" in Proc. Design Automation &amp","author":"Goldberg E. I.","year":"2001","unstructured":"E. I. Goldberg , M. R. Prasad , and R. K. Brayton , \" Using SAT for combinational equivalence checking,\" in Proc. Design Automation &amp ; Test Europe Conf ., Mar. 2001 , pp. 114 -- 121 . E. I. Goldberg, M. R. Prasad, and R. K. Brayton, \"Using SAT for combinational equivalence checking,\" in Proc. Design Automation & Test Europe Conf., Mar. 2001, pp. 114--121."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_16_1","first-page":"142","volume-title":"Berkmin: A fast and robust SAT solver,\" in Proc. Design Automation &amp","author":"Goldberg E.","year":"2002","unstructured":"E. Goldberg and Y. Novikov , \" Berkmin: A fast and robust SAT solver,\" in Proc. Design Automation &amp ; Test Europe Conf ., Mar. 2002 , pp. 142 -- 149 . E. Goldberg and Y. Novikov, \"Berkmin: A fast and robust SAT solver,\" in Proc. Design Automation & Test Europe Conf., Mar. 2002, pp. 142--149."},{"key":"e_1_3_2_1_17_1","first-page":"534","volume-title":"Int. Conf. Computer-Aided Design","author":"Brand D.","year":"1993","unstructured":"D. Brand , \"Verification of large synthesized designs,\" in Proc . Int. Conf. Computer-Aided Design , Nov. 1993 , pp. 534 -- 537 . D. Brand, \"Verification of large synthesized designs,\" in Proc. Int. Conf. Computer-Aided Design, Nov. 1993, pp. 534--537."},{"key":"e_1_3_2_1_18_1","volume-title":"Threshold Logic","author":"Sheng C.","year":"1969","unstructured":"C. Sheng , Threshold Logic , Academic Press , New York, NY , 1969 . C. Sheng, Threshold Logic, Academic Press, New York, NY, 1969."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00144-6"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/774572.774638"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190014"},{"key":"e_1_3_2_1_22_1","unstructured":"Berkeley Logic Synthesis & Verification Group ABC: A system for sequential synthesis and verification http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/.  Berkeley Logic Synthesis & Verification Group ABC: A system for sequential synthesis and verification http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.108614"}],"event":{"name":"GLSVLSI08: Great Lakes Symposium on VLSI 2008","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"Orlando Florida USA","acronym":"GLSVLSI08"},"container-title":["Proceedings of the 18th ACM Great Lakes symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366110.1366167","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1366110.1366167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:40Z","timestamp":1750255060000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366110.1366167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,4]]},"references-count":23,"alternative-id":["10.1145\/1366110.1366167","10.1145\/1366110"],"URL":"https:\/\/doi.org\/10.1145\/1366110.1366167","relation":{},"subject":[],"published":{"date-parts":[[2008,5,4]]},"assertion":[{"value":"2008-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}