{"id":"https://openalex.org/W1978045850","doi":"https://doi.org/10.1145/1120725.1120776","title":"Logic optimization using rule-based randomized search","display_name":"Logic optimization using rule-based randomized search","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1978045850","doi":"https://doi.org/10.1145/1120725.1120776","mag":"1978045850"},"language":"en","primary_location":{"id":"doi:10.1145/1120725.1120776","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1120725.1120776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5087255947","display_name":"Petra F\u00e4rm","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Petra F\u00e4rm","raw_affiliation_strings":["Royal Institute of Technology, Kista, Sweden","[Royal Institute of Technology, Kista, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Kista, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"[Royal Institute of Technology, Kista, Sweden]","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011438358","display_name":"Elena Dubrova","orcid":"https://orcid.org/0000-0001-7382-9408"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Elena Dubrova","raw_affiliation_strings":["Royal Institute of Technology, Kista, Sweden","[Royal Institute of Technology, Kista, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Kista, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"[Royal Institute of Technology, Kista, Sweden]","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050442585","display_name":"Andreas Kuehlmann","orcid":null},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]},{"id":"https://openalex.org/I66217453","display_name":"Cadence Design Systems (United States)","ror":"https://ror.org/04w8xa018","country_code":"US","type":"company","lineage":["https://openalex.org/I66217453"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andreas Kuehlmann","raw_affiliation_strings":["Cadence Berkeley Labs, Berkeley, CA","Cadence Berkeley Laboratories, Berkeley CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cadence Berkeley Labs, Berkeley, CA","institution_ids":["https://openalex.org/I148283060","https://openalex.org/I66217453"]},{"raw_affiliation_string":"Cadence Berkeley Laboratories, Berkeley CA","institution_ids":["https://openalex.org/I148283060"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"998","last_page":"998"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991999864578247,"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.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6320324540138245},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6175479888916016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6067671775817871},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5499184727668762},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.452667772769928},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.45256948471069336},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4252660572528839},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.4124058187007904},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3848850727081299},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36025580763816833},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.32683223485946655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24795383214950562}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6320324540138245},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6175479888916016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6067671775817871},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5499184727668762},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.452667772769928},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.45256948471069336},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4252660572528839},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.4124058187007904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3848850727081299},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36025580763816833},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.32683223485946655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24795383214950562},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1120725.1120776","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1120725.1120776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05","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":9,"referenced_works":["https://openalex.org/W64859905","https://openalex.org/W1482949971","https://openalex.org/W1511688816","https://openalex.org/W1607492635","https://openalex.org/W2024060531","https://openalex.org/W2120985183","https://openalex.org/W2140132043","https://openalex.org/W2169837676","https://openalex.org/W2427843410"],"related_works":["https://openalex.org/W1999396918","https://openalex.org/W1552215787","https://openalex.org/W3144289157","https://openalex.org/W3140306724","https://openalex.org/W2140085407","https://openalex.org/W2145294151","https://openalex.org/W2163861263","https://openalex.org/W2146920875","https://openalex.org/W1977290753","https://openalex.org/W2406507501"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,109],"describe":[4],"a":[5,117,123],"new":[6],"logic":[7,27],"synthesis":[8,28],"approach":[9],"based":[10,115],"on":[11,61,116,158],"rule-based":[12],"randomized":[13,111],"search":[14,112,140],"using":[15],"simulated":[16],"annealing.":[17],"Our":[18,155],"work":[19],"is":[20,75,114],"motivated":[21],"by":[22],"two":[23],"observations:":[24],"(1)":[25],"Traditional":[26],"applies":[29],"literal":[30],"count":[31],"as":[32,52,95],"the":[33,38,56,62,89,139,162,166],"primary":[34],"quality":[35],"metric":[36,45],"during":[37],"technology":[39],"independent":[40],"optimization":[41,74,103,134],"phase.":[42],"This":[43],"simplistic":[44],"often":[46],"leads":[47],"to":[48,145],"poor":[49],"circuit":[50,119],"structures":[51],"it":[53],"cannot":[54,81],"foresee":[55],"impact":[57],"of":[58,126,138,165],"early":[59],"choices":[60],"final":[63],"area,":[64,150],"delay,":[65],"power":[66],"consumption,":[67],"etc.":[68],"(2)":[69],"Although":[70],"powerful,":[71],"global":[72],"Boolean":[73,133],"not":[76],"robust":[77],"and":[78,122,132,153],"corresponding":[79],"algorithms":[80],"be":[82,143],"used":[83],"in":[84],"practice":[85],"without":[86],"artificially":[87],"restricting":[88],"application":[90],"window.":[91],"Other":[92],"techniques,":[93],"such":[94],"algebraic":[96,131],"methods":[97],"scale":[98],"well":[99],"but":[100],"provide":[101],"weaker":[102],"power.":[104,154],"To":[105],"address":[106],"both":[107],"problems,":[108],"use":[110],"that":[113,129],"simple":[118],"graph":[120],"representation":[121],"complete":[124],"set":[125],"local":[127],"transformations":[128],"include":[130],"steps.":[135],"The":[136],"objective":[137],"process":[141],"can":[142],"tuned":[144],"complex":[146],"cost":[147],"functions,":[148],"combining":[149],"timing,":[151],"routability,":[152],"experimental":[156],"results":[157],"benchmark":[159],"functions":[160],"demonstrate":[161],"significant":[163],"potential":[164],"presented":[167],"approach.":[168]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}