{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:54:23Z","timestamp":1773248063013,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,5]]},"DOI":"10.1109\/dac18074.2021.9586230","type":"proceedings-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T23:30:34Z","timestamp":1636414234000},"page":"859-864","source":"Crossref","is-referenced-by-count":28,"title":["SLAP: A Supervised Learning Approach for Priority Cuts Technology Mapping"],"prefix":"10.1109","author":[{"given":"Walter Lau","family":"Neto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matheus T.","family":"Moreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Amaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cunxi","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Emmanuel","family":"Gaillardon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8715185"},{"key":"ref12","first-page":"597","article-title":"Lazy man’s logic synthesis","author":"yang","year":"2012","journal-title":"Proc IEEE\/ACM ICCAD"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7927194"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2007.4397290"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.887925"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882484"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/296399.296425"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/43.644605"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415615"},{"key":"ref3","article-title":"Drills: Deep reinforcement learning for logic synthesis","author":"hosny","year":"2019","journal-title":"arXiv preprint arXiv 1911 12945"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3174243.3174268"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.23919\/DATE48585.2020.9116309"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317754"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2943570"},{"key":"ref2","first-page":"50:1","article-title":"Developing synthesis flows without human knowledge","author":"yu","year":"2018","journal-title":"In Proc of the 55th DAC"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942145"},{"key":"ref1","first-page":"530","author":"neto","year":"2021","journal-title":"Read Your Circuit Leveraging Word Embedding to Guide Logic Optimization"},{"key":"ref20","author":"synthesis","year":"2018","journal-title":"ABC A System for Sequential Synthesis and Verification"},{"key":"ref22","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","author":"dai","year":"2017","journal-title":"proc of the 31st NIPS’17"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2016.04.006"},{"key":"ref24","article-title":"The EPFL combinational benchmark suite","author":"amar\u00fa","year":"2015","journal-title":"IWLS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/54.785838"}],"event":{"name":"2021 58th ACM\/IEEE Design Automation Conference (DAC)","location":"San Francisco, CA, USA","start":{"date-parts":[[2021,12,5]]},"end":{"date-parts":[[2021,12,9]]}},"container-title":["2021 58th ACM\/IEEE Design Automation Conference (DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9585997\/9586083\/09586230.pdf?arnumber=9586230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:53Z","timestamp":1652201753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9586230\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,5]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/dac18074.2021.9586230","relation":{},"subject":[],"published":{"date-parts":[[2021,12,5]]}}}