{"id":"https://openalex.org/W4412508366","doi":"https://doi.org/10.1609/socs.v18i1.35997","title":"Multi-armed Bandit Algorithms for the Boolean Satisfiability Problem: A Survey","display_name":"Multi-armed Bandit Algorithms for the Boolean Satisfiability Problem: A Survey","publication_year":2025,"publication_date":"2025-07-19","ids":{"openalex":"https://openalex.org/W4412508366","doi":"https://doi.org/10.1609/socs.v18i1.35997"},"language":"en","primary_location":{"id":"doi:10.1609/socs.v18i1.35997","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.35997","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35997/38152","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35997/38152","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Zhihui Xie","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhihui Xie","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100331710","display_name":"Xu Liu","orcid":"https://orcid.org/0000-0002-8780-5455"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xu Liu","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100424064","display_name":"Shuai Li","orcid":"https://orcid.org/0000-0001-8316-5289"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuai Li","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19700722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"221","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9904000163078308,"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/T12288","display_name":"Optimization and Search Problems","score":0.9606999754905701,"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/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.7371326684951782},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6961851119995117},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6234196424484253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.563912034034729},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5202339887619019},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3812920153141022},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3010106086730957}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.7371326684951782},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6961851119995117},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6234196424484253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.563912034034729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5202339887619019},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3812920153141022},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3010106086730957}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/socs.v18i1.35997","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.35997","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35997/38152","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/socs.v18i1.35997","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.35997","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35997/38152","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412508366.pdf","grobid_xml":"https://content.openalex.org/works/W4412508366.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W78552530","https://openalex.org/W128869332","https://openalex.org/W159288436","https://openalex.org/W1526260260","https://openalex.org/W1608123432","https://openalex.org/W2031525781","https://openalex.org/W2044560939","https://openalex.org/W2111224220","https://openalex.org/W2125024536","https://openalex.org/W2126405658","https://openalex.org/W2165713838","https://openalex.org/W2182361439","https://openalex.org/W2182702718","https://openalex.org/W2241433912","https://openalex.org/W2443586331","https://openalex.org/W2498324117","https://openalex.org/W2556522401","https://openalex.org/W2564001612","https://openalex.org/W2810313326","https://openalex.org/W2914335417","https://openalex.org/W3035393658","https://openalex.org/W3172354879","https://openalex.org/W4283220697","https://openalex.org/W6600159046","https://openalex.org/W6629587324","https://openalex.org/W6659573362","https://openalex.org/W6664827099","https://openalex.org/W6674197599","https://openalex.org/W6681933737","https://openalex.org/W6762078841","https://openalex.org/W6763587142","https://openalex.org/W6772063757","https://openalex.org/W6806471512","https://openalex.org/W6814292443","https://openalex.org/W7075680496"],"related_works":["https://openalex.org/W2394616262","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W4289743389","https://openalex.org/W1913543287","https://openalex.org/W2336941104","https://openalex.org/W3120153087","https://openalex.org/W2883069340","https://openalex.org/W2996462315"],"abstract_inverted_index":{"This":[0],"paper":[1],"provides":[2],"a":[3,22,73],"survey":[4],"of":[5,11,35,55,97,100,124,136],"recent":[6,47],"literature":[7],"on":[8],"the":[9,17,52,98,137,141],"use":[10,123],"multi-armed":[12],"bandit":[13,36,59,101,125],"algorithms":[14,37,60,65,70,102,126],"to":[15,116],"solve":[16],"Boolean":[18],"satisfiability":[19],"problem":[20,25],"(SAT),":[21],"well-known":[23],"NP-complete":[24],"with":[26],"broad":[27],"applications":[28],"in":[29,38,46,61,82,87,103,111,118,127],"academia":[30],"and":[31,77,79,84,113,144],"industry.":[32],"The":[33,122],"application":[34,99],"modern":[39,104],"SAT":[40,56,62,88,105,120,128],"solvers":[41,57,115,129],"has":[42],"achieved":[43],"great":[44,132],"success":[45],"years,":[48],"as":[49],"evidenced":[50],"by":[51],"excellent":[53],"performance":[54],"using":[58],"competitions.":[63],"Bandit":[64],"are":[66],"classic":[67],"randomized":[68],"optimization":[69],"that":[71],"strike":[72],"balance":[74],"between":[75],"exploration":[76],"exploitation":[78],"can":[80],"aid":[81],"designing":[83],"improving":[85],"heuristics":[86],"solvers.":[89,121],"In":[90,134],"this":[91],"paper,":[92],"we":[93,139],"introduce":[94],"several":[95],"aspects":[96],"solvers,":[106],"ranging":[107],"from":[108],"heuristic":[109],"methods":[110],"CDCL":[112],"SLS":[114],"strategies":[117],"parallel":[119],"still":[130],"holds":[131],"potential.":[133],"conclusion":[135],"survey,":[138],"summarize":[140],"current":[142],"issues":[143],"suggest":[145],"possible":[146],"future":[147],"research":[148],"directions.":[149]},"counts_by_year":[],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}