{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:02:47Z","timestamp":1755907367672,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T00:00:00Z","timestamp":1718150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Key R&D Program of China","award":["2022YFB4500500"],"award-info":[{"award-number":["2022YFB4500500"]}]},{"name":"the National Natural Science Foundation of China","award":["62090021"],"award-info":[{"award-number":["62090021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,12]]},"DOI":"10.1145\/3649476.3658739","type":"proceedings-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T12:29:41Z","timestamp":1718022581000},"page":"158-163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Incremental SAT-based Exact Synthesis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0949-4222","authenticated-orcid":false,"given":"Sunan","family":"Zou","sequence":"first","affiliation":[{"name":"School of Computer Science, Peking University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6599-6142","authenticated-orcid":false,"given":"Jiaxi","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4932-3655","authenticated-orcid":false,"given":"Guojie","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Luca Amar\u00fa Pierre-Emmanuel Gaillardon 2015. The EPFL combinational benchmark suite. In IWLS."},{"key":"e_1_3_2_1_2_1","unstructured":"Alessandro\u00a0Tempia Calvino Heinz Riener 2022. A versatile mapping approach for technology mapping and graph optimization. In ASP-DAC."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Katalin Fazekas Armin Biere 2019. Incremental inprocessing in SAT solving. In SAT.","DOI":"10.1007\/978-3-030-24258-9_9"},{"key":"e_1_3_2_1_4_1","volume-title":"Theory and Application of Topology-based Exact Synthesis for Majority-Inverter Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","author":"Ge Xianliang","year":"2023","unstructured":"Xianliang Ge and Shinji Kimura. 2023. Theory and Application of Topology-based Exact Synthesis for Majority-Inverter Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2023)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Winston Haaswijk Mathias Soeken 2017. A novel basis for logic rewriting. In ASP-DAC.","DOI":"10.1109\/ASPDAC.2017.7858312"},{"key":"e_1_3_2_1_6_1","volume-title":"SAT-based exact synthesis: Encodings, topology families, and parallelism","author":"Haaswijk Winston","year":"2019","unstructured":"Winston Haaswijk, Mathias Soeken, 2019. SAT-based exact synthesis: Encodings, topology families, and parallelism. IEEE Trans. on CAD of Integrated Circuits Systems (TCAD) (2019)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Winston Haaswijk Eleonora Testa 2017. Classifying functions with exact synthesis. In ISMVL.","DOI":"10.1109\/ISMVL.2017.44"},{"key":"e_1_3_2_1_8_1","unstructured":"Donald\u00a0E Knuth. 2022. The Art of Computer Programming Volume 4B: Combinatorial Algorithms. Addison-Wesley Professional."},{"key":"e_1_3_2_1_9_1","unstructured":"Alan Mishchenko. 2014. Enumeration of irredundant circuit structures. In IWLS."},{"key":"e_1_3_2_1_10_1","unstructured":"Alan Mishchenko 2007. ABC: A system for sequential synthesis and verification. In URL http:\/\/www.eecs.berkeley.edu\/alanmi\/abc."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Alan Mishchenko Satrajit Chatterjee 2006. DAG-aware AIG rewriting: A fresh look at combinational logic synthesis. In DAC.","DOI":"10.1109\/DAC.2006.229287"},{"volume-title":"Exact Synthesis Based on Semi-Tensor Product Circuit Solver","author":"Hongyang Pan","key":"e_1_3_2_1_12_1","unstructured":"Hongyang Pan 2023. Exact Synthesis Based on Semi-Tensor Product Circuit Solver. In DATE. IEEE."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Heinz Riener Winston Haaswijk 2019. On-the-fly and DAG-aware: Rewriting Boolean networks with exact synthesis. In DATE.","DOI":"10.23919\/DATE.2019.8715185"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2664059"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Mathias Soeken Giovanni De\u00a0Micheli 2017. Busy man\u2019s synthesis: Combinational delay optimization with SAT. In DATE.","DOI":"10.23919\/DATE.2017.7927103"},{"volume-title":"SAT, Vol.\u00a05584","author":"Soos Mate","key":"e_1_3_2_1_16_1","unstructured":"Mate Soos, Karsten Nohl, 2009. Extending SAT Solvers to Cryptographic Problems. In SAT, Vol.\u00a05584. Springer."},{"key":"e_1_3_2_1_17_1","volume-title":"BESWAC: Boosting Exact Synthesis via Wiser SAT Solver Call. In DATE.","author":"Sunan Zou","year":"2024","unstructured":"Zou Sunan, Zhang Jiaxi, 2024. BESWAC: Boosting Exact Synthesis via Wiser SAT Solver Call. In DATE."},{"key":"e_1_3_2_1_18_1","unstructured":"E. Testa M. Soeken 2017. Exact Synthesis for Logic Synthesis Applications with Complex Constraints. In IWLS."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Weihua Xiao Shanshan Han 2023. MiniTNtk: An Exact Synthesis-based Method for Minimizing Transistor Network. In ICCAD.","DOI":"10.1109\/ICCAD57390.2023.10323691"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Jiaxi Zhang Shenggen Zheng 2023. Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions. In DATE.","DOI":"10.23919\/DATE56975.2023.10136889"}],"event":{"name":"GLSVLSI '24: Great Lakes Symposium on VLSI 2024","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Clearwater FL USA","acronym":"GLSVLSI '24"},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649476.3658739","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649476.3658739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T02:31:38Z","timestamp":1755829898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649476.3658739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,12]]},"references-count":20,"alternative-id":["10.1145\/3649476.3658739","10.1145\/3649476"],"URL":"https:\/\/doi.org\/10.1145\/3649476.3658739","relation":{},"subject":[],"published":{"date-parts":[[2024,6,12]]},"assertion":[{"value":"2024-06-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}