{"id":"https://openalex.org/W4200239775","doi":"https://doi.org/10.1109/iccad51958.2021.9643530","title":"RL-Guided Runtime-Constrained Heuristic Exploration for Logic Synthesis","display_name":"RL-Guided Runtime-Constrained Heuristic Exploration for Logic Synthesis","publication_year":2021,"publication_date":"2021-11-01","ids":{"openalex":"https://openalex.org/W4200239775","doi":"https://doi.org/10.1109/iccad51958.2021.9643530"},"language":"en","primary_location":{"id":"doi:10.1109/iccad51958.2021.9643530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad51958.2021.9643530","pdf_url":null,"source":{"id":"https://openalex.org/S4363608354","display_name":"2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059067135","display_name":"Yasasvi V. Peruvemba","orcid":null},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Yasasvi V. Peruvemba","raw_affiliation_strings":["Computer Science and Engineering, IIT Indore,India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, IIT Indore,India","institution_ids":["https://openalex.org/I64295750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075349265","display_name":"Shubham Rai","orcid":"https://orcid.org/0000-0002-6522-5628"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Shubham Rai","raw_affiliation_strings":["Chair of Processor Design, TU Dresden,Germany"],"affiliations":[{"raw_affiliation_string":"Chair of Processor Design, TU Dresden,Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068503569","display_name":"Kapil Ahuja","orcid":"https://orcid.org/0000-0001-9640-4437"},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kapil Ahuja","raw_affiliation_strings":["Computer Science and Engineering, IIT Indore,India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, IIT Indore,India","institution_ids":["https://openalex.org/I64295750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100755285","display_name":"Akash Kumar","orcid":"https://orcid.org/0000-0001-7125-1737"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Akash Kumar","raw_affiliation_strings":["Chair of Processor Design, TU Dresden,Germany"],"affiliations":[{"raw_affiliation_string":"Chair of Processor Design, TU Dresden,Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059067135"],"corresponding_institution_ids":["https://openalex.org/I64295750"],"apc_list":null,"apc_paid":null,"fwci":7.3566,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.98803595,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7443497776985168},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7192035913467407},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5669904351234436},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5429035425186157},{"id":"https://openalex.org/keywords/scripting-language","display_name":"Scripting language","score":0.4736320376396179},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.46321186423301697},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41582220792770386},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3917083740234375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30992454290390015},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2007744312286377},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18743836879730225}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7443497776985168},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7192035913467407},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5669904351234436},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5429035425186157},{"id":"https://openalex.org/C61423126","wikidata":"https://www.wikidata.org/wiki/Q187432","display_name":"Scripting language","level":2,"score":0.4736320376396179},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.46321186423301697},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41582220792770386},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3917083740234375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30992454290390015},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2007744312286377},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18743836879730225},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad51958.2021.9643530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad51958.2021.9643530","pdf_url":null,"source":{"id":"https://openalex.org/S4363608354","display_name":"2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1528837436","https://openalex.org/W1776822698","https://openalex.org/W1993932586","https://openalex.org/W2100465945","https://openalex.org/W2129183345","https://openalex.org/W2140975144","https://openalex.org/W2155027007","https://openalex.org/W2242458479","https://openalex.org/W2786101043","https://openalex.org/W2794046273","https://openalex.org/W2797469317","https://openalex.org/W2944997892","https://openalex.org/W2946189651","https://openalex.org/W2964015378","https://openalex.org/W2964321699","https://openalex.org/W3013938122","https://openalex.org/W3036425636","https://openalex.org/W3080555959","https://openalex.org/W3109579920","https://openalex.org/W4214717370","https://openalex.org/W4295312788","https://openalex.org/W4299487805","https://openalex.org/W6631725144","https://openalex.org/W6683204974","https://openalex.org/W6720006811","https://openalex.org/W6726873649","https://openalex.org/W6750384299","https://openalex.org/W6766978945"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W2041180560"],"abstract_inverted_index":{"Within":[0,104],"logic":[1,34,101,205],"synthesis,":[2],"most":[3],"optimization":[4,22,142],"scripts":[5,19,97,161,211],"are":[6,25],"well-defined":[7,58],"heuristics":[8,74],"that":[9,81,148,168],"generalize":[10],"over":[11,32,64,183],"a":[12,29,33,77,86,109,118,198],"variety":[13],"of":[14,37,44,67,121,136,139,162,176],"Boolean":[15,38,79],"circuits.":[16,68],"These":[17,54],"heuristic-based":[18,160],"comprise":[20],"various":[21],"algorithms":[23],"which":[24,92],"applied":[26],"sequentially":[27],"in":[28,41,114,181],"specific":[30,75],"order":[31,70,115],"graph":[35,110],"representation":[36],"circuits":[39],"(typically":[40],"the":[42,122,152,158,184,192,201],"form":[43],"And":[45],"Inverter":[46,51],"Graphs":[47,52],"(AIGs)":[48],"or":[49],"Majority":[50],"(MIGs)).":[53],"heuristics,":[55],"despite":[56],"being":[57],"generalizations,":[59],"may":[60],"not":[61],"perform":[62,117],"well":[63],"all":[65],"kinds":[66],"In":[69],"to":[71,76,95,98,116,173,191],"develop":[72,197],"custom":[73,210],"particular":[78],"circuit":[80],"performs":[82],"well,":[83],"we":[84,107,131,196],"propose":[85],"runtime-constrained":[87],"reinforcement":[88],"learning":[89],"(RL)":[90],"approach":[91],"is":[93],"able":[94],"generate":[96,209],"carry":[99,126],"out":[100,127],"synthesis":[102,206],"flows.":[103],"our":[105,149,169,213],"approach,":[106],"incorporate":[108],"convolution":[111],"network":[112],"(GCN)":[113],"holistic":[119],"exploration":[120],"search":[123],"space.":[124],"To":[125],"an":[128,174],"extensive":[129],"evaluation,":[130],"identify":[132],"three":[133],"different":[134,140],"classes":[135],"environments":[137],"consisting":[138],"baseline":[141],"sequences.":[143],"The":[144],"experimental":[145],"results":[146],"reveal":[147],"model":[150],"outperforms":[151],"prevalent":[153],"state-of-the-art":[154],"work":[155],"[24]":[156],"and":[157,208],"best":[159],"Berkeley-ABC":[163,193],"[4].":[164],"Our":[165],"evaluations":[166],"show":[167],"framework":[170,199],"provides":[171],"up":[172],"average":[175],"8.3":[177],"%":[178],"further":[179],"reduction":[180],"level":[182],"EPFL":[185,202],"Benchmark":[186],"Suite":[187],"[8]":[188],"as":[189],"compared":[190],"scripts.":[194],"Further,":[195],"for":[200],"mockturtle":[203],"[20]":[204],"libraries":[207],"using":[212],"RL-based":[214],"approach.":[215]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}