{"id":"https://openalex.org/W4402172415","doi":"https://doi.org/10.1145/3670474.3685962","title":"MinBLoG: Minimization of Boolean Logic Functions using Graph Attention Network","display_name":"MinBLoG: Minimization of Boolean Logic Functions using Graph Attention Network","publication_year":2024,"publication_date":"2024-09-03","ids":{"openalex":"https://openalex.org/W4402172415","doi":"https://doi.org/10.1145/3670474.3685962"},"language":"en","primary_location":{"id":"doi:10.1145/3670474.3685962","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3670474.3685962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 ACM/IEEE International Symposium on Machine Learning for CAD","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/A5049565039","display_name":"Prianka Sengupta","orcid":"https://orcid.org/0000-0003-0532-9414"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Prianka Sengupta","raw_affiliation_strings":["Texas A&M University, College Station, Texas, USA"],"raw_orcid":"https://orcid.org/0000-0003-0532-9414","affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045346930","display_name":"Aakash Tyagi","orcid":"https://orcid.org/0000-0002-0199-687X"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aakash Tyagi","raw_affiliation_strings":["Texas A&M University, College Station, Texas, USA"],"raw_orcid":"https://orcid.org/0000-0002-9992-7628","affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103246390","display_name":"Jiang Hu","orcid":"https://orcid.org/0000-0003-1157-7799"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiang Hu","raw_affiliation_strings":["Texas A&M University, College Station, Texas, USA"],"raw_orcid":"https://orcid.org/0000-0003-1157-7799","affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026641820","display_name":"Vivek K. Rajan","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vivek K. Rajan","raw_affiliation_strings":["Intel Inc, USA"],"raw_orcid":"https://orcid.org/0009-0001-2520-673X","affiliations":[{"raw_affiliation_string":"Intel Inc, USA","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039707274","display_name":"Hesham Mostafa","orcid":"https://orcid.org/0000-0003-1737-0182"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hesham Mostafa","raw_affiliation_strings":["Intel Inc, USA"],"raw_orcid":"https://orcid.org/0000-0003-1737-0182","affiliations":[{"raw_affiliation_string":"Intel Inc, USA","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070857594","display_name":"Somdeb Majumdar","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Somdeb Majumdar","raw_affiliation_strings":["Intel Inc, USA"],"raw_orcid":"https://orcid.org/0009-0005-4873-4729","affiliations":[{"raw_affiliation_string":"Intel Inc, USA","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5049565039"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.3434,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62694041,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.9991999864578247,"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.9957000017166138,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9954000115394592,"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/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.6974032521247864},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6685420274734497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.658416211605072},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.6451825499534607},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.540972888469696},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5166288018226624},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.48241910338401794},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4643199145793915},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46001574397087097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45193588733673096},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.4202222228050232},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.4199592173099518},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3127380609512329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2694626450538635},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.14618945121765137},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.12627249956130981},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11486363410949707}],"concepts":[{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.6974032521247864},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6685420274734497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.658416211605072},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.6451825499534607},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.540972888469696},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5166288018226624},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.48241910338401794},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4643199145793915},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46001574397087097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45193588733673096},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.4202222228050232},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.4199592173099518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3127380609512329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2694626450538635},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.14618945121765137},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.12627249956130981},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11486363410949707},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3670474.3685962","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3670474.3685962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 ACM/IEEE International Symposium on Machine Learning for CAD","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3784871731","display_name":null,"funder_award_id":"CCF-2106725 and CCF-2212346","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G5721376053","display_name":null,"funder_award_id":"GRC-CADT-3013.001/3014.001","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1776822698","https://openalex.org/W2017256652","https://openalex.org/W2019184769","https://openalex.org/W2030224590","https://openalex.org/W2082448265","https://openalex.org/W2114253705","https://openalex.org/W2124078793","https://openalex.org/W2129183345","https://openalex.org/W2768948804","https://openalex.org/W3109579920","https://openalex.org/W4293261952","https://openalex.org/W4389166639"],"related_works":["https://openalex.org/W1568384982","https://openalex.org/W2234833091","https://openalex.org/W2149693580","https://openalex.org/W1976822807","https://openalex.org/W3141532631","https://openalex.org/W2063425181","https://openalex.org/W1953235205","https://openalex.org/W2131164334","https://openalex.org/W3049502754","https://openalex.org/W2060171268"],"abstract_inverted_index":{"The":[0],"initial":[1],"steps":[2],"of":[3,6,13,38,42,84,107],"logic":[4,15,55],"synthesis":[5],"digital":[7],"designs":[8],"involve":[9],"finding":[10],"minimized":[11,86],"representations":[12],"Boolean":[14,44,68,108],"functions.":[16,69],"Existing":[17],"optimization":[18],"methods":[19],"rely":[20],"on":[21],"iterative":[22],"minimization":[23,56,101],"operations":[24],"that":[25,80,98],"can":[26],"result":[27],"in":[28,32,77],"a":[29,49,82,104],"rapid":[30],"increase":[31],"the":[33,36,43,63,85],"runtime":[34],"when":[35],"number":[37],"variables":[39],"and":[40,88],"terms":[41],"functions":[45,109],"increase.":[46],"We":[47],"propose":[48],"graph":[50],"attention":[51],"network":[52],"(GAT)":[53],"based":[54],"approach":[57,71],"called":[58],"MinBLoG,":[59],"to":[60],"narrow":[61],"down":[62],"solution":[64,87],"search":[65],"space":[66],"for":[67,103],"Our":[70],"achieves":[72],"more":[73],"than":[74,112],"96%":[75],"accuracy":[76],"identifying":[78],"implicants":[79],"are":[81],"part":[83],"ensures":[89],"functional":[90],"equivalency":[91],"through":[92],"correctness":[93],"checking":[94],"procedures.":[95],"Experiments":[96],"show":[97],"MinBLoG":[99],"delivers":[100],"results":[102],"wide":[105],"range":[106],"significantly":[110],"faster":[111],"well-known":[113],"existing":[114],"methods.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}