HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline

4 February 2023

Papers citing "HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline"

8 / 8 papers shown

Title
Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set Yikai Wu Haoyu Zhao Sanjeev Arora 77 0 0 05 Feb 2025
HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation Joseph Cotnareanu Zhanguang Zhang Hui-Ling Zhen Yingxue Zhang Mark J. Coates 17 0 0 27 Sep 2024
LinSATNet: The Positive Linear Satisfiability Neural Networks Runzhong Wang Yunhao Zhang Ziao Guo Tianyi Chen Xiaokang Yang Junchi Yan 19 15 0 18 Jul 2024
GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection Zhanguang Zhang Didier Chetelat Joseph Cotnareanu Amur Ghose Wenyi Xiao Hui-Ling Zhen Yingxue Zhang Jianye Hao Mark J. Coates Mingxuan Yuan NAI 32 1 0 17 May 2024
Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More Fanchen Bu Hyeonsoo Jo Soo Yong Lee Sungsoo Ahn Kijung Shin 22 3 0 14 May 2024
Machine Learning Insides OptVerse AI Solver: Design Principles and Applications Xijun Li Fangzhou Zhu Hui-Ling Zhen Weilin Luo Meng Lu ... Jia Zeng M. Yuan Jianye Hao Jun Yao Kun Mao 25 1 0 11 Jan 2024
A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability Zijie Geng Xijun Li Jie Wang Xiao Li Yongdong Zhang Feng Wu 41 17 0 04 Oct 2023
SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations Qitian Wu Wen-Long Zhao Chenxiao Yang Hengrui Zhang Fan Nie Haitian Jiang Yatao Bian Junchi Yan AI4CE 35 75 0 19 Jun 2023