{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T18:42:33Z","timestamp":1769280153123,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:00:00Z","timestamp":1725840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Semiconductor Research Corporation","doi-asserted-by":"publisher","award":["GRC-CADT-3013.001\/3014.001"],"award-info":[{"award-number":["GRC-CADT-3013.001\/3014.001"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2106725 and CCF-2212346"],"award-info":[{"award-number":["CCF-2106725 and CCF-2212346"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,9]]},"DOI":"10.1145\/3670474.3685962","type":"proceedings-article","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T06:22:27Z","timestamp":1725344547000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["MinBLoG: Minimization of Boolean Logic Functions using Graph Attention Network"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0532-9414","authenticated-orcid":false,"given":"Prianka","family":"Sengupta","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9992-7628","authenticated-orcid":false,"given":"Aakash","family":"Tyagi","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1157-7799","authenticated-orcid":false,"given":"Jiang","family":"Hu","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2520-673X","authenticated-orcid":false,"given":"Vivek K.","family":"Rajan","sequence":"additional","affiliation":[{"name":"Intel Inc, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1737-0182","authenticated-orcid":false,"given":"Hesham","family":"Mostafa","sequence":"additional","affiliation":[{"name":"Intel Inc, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4873-4729","authenticated-orcid":false,"given":"Somdeb","family":"Majumdar","sequence":"additional","affiliation":[{"name":"Intel Inc, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"e_1_3_2_1_2_1","volume-title":"Hachtel","author":"Brayton Robert King","year":"1984","unstructured":"Robert King Brayton, Alberto L. Sangiovanni-Vincentelli, Curtis T. McMullen, and Gary D. Hachtel. 1984. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, USA."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/136035.136043"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90168-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(94)00007-7"},{"key":"e_1_3_2_1_6_1","volume-title":"Boolformer: Symbolic Regression of Logic Functions with Transformers. arXiv preprint arXiv:2309.12207","author":"Ascoli St\u00e9phane","year":"2023","unstructured":"St\u00e9phane d'Ascoli, Samy Bengio, Josh Susskind, and Emmanuel Abb\u00e9. 2023. Boolformer: Symbolic Regression of Logic Functions with Transformers. arXiv preprint arXiv:2309.12207 (2023)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2006.53"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2009.157"},{"key":"e_1_3_2_1_9_1","volume-title":"SIGN: Scalable Inception Graph Neural Networks. arXiv:2004.11198 [cs.LG]","author":"Frasca Fabrizio","year":"2020","unstructured":"Fabrizio Frasca, Emanuele Rossi, Davide Eynard, Ben Chamberlain, Michael Bronstein, and Federico Monti. 2020. SIGN: Scalable Inception Graph Neural Networks. arXiv:2004.11198 [cs.LG]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.185.0443"},{"key":"e_1_3_2_1_11_1","unstructured":"Jiangbo Huang. 2014. Programing implementation of the Quine-McCluskey method for minimization of Boolean expression. arXiv:1410.1059 [cs.OH]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530497"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323741"},{"key":"e_1_3_2_1_14_1","volume-title":"Synthesis and Optimization of Digital Circuits","author":"Micheli Giovanni De","unstructured":"Giovanni De Micheli. 1994. Synthesis and Optimization of Digital Circuits (1st ed.). McGraw-Hill Higher Education.","edition":"1"},{"key":"e_1_3_2_1_15_1","volume-title":"ABC: A system for sequential synthesis and verification. URL http:\/\/www.eecs.berkeley.edu\/alanmi\/abc 17","author":"Alan Mishchenko","year":"2007","unstructured":"Alan Mishchenko et al. 2007. ABC: A system for sequential synthesis and verification. URL http:\/\/www.eecs.berkeley.edu\/alanmi\/abc 17 (2007)."},{"key":"e_1_3_2_1_16_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. arXiv:1710.10903 [stat.ML]"},{"key":"e_1_3_2_1_17_1","volume-title":"Gamora: Graph Learning based Symbolic Reasoning for Large-Scale Boolean Networks. arXiv preprint arXiv:2303.08256","author":"Wu Nan","year":"2023","unstructured":"Nan Wu, Yingjie Li, Cong Hao, Steve Dai, Cunxi Yu, and Yuan Xie. 2023. Gamora: Graph Learning based Symbolic Reasoning for Large-Scale Boolean Networks. arXiv preprint arXiv:2303.08256 (2023)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2772854"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3380446.3430622"}],"event":{"name":"MLCAD '24: 2024 ACM\/IEEE International Symposium on Machine Learning for CAD","location":"Salt Lake City UT USA","acronym":"MLCAD '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"]},"container-title":["Proceedings of the 2024 ACM\/IEEE International Symposium on Machine Learning for CAD"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670474.3685962","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670474.3685962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T23:43:08Z","timestamp":1755906188000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670474.3685962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,9]]},"references-count":19,"alternative-id":["10.1145\/3670474.3685962","10.1145\/3670474"],"URL":"https:\/\/doi.org\/10.1145\/3670474.3685962","relation":{},"subject":[],"published":{"date-parts":[[2024,9,9]]},"assertion":[{"value":"2024-09-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}