{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:05Z","timestamp":1750221245610,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,24]],"date-time":"2018-06-24T00:00:00Z","timestamp":1529798400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["Majesty"],"award-info":[{"award-number":["Majesty"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["Cybercare"],"award-info":[{"award-number":["Cybercare"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,24]]},"DOI":"10.1145\/3195970.3196111","type":"proceedings-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T13:54:59Z","timestamp":1529416499000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["SAT based exact synthesis using DAG topology families"],"prefix":"10.1145","author":[{"given":"Winston","family":"Haaswijk","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Vaud, Switzerland"}]},{"given":"Alan","family":"Mishchenko","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Vaud, Switzerland"}]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Vaud, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2018,6,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Edmund Clarke Orna Grumberg Somesh Jha Yuan Lu and Helmut Veith. 2000. Counterexample-Guided Abstraction Refinement. Springer Berlin Heidelberg Berlin Heidelberg 154--169.   Edmund Clarke Orna Grumberg Somesh Jha Yuan Lu and Helmut Veith. 2000. Counterexample-Guided Abstraction Refinement. Springer Berlin Heidelberg Berlin Heidelberg 154--169.","DOI":"10.1007\/10722167_15"},{"key":"e_1_3_2_1_3_1","unstructured":"Niklas E\u00e9n. 2007. Practical SAT - a tutorial on applied satisfiability solving. In FMCAD.  Niklas E\u00e9n. 2007. Practical SAT - a tutorial on applied satisfiability solving. In FMCAD ."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Winston Haaswijk Mathias Soeken Luca Amar\u00fa Pierre-Emmanuel Gaillardon and Giovanni De Micheli. 2017. A Novel Basis for Logic Rewriting. In ASPDAC.  Winston Haaswijk Mathias Soeken Luca Amar\u00fa Pierre-Emmanuel Gaillardon and Giovanni De Micheli. 2017. A Novel Basis for Logic Rewriting. In ASPDAC .","DOI":"10.1109\/ASPDAC.2017.7858312"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Winston Haaswijk Eleonora Testa Mathias Soeken and Giovanni De Micheli. 2017. Classifying Functions with Exact Synthesis. In ISMVL.  Winston Haaswijk Eleonora Testa Mathias Soeken and Giovanni De Micheli. 2017. Classifying Functions with Exact Synthesis. In ISMVL .","DOI":"10.1109\/ISMVL.2017.44"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190070"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34188-5_8"},{"key":"e_1_3_2_1_8_1","unstructured":"C.E. Hindenburg. 1779. In Nitinomii Dignitatum Exponentis Indeterminati. Ph.D. Dissertation. University of G\u00fcttingen.  C.E. Hindenburg. 1779. In Nitinomii Dignitatum Exponentis Indeterminati. Ph.D. Dissertation. University of G\u00fcttingen."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Zheng Huang Lingli Wang Yakov Nasikovskiy and Alan Mishchenko. 2013. Fast Boolean matching based on NPN classification. In Int'l Conf. on Field-Programmable Technology. 310--313.  Zheng Huang Lingli Wang Yakov Nasikovskiy and Alan Mishchenko. 2013. Fast Boolean matching based on NPN classification. In Int'l Conf. on Field-Programmable Technology. 310--313.","DOI":"10.1109\/FPT.2013.6718374"},{"key":"e_1_3_2_1_10_1","unstructured":"Donald E. Knuth. 2011. The Art of Computer Programming. Vol. 4A. Addison-Wesley Upper Saddle River New Jersey.   Donald E. Knuth. 2011. The Art of Computer Programming. Vol. 4A. Addison-Wesley Upper Saddle River New Jersey."},{"key":"e_1_3_2_1_11_1","unstructured":"Donald E. Knuth. 2015. The Art of Computer Programming Volume 4 Fascicle 6: Satisfiability. Addison-Wesley Reading Massachusetts.   Donald E. Knuth. 2015. The Art of Computer Programming Volume 4 Fascicle 6: Satisfiability. Addison-Wesley Reading Massachusetts."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.887925"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.62.0227"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Mathias Soeken Luca Amar\u00f9 Pierre-Emmanuel Gaillardon and Giovanni De Micheli. 2017. Exact Synthesis of Majority-Inverter Graphs and Its Applications. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2017).  Mathias Soeken Luca Amar\u00f9 Pierre-Emmanuel Gaillardon and Giovanni De Micheli. 2017. Exact Synthesis of Majority-Inverter Graphs and Its Applications. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2017).","DOI":"10.1109\/TCAD.2017.2664059"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Mathias Soeken Giovanni De Micheli and Alan Mishchenko. 2017. Busy Man's Synthesis: Combinational Delay Optimization With SAT. In Design Automation and Test in Europe.   Mathias Soeken Giovanni De Micheli and Alan Mishchenko. 2017. Busy Man's Synthesis: Combinational Delay Optimization With SAT. In Design Automation and Test in Europe .","DOI":"10.23919\/DATE.2017.7927103"}],"event":{"name":"DAC '18: The 55th Annual Design Automation Conference 2018","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE Council on Electronic Design Automation (CEDA)","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"San Francisco California","acronym":"DAC '18"},"container-title":["Proceedings of the 55th Annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3195970.3196111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3195970.3196111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:40Z","timestamp":1750212460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3195970.3196111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,24]]},"references-count":16,"alternative-id":["10.1145\/3195970.3196111","10.1145\/3195970"],"URL":"https:\/\/doi.org\/10.1145\/3195970.3196111","relation":{},"subject":[],"published":{"date-parts":[[2018,6,24]]},"assertion":[{"value":"2018-06-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}