{"id":"https://openalex.org/W2951543455","doi":"https://doi.org/10.1109/date.2012.6176606","title":"QBf-based boolean function bi-decomposition","display_name":"QBf-based boolean function bi-decomposition","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2951543455","doi":"https://doi.org/10.1109/date.2012.6176606","mag":"2951543455"},"language":"en","primary_location":{"id":"doi:10.1109/date.2012.6176606","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)","raw_type":"proceedings-article"},"type":"preprint","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/A5100444126","display_name":"Huan Chen","orcid":"https://orcid.org/0000-0003-2240-7381"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Huan Chen","raw_affiliation_strings":["University College Dublin, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083748570","display_name":"Mikol\u00e1\u0161 Janota","orcid":"https://orcid.org/0000-0003-3487-784X"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"M. Janota","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002246957","display_name":"Jo\u00e3o Marques\u2010Silva","orcid":"https://orcid.org/0000-0002-6632-3086"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"J. Marques-Silva","raw_affiliation_strings":["University College Dublin, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100444126"],"corresponding_institution_ids":["https://openalex.org/I100930933"],"apc_list":null,"apc_paid":null,"fwci":1.00490626,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79703197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"816","last_page":"819"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/boolean-function","display_name":"Boolean function","score":0.7836203575134277},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6426302790641785},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6273757219314575},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6070150136947632},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5923359394073486},{"id":"https://openalex.org/keywords/functional-decomposition","display_name":"Functional decomposition","score":0.5878975987434387},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.5877882838249207},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5244182348251343},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.48610520362854004},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.48308566212654114},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4829068183898926},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4813005030155182},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4698594808578491},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.4566163420677185},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44668516516685486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44260451197624207},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.43039587140083313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4247048497200012},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.41046595573425293},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.36144310235977173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31360799074172974},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24245673418045044},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.19368788599967957},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.15905991196632385},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13765749335289001}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7836203575134277},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6426302790641785},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6273757219314575},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6070150136947632},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5923359394073486},{"id":"https://openalex.org/C12145135","wikidata":"https://www.wikidata.org/wiki/Q5215396","display_name":"Functional decomposition","level":2,"score":0.5878975987434387},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.5877882838249207},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5244182348251343},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.48610520362854004},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.48308566212654114},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4829068183898926},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4813005030155182},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4698594808578491},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4566163420677185},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44668516516685486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44260451197624207},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.43039587140083313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4247048497200012},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.41046595573425293},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.36144310235977173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31360799074172974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24245673418045044},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.19368788599967957},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.15905991196632385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13765749335289001},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2012.6176606","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320847","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W147950966","https://openalex.org/W1769298637","https://openalex.org/W2003296684","https://openalex.org/W2009058104","https://openalex.org/W2030883814","https://openalex.org/W2069533828","https://openalex.org/W2091359789","https://openalex.org/W2103371236","https://openalex.org/W2108578145","https://openalex.org/W2113408440","https://openalex.org/W2114381689","https://openalex.org/W2116181020","https://openalex.org/W2118615994","https://openalex.org/W2133431298","https://openalex.org/W2151952489","https://openalex.org/W2152680688","https://openalex.org/W2156366819","https://openalex.org/W2165643425","https://openalex.org/W2170003961","https://openalex.org/W2951543455","https://openalex.org/W3144903090","https://openalex.org/W3151610206","https://openalex.org/W4244055867","https://openalex.org/W6626207500","https://openalex.org/W6675025833","https://openalex.org/W6677110078","https://openalex.org/W7055420605"],"related_works":["https://openalex.org/W2131164334","https://openalex.org/W3141532631","https://openalex.org/W2686992952","https://openalex.org/W2986911904","https://openalex.org/W2184010066","https://openalex.org/W4249396218","https://openalex.org/W1568384982","https://openalex.org/W1745650241","https://openalex.org/W2951543455","https://openalex.org/W2014833376"],"abstract_inverted_index":{"Boolean":[0,14,34,70],"function":[1,15],"bi-decomposition":[2,24],"is":[3,46],"ubiquitous":[4],"in":[5,80,101],"logic":[6,19],"synthesis.":[7],"It":[8],"entails":[9],"the":[10,38,41,66,83,87,102,109],"decomposition":[11],"of":[12,40,44,68,82,86,90,104,112],"a":[13],"using":[16],"two-input":[17],"simple":[18],"gates.":[20],"Existing":[21],"solutions":[22,51],"for":[23,54,73],"are":[25,52,78],"often":[26],"based":[27],"on":[28,33,95],"BDDs":[29],"and,":[30],"more":[31],"recently,":[32],"Satisfiability.":[35],"In":[36,58],"addition,":[37],"partition":[39],"input":[42,88],"set":[43,89],"variables":[45],"either":[47],"assumed,":[48],"or":[49],"heuristic":[50],"considered":[53],"finding":[55],"good":[56],"partitions.":[57],"contrast":[59],"to":[60],"earlier":[61],"work,":[62],"this":[63],"paper":[64],"proposes":[65],"use":[67],"Quantified":[69],"Formulas":[71],"(QBF)":[72],"computing":[74],"bi-decompositions.":[75],"These":[76],"bi-decompositions":[77],"optimal":[79],"terms":[81],"achieved":[84],"quality":[85,103],"variables.":[91],"Experimental":[92],"results,":[93],"obtained":[94],"representative":[96],"benchmarks,":[97],"demonstrate":[98],"clear":[99],"improvements":[100],"computed":[105],"decompositions,":[106],"but":[107],"also":[108],"practical":[110],"feasibility":[111],"QBF-based":[113],"bi-decomposition.":[114]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}