{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:23:45Z","timestamp":1769271825076,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1145\/3716368.3735251","type":"proceedings-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T14:00:26Z","timestamp":1751032826000},"page":"886-892","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Enhancing Modern SAT Solver With Machine Learning Method"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1041-3098","authenticated-orcid":false,"given":"Guanting","family":"Chen","sequence":"first","affiliation":[{"name":"Illinois Institute of Technology, Chicago, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6159-6085","authenticated-orcid":false,"given":"Jia","family":"Wang","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology, Chicago, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"e_1_3_3_1_2_2","volume-title":"SATLIB \u2013 The Satisfiability Library","year":"2011","unstructured":"2011. SATLIB \u2013 The Satisfiability Library. Retrieved Jan. 5, 2011 from https:\/\/www.cs.ubc.ca\/\u00a0hoos\/SATLIB\/index-ubc.html"},{"key":"e_1_3_3_1_3_2","volume-title":"CNFgen: Combinatorial Benchmarks for SAT Solvers","year":"2017","unstructured":"2017. CNFgen: Combinatorial Benchmarks for SAT Solvers. https:\/\/massimolauria.net\/cnfgen\/"},{"key":"e_1_3_3_1_4_2","volume-title":"SAT Competition 2022","year":"2022","unstructured":"2022. SAT Competition 2022. Retrieved May 27, 2022 from https:\/\/satcompetition.github.io\/2022\/"},{"key":"e_1_3_3_1_5_2","volume-title":"SAT Competition 2023","year":"2023","unstructured":"2023. SAT Competition 2023. Retrieved Sept 27, 2023 from https:\/\/satcompetition.github.io\/2023\/"},{"key":"e_1_3_3_1_6_2","volume-title":"The International SAT Competition Web Page","year":"2025","unstructured":"2025. The International SAT Competition Web Page. https:\/\/satcompetition.github.io\/"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Tasniem Al-Yahya Mohamed El Bachir\u00a0Abdelkrim Menai and Hassan Mathkour.2022. Boosting the Performance of CDCL-based SAT Solvers by Exploiting Backbones and Backdoors. Algorithms (2022).","DOI":"10.3390\/a15090302"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Gilles Audemard and Laurent Simon. 2018. On the Glucose SAT Solver. International Journal on Artificial Intelligence Tools (IJAIT) 27 1 (2018) 1\u201325.","DOI":"10.1142\/S0218213018400018"},{"key":"e_1_3_3_1_9_2","first-page":"3:1\u20133:12","volume-title":"International Conference on Theory and Applications of Satisfiability Testing (SAT)","author":"Biere Armin","year":"2023","unstructured":"Armin Biere, Nils Froleyks, and Wenxi Wang. 2023. CadiBack: Extracting Backbones with CaDiCal. In International Conference on Theory and Applications of Satisfiability Testing (SAT). 3:1\u20133:12."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_3_1_11_2","first-page":"502","volume-title":"International Conference on Theory and Applications of Satisfiability Testing (SAT)","author":"E\u00e9n Niklas","year":"2003","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An Extensible SAT-solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT). 502\u2013518."},{"key":"e_1_3_3_1_12_2","unstructured":"Jesse\u00a0Michael Han. 2020. Enhancing SAT Solvers with Glue Variable Predictions. arxiv:https:\/\/arXiv.org\/abs\/2007.02559"},{"key":"e_1_3_3_1_13_2","unstructured":"Vitaly Kurin Saad Godil Shimon Whiteson and Bryan Catanzaro. 2019. Improving SAT Solver Heuristics with Graph Networks and Reinforcement Learning. (2019)."},{"key":"e_1_3_3_1_14_2","first-page":"9608 \u2013 9621","volume-title":"International Conference on Neural Information Processing Systems","author":"Kurin Vitaly","year":"2020","unstructured":"Vitaly Kurin, Saad Godil, Shimon Whiteson, and Bryan Catanzaro. 2020. Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?. In International Conference on Neural Information Processing Systems. 9608 \u2013 9621."},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599837"},{"key":"e_1_3_3_1_16_2","first-page":"537","volume-title":"International Conference on Neural Information Processing Systems","author":"Li Zhuwen","year":"2018","unstructured":"Zhuwen Li, Qifeng Chen, and Vladlen Koltun. 2018. Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search. In International Conference on Neural Information Processing Systems. 537\u2013546."},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Tsung-Yi Lin Priya Goyal Ross Girshick Kaiming He and Piotr Dollar.2020. Focal Loss for Dense Object Detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 42 2 (2020) 318\u2013327.","DOI":"10.1109\/TPAMI.2018.2858826"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Joao Marques-Silva In\u00eas Lynce and Sharad Malik. 2021. Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability: Second Edition (2021) 133\u2013182.","DOI":"10.3233\/FAIA200987"},{"key":"e_1_3_3_1_19_2","unstructured":"Daniel Selsam and Nikolaj Bj\u00f8rner. 2018. Learning a SAT Solver from Single-Bit Supervision. arxiv:https:\/\/arXiv.org\/abs\/1802.03685"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24258-9_24"},{"key":"e_1_3_3_1_21_2","unstructured":"Wenxi Wang Yang Hu Mohit Tiwari Sarfraz Khurshid Kenneth McMillan and Risto Miikkulainen. 2021. NeuroBack: Improving CDCL SAT Solving Using Graph Neural Networks. arxiv:https:\/\/arXiv.org\/abs\/2110.14053"},{"key":"e_1_3_3_1_22_2","unstructured":"Weihuang Wen and Tianshu Yu. 2023. W2SAT: Learning to Generate SAT Instances from Weighted Literal Incidence Graphs. arxiv:https:\/\/arXiv.org\/abs\/2302.00272"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_31"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/164"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Jie Zhou Ganqu Cui Shengding Hu Zhengyan Zhang Cheng Yang Zhiyuan Liu Lifeng Wang Changcheng Li and Maosong Sun. 2020. Graph Neural Networks: A Review of Methods and Applications. AI Open (2020) 57\u201381.","DOI":"10.1016\/j.aiopen.2021.01.001"}],"event":{"name":"GLSVLSI '25: Great Lakes Symposium on VLSI 2025","location":"New Orleans LA USA","acronym":"GLSVLSI '25","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2025"],"original-title":[],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T14:38:15Z","timestamp":1751035095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3716368.3735251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,29]]},"references-count":24,"alternative-id":["10.1145\/3716368.3735251","10.1145\/3716368"],"URL":"https:\/\/doi.org\/10.1145\/3716368.3735251","relation":{},"subject":[],"published":{"date-parts":[[2025,6,29]]},"assertion":[{"value":"2025-06-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}