{"id":"https://openalex.org/W2092333098","doi":"https://doi.org/10.1145/2348839.2348848","title":"The Synthesis of Cyclic Dependencies with Boolean Satisfiability","display_name":"The Synthesis of Cyclic Dependencies with Boolean Satisfiability","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2092333098","doi":"https://doi.org/10.1145/2348839.2348848","mag":"2092333098"},"language":"en","primary_location":{"id":"doi:10.1145/2348839.2348848","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2348839.2348848","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems","raw_type":"journal-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/A5044441669","display_name":"John Backes","orcid":null},"institutions":[{"id":"https://openalex.org/I2800403580","display_name":"University of Minnesota System","ror":"https://ror.org/03grvy078","country_code":"US","type":"education","lineage":["https://openalex.org/I2800403580"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John D. Backes","raw_affiliation_strings":["University of Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota","institution_ids":["https://openalex.org/I2800403580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103212398","display_name":"Marc D. Riedel","orcid":"https://orcid.org/0000-0002-3318-346X"},"institutions":[{"id":"https://openalex.org/I2800403580","display_name":"University of Minnesota System","ror":"https://ror.org/03grvy078","country_code":"US","type":"education","lineage":["https://openalex.org/I2800403580"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marc D. Riedel","raw_affiliation_strings":["University of Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota","institution_ids":["https://openalex.org/I2800403580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2800403580"],"apc_list":null,"apc_paid":null,"fwci":1.36,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81978911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"4","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.757802426815033},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.6907159686088562},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6209412813186646},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5598216652870178},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5562430620193481},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.5507265329360962},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5299369096755981},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.524559736251831},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.49944353103637695},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4913865625858307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48870351910591125},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4824243485927582},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4782799184322357},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3908091187477112},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.328644335269928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20380735397338867},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15663594007492065},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.10930922627449036}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.757802426815033},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.6907159686088562},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6209412813186646},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5598216652870178},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5562430620193481},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.5507265329360962},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5299369096755981},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.524559736251831},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.49944353103637695},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4913865625858307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48870351910591125},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4824243485927582},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4782799184322357},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3908091187477112},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.328644335269928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20380735397338867},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15663594007492065},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.10930922627449036},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2348839.2348848","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2348839.2348848","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G560237629","display_name":null,"funder_award_id":"845650","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W34890220","https://openalex.org/W1485781696","https://openalex.org/W1495106406","https://openalex.org/W1510132912","https://openalex.org/W1510368738","https://openalex.org/W1511688816","https://openalex.org/W1518705996","https://openalex.org/W1519854356","https://openalex.org/W1989912322","https://openalex.org/W1990190087","https://openalex.org/W2010065567","https://openalex.org/W2024223745","https://openalex.org/W2033176194","https://openalex.org/W2035561773","https://openalex.org/W2080137409","https://openalex.org/W2094204687","https://openalex.org/W2106950603","https://openalex.org/W2118551933","https://openalex.org/W2120223433","https://openalex.org/W2125850227","https://openalex.org/W2158748448","https://openalex.org/W2159318488","https://openalex.org/W2160156809","https://openalex.org/W2160444875","https://openalex.org/W2160776998","https://openalex.org/W2560525892","https://openalex.org/W3141112769","https://openalex.org/W6630623413","https://openalex.org/W6631201520","https://openalex.org/W6683271232","https://openalex.org/W6683637129"],"related_works":["https://openalex.org/W1936629927","https://openalex.org/W2234833091","https://openalex.org/W1568384982","https://openalex.org/W2169792446","https://openalex.org/W4248224315","https://openalex.org/W2187008505","https://openalex.org/W3127266383","https://openalex.org/W4360919330","https://openalex.org/W1967845326","https://openalex.org/W2090113622"],"abstract_inverted_index":{"The":[0,81],"accepted":[1],"wisdom":[2],"is":[3,19,83,105],"that":[4,17],"combinational":[5,28],"circuits":[6,47,63,115],"must":[7],"have":[8],"acyclic":[9],"(i.e.,":[10,25],"feed-forward)":[11],"topologies.":[12],"Yet":[13],"simple":[14],"examples":[15],"suggest":[16],"this":[18],"incorrect.":[20],"In":[21],"fact,":[22],"introducing":[23],"cycles":[24],"feedback)":[26],"into":[27],"designs":[29],"can":[30],"lead":[31],"to":[32,84,107],"significant":[33],"savings":[34],"in":[35,38],"area":[36],"and":[37,51,60],"delay.":[39],"Prior":[40],"work":[41],"described":[42],"methodologies":[43],"for":[44,58,77],"synthesizing":[45,78],"cyclic":[46,62,79,86],"with":[48],"Sum-Of-Product":[49],"(SOP)":[50],"Binary-Decision":[52],"Diagram":[53],"(BDD)-based":[54],"formulations.":[55],"Recently,":[56],"techniques":[57],"analyzing":[59],"mapping":[61],"based":[64],"on":[65,113],"Boolean":[66],"satisfiability":[67],"(SAT)":[68],"were":[69],"proposed.":[70],"This":[71],"article":[72],"presents":[73],"a":[74,90,96,102],"SAT-based":[75],"methodology":[76],"dependencies.":[80],"strategy":[82],"generate":[85],"functional":[87,100],"dependencies":[88],"through":[89],"technique":[91],"called":[92],"Craig":[93],"interpolation.":[94],"Given":[95],"choice":[97],"of":[98,119],"different":[99],"dependencies,":[101],"branch-and-bound":[103],"search":[104],"performed":[106],"pick":[108],"the":[109,117,120],"best":[110],"one.":[111],"Experiments":[112],"benchmark":[114],"demonstrate":[116],"effectiveness":[118],"approach.":[121]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}