{"id":"https://openalex.org/W4404739940","doi":"https://doi.org/10.1109/isncc62547.2024.10759050","title":"NeuroDual: A Hybrid SAT Solver Combining Graph Attention Networks with Algorithmic Techniques","display_name":"NeuroDual: A Hybrid SAT Solver Combining Graph Attention Networks with Algorithmic Techniques","publication_year":2024,"publication_date":"2024-10-22","ids":{"openalex":"https://openalex.org/W4404739940","doi":"https://doi.org/10.1109/isncc62547.2024.10759050"},"language":"en","primary_location":{"id":"doi:10.1109/isncc62547.2024.10759050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isncc62547.2024.10759050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 International Symposium on Networks, Computers and Communications (ISNCC)","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/A5041181391","display_name":"Mahfuza Farooque","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mahfuza Farooque","raw_affiliation_strings":["The Pennsylvania State University,Department of CSE,PA,16802"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University,Department of CSE,PA,16802","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103153703","display_name":"Matthew R. Walter","orcid":"https://orcid.org/0000-0003-1425-6050"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Walter","raw_affiliation_strings":["The Pennsylvania State University,Department of CSE,PA,16802"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University,Department of CSE,PA,16802","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110881207","display_name":"Aaron Falk","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Falk","raw_affiliation_strings":["The Pennsylvania State University,Department of CSE,PA,16802"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University,Department of CSE,PA,16802","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041181391"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":0.3862,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.69407816,"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":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9751999974250793,"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"}},"topics":[{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9751999974250793,"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"}},{"id":"https://openalex.org/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9670000076293945,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.958899974822998,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7565696239471436},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6306209564208984},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4991614818572998},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46336835622787476},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44091588258743286},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4328482151031494},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1570681631565094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7565696239471436},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6306209564208984},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4991614818572998},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46336835622787476},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44091588258743286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4328482151031494},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1570681631565094}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isncc62547.2024.10759050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isncc62547.2024.10759050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 International Symposium on Networks, Computers and Communications (ISNCC)","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":7,"referenced_works":["https://openalex.org/W1943061272","https://openalex.org/W2147148915","https://openalex.org/W2294430194","https://openalex.org/W2550184597","https://openalex.org/W3126185111","https://openalex.org/W4297493044","https://openalex.org/W4378983659"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W8322802","https://openalex.org/W314331466","https://openalex.org/W2049545441","https://openalex.org/W4386614288","https://openalex.org/W2584195379"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,110],"introduce":[4],"NeuroDual,":[5,109],"a":[6,40,79,131],"hybrid":[7],"Boolean":[8],"satisfiability":[9],"(SAT)":[10],"solver":[11,139],"architecture":[12],"that":[13,93,120,144],"integrates":[14],"Graph":[15],"Attention":[16],"Networks":[17],"(GATs)":[18],"into":[19,127],"the":[20,57,62,71,75,90,98,102,114,135,157,161,168],"Conflict-Driven":[21],"Clause":[22],"Learning":[23],"(CDCL)":[24],"process.":[25],"Unlike":[26],"traditional":[27,150],"SAT":[28,46,91],"solvers":[29],"with":[30,97,149],"fixed":[31],"decision":[32,41,132,158],"heuristics,":[33],"NeuroDual":[34,67],"leverages":[35],"GATs":[36,60],"to":[37,44,68,137,155,163],"dynamically":[38],"learn":[39],"heuristic":[42,133,159],"specific":[43],"each":[45,54],"instance":[47,92],"by":[48],"computing":[49],"an":[50],"assignment":[51],"score":[52],"for":[53,86,170],"variable":[55,87],"in":[56,61,89],"problem.":[58,103],"Also,":[59],"context":[63],"of":[64,74,101,108],"SAT-solving":[65,128,151],"allow":[66],"better":[69],"understand":[70],"spatial":[72],"relations":[73],"dynamic":[76],"features":[77],"within":[78],"CNF":[80],"clause":[81],"and":[82,176],"make":[83],"informed":[84],"predictions":[85],"assignments":[88],"align":[94],"more":[95],"closely":[96],"current":[99],"state":[100],"For":[104],"our":[105],"CDCL":[106,154],"component":[107],"implement":[111],"MINISAT":[112],"as":[113,130],"baseline":[115],"solver.":[116],"Our":[117],"results":[118],"show":[119],"incorporating":[121],"machine":[122,146],"learning":[123,147],"techniques,":[124],"specifically":[125],"GATs,":[126],"algorithms":[129,152],"has":[134,160],"potential":[136,162],"increase":[138],"efficiency.":[140],"These":[141],"findings":[142],"indicate":[143],"integrating":[145],"techniques":[148],"like":[153],"enhance":[156],"drive":[164],"efficiency":[165],"improvements,":[166],"paving":[167],"way":[169],"smarter":[171],"decision-making,":[172],"reduced":[173],"conflict":[174],"occurrences,":[175],"expedited":[177],"problem":[178],"resolution.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-23T23:11:35.936235","created_date":"2025-10-10T00:00:00"}