{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:13:16Z","timestamp":1773843196790,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3656250","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["NeuroSelect: Learning to Select Clauses in SAT Solvers"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7291-3712","authenticated-orcid":false,"given":"Hongduo","family":"Liu","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5756-3494","authenticated-orcid":false,"given":"Peng","family":"Xu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1322-5642","authenticated-orcid":false,"given":"Yuan","family":"Pu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, Hong Kong, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8237-377X","authenticated-orcid":false,"given":"Lihao","family":"Yin","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Hong Kong, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0310-3825","authenticated-orcid":false,"given":"Hui-Ling","family":"Zhen","sequence":"additional","affiliation":[{"name":"Huawei, Hong Kong, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2236-8784","authenticated-orcid":false,"given":"Mingxuan","family":"Yuan","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Hong Kong, NA, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7348-5625","authenticated-orcid":false,"given":"Tsung-Yi","family":"Ho","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6406-4810","authenticated-orcid":false,"given":"Bei","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, N\/A, Hong Kong Special Administrative Region of China"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"STOC","author":"S.","year":"1971","unstructured":"S. COOK, \"The complexity of theorem proving procedure,\" in Proc. STOC, 1971."},{"key":"e_1_3_2_1_2_1","volume-title":"Learning clause deletion heuristics with reinforcement learning,\" in AITP","author":"Vaezipoor P.","year":"2020","unstructured":"P. Vaezipoor, G. Lederman, Y. Wu, R. Grosse, and F. Bacchus, \"Learning clause deletion heuristics with reinforcement learning,\" in AITP, 2020."},{"key":"e_1_3_2_1_3_1","volume-title":"Graph neural networks and boolean satisfiability,\" arXiv preprint arXiv:1702.03592","author":"B\u00fcnz B.","year":"2017","unstructured":"B. B\u00fcnz and M. Lamm, \"Graph neural networks and boolean satisfiability,\" arXiv preprint arXiv:1702.03592, 2017."},{"key":"e_1_3_2_1_4_1","volume-title":"ICLR","author":"Selsam D.","year":"2018","unstructured":"D. Selsam, M. Lamm, B. Benedikt, P. Liang, L. de Moura, D. L. Dill et al., \"Learning a SAT solver from single-bit supervision,\" in Proc. ICLR, 2018."},{"key":"e_1_3_2_1_5_1","volume-title":"SAT","author":"Selsam D.","year":"2019","unstructured":"D. Selsam and N. Bj\u00f8rner, \"Guiding high-performance SAT solvers with unsat-core predictions,\" in Proc. SAT, 2019."},{"key":"e_1_3_2_1_6_1","first-page":"9608","volume-title":"NIPS","volume":"33","author":"Kurin V.","year":"2020","unstructured":"V. Kurin, S. Godil, S. Whiteson, and B. Catanzaro, \"Can Q-learning with graph networks learn a generalizable branching heuristic for a sat solver?\" Proc. NIPS, vol. 33, pp. 9608--9621, 2020."},{"key":"e_1_3_2_1_7_1","volume-title":"Nlocalsat: Boosting local search with solution prediction,\" arXiv preprint arXiv:2001.09398","author":"Zhang W.","year":"2020","unstructured":"W. Zhang, Z. Sun, Q. Zhu, G. Li, S. Cai, Y. Xiong, and L. Zhang, \"Nlocalsat: Boosting local search with solution prediction,\" arXiv preprint arXiv:2001.09398, 2020."},{"key":"e_1_3_2_1_8_1","unstructured":"J. M. Han \"Enhancing sat solvers with glue variable predictions \" arXiv preprint arXiv:2007.02559 2020."},{"key":"e_1_3_2_1_9_1","volume-title":"SAT","author":"Liang J. H.","year":"2018","unstructured":"J. H. Liang, C. Oh, M. Mathew, C. Thomas, C. Li, and V. Ganesh, \"Machine learning-based restart policy for CDCL SAT solvers,\" in Proc. SAT, 2018."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_2_1_11_1","volume-title":"ICLR","author":"Xu K.","year":"2018","unstructured":"K. Xu, W. Hu, J. Leskovec, and S. Jegelka, \"How powerful are graph neural networks?\" in Proc. ICLR, 2018."},{"key":"e_1_3_2_1_12_1","volume-title":"A generalization of transformer networks to graphs,\" arXiv preprint arXiv:2012.09699","author":"Dwivedi V. P.","year":"2020","unstructured":"V. P. Dwivedi and X. Bresson, \"A generalization of transformer networks to graphs,\" arXiv preprint arXiv:2012.09699, 2020."},{"key":"e_1_3_2_1_13_1","first-page":"21","volume-title":"NIPS","volume":"34","author":"Kreuzer D.","year":"2021","unstructured":"D. Kreuzer, D. Beaini, W. Hamilton, V. L\u00e9tourneau, and P. Tossou, \"Rethinking graph transformers with spectral attention,\" Proc. NIPS, vol. 34, pp. 21 618--21 629, 2021."},{"key":"e_1_3_2_1_14_1","volume-title":"Transformer-based machine learning for fast sat solvers and logic synthesis,\" arXiv preprint arXiv:2107.07116","author":"Shi F.","year":"2021","unstructured":"F. Shi, C. Lee, M. K. Bashar, N. Shukla, S.-C. Zhu, and V. Narayanan, \"Transformer-based machine learning for fast sat solvers and logic synthesis,\" arXiv preprint arXiv:2107.07116, 2021."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323731"},{"key":"e_1_3_2_1_16_1","volume-title":"IsaSAT and Kissat entering the SAT Competition","author":"Biere A.","year":"2022","unstructured":"A. Biere and M. Fleury, \"Gimsatul, IsaSAT and Kissat entering the SAT Competition 2022,\" in SAT Competition, 2022."},{"key":"e_1_3_2_1_17_1","volume-title":"Neurocomb: Improving SAT solving with graph neural networks,\" arXiv preprint arXiv:2110.14053","author":"Wang W.","year":"2021","unstructured":"W. Wang, Y. Hu, M. Tiwari, S. Khurshid, K. McMillan, and R. Miikkulainen, \"Neurocomb: Improving SAT solving with graph neural networks,\" arXiv preprint arXiv:2110.14053, 2021."},{"key":"e_1_3_2_1_18_1","volume-title":"NIPS","author":"Wu Q.","year":"2023","unstructured":"Q. Wu, W. Zhao, C. Yang, H. Zhang, F. Nie, H. Jiang, Y. Bian, and J. Yan, \"Sgformer: Simplifying and empowering transformers for large-graph representations,\" in Proc. NIPS, 2023."},{"key":"e_1_3_2_1_19_1","volume-title":"G4SATBench: Benchmarking and advancing sat solving with graph neural networks,\" arXiv preprint arXiv:2309.16941","author":"Li Z.","year":"2023","unstructured":"Z. Li, J. Guo, and X. Si, \"G4SATBench: Benchmarking and advancing sat solving with graph neural networks,\" arXiv preprint arXiv:2309.16941, 2023."}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656250","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":19,"alternative-id":["10.1145\/3649329.3656250","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3656250","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}