{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T16:40:13Z","timestamp":1786120813189,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Natural Science Foundation of China","award":["U22A2098"],"award-info":[{"award-number":["U22A2098"]}]},{"name":"Major Science and Technology Development Plan of Changchun","award":["2024WX05"],"award-info":[{"award-number":["2024WX05"]}]},{"name":"Jilin Provincial Natural Science Foundation","award":["20240101378JC"],"award-info":[{"award-number":["20240101378JC"]}]},{"name":"Jilin Provincial Education Department Research Project","award":["JJKH20241286KJ"],"award-info":[{"award-number":["JJKH20241286KJ"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770855.3817669","type":"proceedings-article","created":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T17:15:43Z","timestamp":1786036543000},"page":"6618-6628","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SAT Solver Selection: Move Beyond Handcrafted Features"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9545-5813","authenticated-orcid":false,"given":"Yitao","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Software, Jilin University, Changchun, China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5862-8646","authenticated-orcid":false,"given":"Xiao","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6882-0107","authenticated-orcid":false,"given":"Yong","family":"Lai","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1927-8419","authenticated-orcid":false,"given":"Bo","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mohamed El Bachir Menai, and Hassan Mathkour","author":"Alyahya Tasniem Nasser","year":"2022","unstructured":"Tasniem Nasser Alyahya, Mohamed El Bachir Menai, and Hassan Mathkour. 2022. On the structure of the boolean satisfiability problem: A survey. ACM Computing Surveys (CSUR), V55, 3 (2022), 1-34."},{"key":"e_1_3_2_1_2_1","volume-title":"V2014","author":"Biere Armin","year":"2014","unstructured":"Armin Biere. 2014. Yet another local search solver and Lingeling and friends entering the SAT Competition 2014. Sat competition, V2014, 2 (2014), 65."},{"key":"e_1_3_2_1_3_1","volume-title":"Aslib: A benchmark library for algorithm selection. Artificial Intelligence, V237","author":"Bischl Bernd","year":"2016","unstructured":"Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri Malitsky, Alexandre Fr\u00e9chette, Holger Hoos, Frank Hutter, Kevin Leyton-Brown, Kevin Tierney, et al., 2016. Aslib: A benchmark library for algorithm selection. Artificial Intelligence, V237 (2016), 41-58."},{"key":"e_1_3_2_1_4_1","volume-title":"V2021","author":"Cherif Mohamed Sami","year":"2021","unstructured":"Mohamed Sami Cherif, Djamal Habet, and Cyril Terrioux. 2021. Kissat mab: Combining vsids and chb through multi-armed bandit. SAT COMPETITION, V2021 (2021), 15."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"e_1_3_2_1_6_1","volume-title":"International workshop on automatic machine learning at ICML","volume":"12","author":"Feurer Matthias","year":"2018","unstructured":"Matthias Feurer, Katharina Eggensperger, Stefan Falkner, Marius Lindauer, and Frank Hutter. 2018. Practical automated machine learning for the automl challenge 2018. In International workshop on automatic machine learning at ICML, Vol. V12."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the Open Algorithm Selection Challenge (Proceedings of Machine Learning Research","volume":"11","author":"Gonard Fran\u00e7ois","year":"2017","unstructured":"Fran\u00e7ois Gonard, Marc Schoenauer, and Mich\u00e8le Sebag. 2017. ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler. In Proceedings of the Open Algorithm Selection Challenge (Proceedings of Machine Learning Research, Vol. V79). 8-11."},{"key":"e_1_3_2_1_8_1","first-page":"305","volume-title":"Proceedings of the Great Lakes Symposium on VLSI","author":"Govindasamy Hariprasadh","year":"2024","unstructured":"Hariprasadh Govindasamy, Babak Esfandiari, and Paulo Garcia. 2024. Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs. In Proceedings of the Great Lakes Symposium on VLSI 2024. 305-309."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.5947"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA200995"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98334-9_13"},{"key":"e_1_3_2_1_12_1","first-page":"594","volume-title":"GraphMAE: Self-Supervised Masked Graph Autoencoders. In KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Hou Zhenyu","year":"2022","unstructured":"Zhenyu Hou, Xiao Liu, Yukuo Cen, Yuxiao Dong, Hongxia Yang, Chunjie Wang, and Jie Tang. 2022. GraphMAE: Self-Supervised Masked Graph Autoencoders. In KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14 - 18, 2022. 594-604."},{"key":"e_1_3_2_1_13_1","first-page":"454","volume-title":"CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings 17","author":"Kadioglu Serdar","year":"2011","unstructured":"Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, and Meinolf Sellmann. 2011. Algorithm selection and scheduling. In Principles and Practice of Constraint Programming-CP 2011: 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings 17. Springer, 454-469."},{"key":"e_1_3_2_1_14_1","volume-title":"Delfi: Online planner selection for cost-optimal planning. IPC-9 planner abstracts","author":"Katz Michael","year":"2018","unstructured":"Michael Katz, Shirin Sohrabi, Horst Samulowitz, and Silvan Sievers. 2018. Delfi: Online planner selection for cost-optimal planning. IPC-9 planner abstracts (2018), 57-64."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the Open Algorithm Selection Challenge (Proceedings of Machine Learning Research","volume":"18","author":"Kotthoff Lars","year":"2017","unstructured":"Lars Kotthoff, Marius Lindauer, Holger H. Hoos, and Kevin Leyton-Brown. 2017. OASC-2017: *Zilla Submission. In Proceedings of the Open Algorithm Selection Challenge (Proceedings of Machine Learning Research, Vol. V79), Bernd Bischl, Lars Kotthoff, and Joaquin Vanschoren (Eds.). 15-18."},{"key":"e_1_3_2_1_16_1","volume-title":"Nsnet: A general neural probabilistic framework for satisfiability problems. Advances in Neural Information Processing Systems, V35","author":"Li Zhaoyu","year":"2022","unstructured":"Zhaoyu Li and Xujie Si. 2022. Nsnet: A general neural probabilistic framework for satisfiability problems. Advances in Neural Information Processing Systems, V35 (2022), 25573-25585."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of SAT Competition, V2016","author":"Liang Jia Hui","year":"2016","unstructured":"Jia Hui Liang, Chanseok Oh, Vijay Ganesh, Krzysztof Czarnecki, and Pascal Poupart. 2016. Maple-comsps, maplecomsps lrb, maplecomsps chb. Proceedings of SAT Competition, V2016 (2016)."},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Open algorithm selection challenge 2017: Setup and scenarios. In Open Algorithm Selection Challenge 2017","author":"Lindauer Marius","year":"2017","unstructured":"Marius Lindauer, Jan N van Rijn, and Lars Kotthoff. 2017. Open algorithm selection challenge 2017: Setup and scenarios. In Open Algorithm Selection Challenge 2017. PMLR, 1-7.","journal-title":"PMLR"},{"key":"e_1_3_2_1_19_1","first-page":"16264","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"37","author":"Liu Minghao","year":"2023","unstructured":"Minghao Liu, Pei Huang, Fuqi Jia, Fan Zhang, Yuchen Sun, Shaowei Cai, Feifei Ma, and Jian Zhang. 2023. Can graph neural networks learn to solve the MaxSAT problem?. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. V37. 16264-16265."},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the First Open Algorithm Selection Challenge (Proceedings of Machine Learning Research","volume":"14","author":"Liu Tong","year":"2017","unstructured":"Tong Liu. 2017. SUNNY with Algorithm Configuration. In Proceedings of the First Open Algorithm Selection Challenge (Proceedings of Machine Learning Research, Vol. V79). 12-14."},{"key":"e_1_3_2_1_21_1","volume-title":"V72","author":"Liu Tong","year":"2021","unstructured":"Tong Liu, Roberto Amadini, Maurizio Gabbrielli, and Jacopo Mauro. 2021. sunny-as2: Enhancing SUNNY for algorithm selection. Journal of Artificial Intelligence Research, V72 (2021), 329-376."},{"key":"e_1_3_2_1_22_1","first-page":"1280","volume-title":"Deep Learning for Algorithm Portfolios. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","author":"Loreggia Andrea","year":"2016","unstructured":"Andrea Loreggia, Yuri Malitsky, Horst Samulowitz, and Vijay A. Saraswat. 2016. Deep Learning for Algorithm Portfolios. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA, Dale Schuurmans and Michael P. Wellman (Eds.). AAAI Press, 1280-1286."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-44973-4_17"},{"key":"e_1_3_2_1_24_1","first-page":"19","article-title":"as-asl: Algorithm selection with auto-sklearn. In Open Algorithm Selection Challenge 2017","author":"Malone Brandon","year":"2017","unstructured":"Brandon Malone, Kustaa Kangas, Matti J\u00e4rvisalo, Mikko Koivisto, and Petri Myllym\u00e4ki. 2017. as-asl: Algorithm selection with auto-sklearn. In Open Algorithm Selection Challenge 2017. PMLR, 19-22.","journal-title":"PMLR"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-131"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-011-9290-2"},{"key":"e_1_3_2_1_27_1","volume-title":"Geom-GCN: Geometric Graph Convolutional Networks. In 8th International Conference on Learning Representations, ICLR","author":"Pei Hongbin","year":"2020","unstructured":"Hongbin Pei, Bingzhe Wei, Kevin Chen Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-GCN: Geometric Graph Convolutional Networks. In 8th International Conference on Learning Representations, ICLR 2020."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_29_1","volume-title":"7th International Conference on Learning Representations, ICLR","author":"Selsam Daniel","year":"2019","unstructured":"Daniel Selsam, Matthew Lamm, Benedikt B\u00fcnz, Percy Liang, David L Dill, and Leonardo De Moura. 2019. Learning a SAT solver from single-bit supervision. In 7th International Conference on Learning Representations, ICLR 2019."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11493853_24"},{"key":"e_1_3_2_1_31_1","volume-title":"Vabs\/2402.10705","author":"Sun Yiwen","year":"2024","unstructured":"Yiwen Sun, Furong Ye, Xianyin Zhang, Shiyu Huang, Bingzhen Zhang, Ke Wei, and Shaowei Cai. 2024. AutoSAT: Automatically Optimize SAT Solvers via Large Language Models. CoRR, Vabs\/2402.10705 (2024)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12251-4_3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_18"},{"key":"e_1_3_2_1_36_1","volume-title":"V32","author":"Xu Lin","year":"2008","unstructured":"Lin Xu, Frank Hutter, Holger H Hoos, and Kevin Leyton-Brown. 2008. SATzilla: portfolio-based algorithm selection for SAT. Journal of artificial intelligence research, V32 (2008), 565-606."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/774572.774637"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671627"},{"key":"e_1_3_2_1_39_1","first-page":"1","volume-title":"Towards Feature-free TSP Solver Selection: A Deep Learning Approach. In International Joint Conference on Neural Networks, IJCNN 2021","author":"Zhao Kangfei","year":"2021","unstructured":"Kangfei Zhao, Shengcai Liu, Jeffrey Xu Yu, and Yu Rong. 2021. Towards Feature-free TSP Solver Selection: A Deep Learning Approach. In International Joint Conference on Neural Networks, IJCNN 2021, Shenzhen, China, July 18-22, 2021. IEEE, 1-8."},{"key":"e_1_3_2_1_40_1","volume-title":"V6, 1","author":"Zhou Zhi-Hua","year":"2019","unstructured":"Zhi-Hua Zhou and Ji Feng. 2019. Deep forest. National science review, V6, 1 (2019), 74-86."}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:29:08Z","timestamp":1786066148000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770855.3817669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,8]]},"references-count":40,"alternative-id":["10.1145\/3770855.3817669","10.1145\/3770855"],"URL":"https:\/\/doi.org\/10.1145\/3770855.3817669","relation":{},"subject":[],"published":{"date-parts":[[2026,8,8]]},"assertion":[{"value":"2026-08-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}