{"id":"https://openalex.org/W4248224315","doi":"https://doi.org/10.1109/lics.1997.614938","title":"Boolean expression diagrams","display_name":"Boolean expression diagrams","publication_year":2002,"publication_date":"2002-11-22","ids":{"openalex":"https://openalex.org/W4248224315","doi":"https://doi.org/10.1109/lics.1997.614938"},"language":"en","primary_location":{"id":"doi:10.1109/lics.1997.614938","doi":"https://doi.org/10.1109/lics.1997.614938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.1997.614938","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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":null,"display_name":"H.R. Andersen","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"H.R. Andersen","raw_affiliation_strings":["Department of Information Technology, Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014479238","display_name":"Henrik Hulgaard","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"H. Hulgaard","raw_affiliation_strings":["Department of Information Technology, Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":2.1167,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.87545083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"88","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9955999851226807,"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.9955999851226807,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0006000000284984708,"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/T11567","display_name":"semigroups and automata theory","score":0.0005000000237487257,"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/boolean-functions","display_name":"Boolean functions","score":0.8769999742507935},{"id":"https://openalex.org/keywords/binary-decision-diagrams","display_name":"binary decision diagrams","score":0.9070000052452087},{"id":"https://openalex.org/keywords/circuit-verification","display_name":"circuit verification","score":0.5419999957084656},{"id":"https://openalex.org/keywords/redundant-circuits","display_name":"redundant circuits","score":0.5799999833106995},{"id":"https://openalex.org/keywords/iscas85-benchmark-circuits","display_name":"ISCAS85 benchmark circuits","score":0.7429999709129333},{"id":"https://openalex.org/keywords/tautology-checking","display_name":"tautology checking","score":0.9160000085830688}],"concepts":[{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.8531001806259155},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.8269240856170654},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.7391409873962402},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.6976590156555176},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6956969499588013},{"id":"https://openalex.org/C102487863","wikidata":"https://www.wikidata.org/wiki/Q1291626","display_name":"Implicant","level":4,"score":0.5848160982131958},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.5846524238586426},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.578898549079895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5640881657600403},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4716711938381195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46949294209480286},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.46102508902549744},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.44956398010253906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4437442421913147},{"id":"https://openalex.org/C68481662","wikidata":"https://www.wikidata.org/wiki/Q176197","display_name":"Standard Boolean model","level":5,"score":0.4333811402320862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33093518018722534},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.32218602299690247},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.11017173528671265},{"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/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.1997.614938","doi":"https://doi.org/10.1109/lics.1997.614938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.1997.614938","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1968923513","https://openalex.org/W2011039300","https://openalex.org/W2080267935","https://openalex.org/W2095826301","https://openalex.org/W2113251992","https://openalex.org/W2127271657","https://openalex.org/W2138273756","https://openalex.org/W2138838211","https://openalex.org/W2144491553","https://openalex.org/W2147897801","https://openalex.org/W2162199822","https://openalex.org/W2490836007","https://openalex.org/W2752885492","https://openalex.org/W3161092854","https://openalex.org/W4229995174","https://openalex.org/W4242115155","https://openalex.org/W4243399171","https://openalex.org/W4243823432","https://openalex.org/W4246239274","https://openalex.org/W4250447890","https://openalex.org/W4251370346","https://openalex.org/W4252439377"],"related_works":["https://openalex.org/W2601332782","https://openalex.org/W4234339665","https://openalex.org/W7100528845","https://openalex.org/W2168974500","https://openalex.org/W2295716705","https://openalex.org/W2152131370","https://openalex.org/W6980653914","https://openalex.org/W2112525359","https://openalex.org/W2159673615","https://openalex.org/W2362219289"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,20,52,55,130,150],"new":[4],"data":[5],"structure":[6],"called":[7],"Boolean":[8,16,31,75,118],"Expression":[9],"Diagrams":[10,25],"(BEDs)":[11],"for":[12,50,156,158],"representing":[13],"and":[14,36,90,113],"manipulating":[15],"functions.":[17,119],"BEDs":[18,141],"are":[19,48,99,142],"generalization":[21],"of":[22,40,44,73,79,93],"Binary":[23],"Decision":[24],"(BDDs)":[26],"which":[27],"can":[28,68],"represent":[29],"any":[30],"circuit":[32],"in":[33,127,144],"linear":[34],"space":[35],"still":[37],"maintain":[38],"many":[39],"the":[41,62,66,70,74,80,88,94,107,116,147],"desirable":[42],"properties":[43],"BDDs.":[45],"Two":[46],"algorithms":[47],"described":[49],"transforming":[51],"BED":[53,81],"into":[54],"reduced":[56,151],"ordered":[57,152],"BDD.":[58],"One":[59],"closely":[60],"mimics":[61],"BDD":[63,135,153],"apply-operator":[64],"while":[65,132],"other":[67],"exploit":[69],"structural":[71],"information":[72],"expression.":[76],"The":[77],"efficacy":[78],"representation":[82],"is":[83,104,125,139,154],"demonstrated":[84],"by":[85],"verifying":[86],"that":[87,106],"redundant":[89],"non-redundant":[91],"versions":[92],"ISCAS":[95],"85":[96],"benchmark":[97],"circuits":[98,111],"identical.":[100],"In":[101],"particular,":[102],"it":[103],"verified":[105],"two":[108],"16-bit":[109],"multiplication":[110],"(c6288":[112],"c6288nr)":[114],"implement":[115],"same":[117],"Using":[120],"BEDs,":[121],"this":[122,137],"verification":[123],"problem":[124,138],"solved":[126],"less":[128],"than":[129],"second,":[131],"using":[133],"standard":[134],"techniques":[136],"infeasible.":[140],"useful":[143],"applications":[145],"where":[146],"end-result":[148],"as":[149],"small,":[155],"example":[157],"tautology":[159],"checking.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2022-05-12T00:00:00"}