{"id":"https://openalex.org/W4403582418","doi":"https://doi.org/10.1145/3627673.3679813","title":"Understanding GNNs for Boolean Satisfiability through Approximation Algorithms","display_name":"Understanding GNNs for Boolean Satisfiability through Approximation Algorithms","publication_year":2024,"publication_date":"2024-10-20","ids":{"openalex":"https://openalex.org/W4403582418","doi":"https://doi.org/10.1145/3627673.3679813"},"language":"en","primary_location":{"id":"doi:10.1145/3627673.3679813","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3627673.3679813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","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/A5076891199","display_name":"Jan H\u016fla","orcid":"https://orcid.org/0000-0001-7639-864X"},"institutions":[{"id":"https://openalex.org/I187293425","display_name":"University of Ostrava","ror":"https://ror.org/00pyqav47","country_code":"CZ","type":"education","lineage":["https://openalex.org/I187293425"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan H\u016fla","raw_affiliation_strings":["University of Ostrava, Ostrava, Czech Republic"],"affiliations":[{"raw_affiliation_string":"University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I187293425"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065303754","display_name":"David Moj\u017e\u00ed\u0161ek","orcid":"https://orcid.org/0000-0002-3867-644X"},"institutions":[{"id":"https://openalex.org/I187293425","display_name":"University of Ostrava","ror":"https://ror.org/00pyqav47","country_code":"CZ","type":"education","lineage":["https://openalex.org/I187293425"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"David Moj\u009e\u00ed\u009aek","raw_affiliation_strings":["University of Ostrava, Ostrava, Czech Republic"],"affiliations":[{"raw_affiliation_string":"University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I187293425"]}]},{"author_position":"last","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/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Mikol\u00e1\u009a Janota","raw_affiliation_strings":["Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076891199"],"corresponding_institution_ids":["https://openalex.org/I187293425"],"apc_list":null,"apc_paid":null,"fwci":1.5217,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.8493203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"953","last_page":"961"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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.9990000128746033,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9977999925613403,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9965000152587891,"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/computer-science","display_name":"Computer science","score":0.6786094903945923},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6715786457061768},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6212494373321533},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6139899492263794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5264321565628052},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.42950040102005005},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42324477434158325}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6786094903945923},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6715786457061768},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6212494373321533},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6139899492263794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5264321565628052},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.42950040102005005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42324477434158325}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3627673.3679813","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3627673.3679813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","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":25,"referenced_works":["https://openalex.org/W1540529426","https://openalex.org/W1578123467","https://openalex.org/W1985123706","https://openalex.org/W1987971958","https://openalex.org/W2065706751","https://openalex.org/W2151781750","https://openalex.org/W2621271919","https://openalex.org/W2747329762","https://openalex.org/W2899283552","https://openalex.org/W2997090216","https://openalex.org/W3038228403","https://openalex.org/W3047863327","https://openalex.org/W3105390215","https://openalex.org/W3106214974","https://openalex.org/W3109952702","https://openalex.org/W3128772879","https://openalex.org/W3131262006","https://openalex.org/W3131747507","https://openalex.org/W3140660692","https://openalex.org/W4206232732","https://openalex.org/W4287119796","https://openalex.org/W4287326275","https://openalex.org/W4320516905","https://openalex.org/W6780395004","https://openalex.org/W6790775169"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W4289743389","https://openalex.org/W1913543287","https://openalex.org/W2336941104"],"abstract_inverted_index":{"This":[0,35],"paper":[1],"delves":[2],"into":[3,31],"the":[4,11,21,47,83,87,93,100,107,115,127,130,144],"interpretability":[5],"of":[6,13,24,49,68,95,99,123,138,146],"Graph":[7,101],"Neural":[8,102],"Networks":[9],"in":[10,46,86],"context":[12],"Boolean":[14,50],"Satisfiability.":[15],"The":[16,71],"goal":[17],"is":[18,36,75],"to":[19,41,64,126],"demystify":[20],"internal":[22],"workings":[23],"these":[25,59],"models":[26],"and":[27,54,136],"provide":[28],"insightful":[29],"perspectives":[30],"their":[32],"decision-making":[33],"processes.":[34],"done":[37],"by":[38,118],"uncovering":[39],"connections":[40,60],"two":[42],"approximation":[43],"algorithms":[44],"studied":[45],"domain":[48],"Satisfiability:":[51],"Belief":[52],"Propagation":[53],"Semidefinite":[55],"Programming":[56],"Relaxations.":[57],"Revealing":[58],"has":[61],"empowered":[62],"us":[63],"introduce":[65],"a":[66,76],"suite":[67],"impactful":[69],"enhancements.":[70],"first":[72],"significant":[73],"enhancement":[74],"curriculum":[77],"training":[78,88,116],"procedure,":[79],"which":[80,141],"incrementally":[81],"increases":[82],"problem":[84],"complexity":[85],"set,":[89],"together":[90,109],"with":[91,110],"increasing":[92],"number":[94],"message":[96],"passing":[97],"iterations":[98],"Network.":[103],"We":[104],"show":[105],"that":[106],"curriculum,":[108],"several":[111],"other":[112],"optimizations,":[113],"reduces":[114],"time":[117],"more":[119],"than":[120],"an":[121],"order":[122],"magnitude":[124],"compared":[125],"baseline":[128],"without":[129],"curriculum.":[131],"Furthermore,":[132],"we":[133],"apply":[134],"decimation":[135],"sampling":[137],"initial":[139],"embeddings,":[140],"significantly":[142],"increase":[143],"percentage":[145],"solved":[147],"problems.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}