HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
Not on the map. Why?
Abstract (arXiv)
Industrial SAT formula generation is a critical yet challenging task. Existing SAT generation approaches can hardly simultaneously capture the global structural properties and maintain plausible computational hardness. We first present an in-depth analysis for the limitation of previous learning methods in reproducing the computational hardness of original instances, which may stem from the inherent homogeneity in their adopted split-merge procedure. On top of the observations that industrial formulae exhibit clear community structure and oversplit substructures lead to the difficulty in semantic formation of logical structures, we propose HardSATGEN, which introduces a fine-grained control mechanism to the neural split-merge paradigm for SAT formula generation to better recover the structural and computational properties of the industrial benchmarks. Experiments including evaluations on private and practical corporate testbed show the superiority of HardSATGEN being the only method to successfully augment formulae maintaining similar computational hardness and capturing the global structural properties simultaneously. Compared to the best previous methods, the average performance gains achieve 38.5% in structural statistics, 88.4% in computational metrics, and over 140.7% in the effectiveness of guiding solver tuning by our generated instances. Source code is available at http://github.com/Thinklab-SJTU/HardSATGEN
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 12 of its 54 references that are in the map. First posted on arXiv 4 Feb 2023.
Builds on
12 of 54 references.
References · 12
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphscited by 307
- 2018Learning a SAT Solver from Single-Bit Supervisioncited by 198
- 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 81
- 2020It's Not What Machines Can Learn, It's What We Cannot Teachcited by 29
- 2021Goal-Aware Neural SAT Solvercited by 27
- 2022ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanationscited by 26
- 2020NLocalSAT: Boosting Local Search with Solution Predictioncited by 25
- 2022Machine Learning Methods in Solving the Boolean Satisfiability Problemcited by 22
- 2019G2SAT: Learning to Generate SAT Formulascited by 20
- 2020Enhancing SAT solvers with glue variable predictionscited by 11
Built on by
Citing papers per year: 2023: 3; 2024: 5; 2025: 4.
12 papers.
- 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 131
- 2023A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availabilitycited by 21
- 2024LinSATNet: The Positive Linear Satisfiability Neural Networkscited by 16
- 2023Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regimecited by 8
- 2024Machine Learning Insides OptVerse AI Solver: Design Principles and Applicationscited by 7
- 2024Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and Morecited by 6
- 2024GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selectioncited by 5
- 2025STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimizationcited by 3
- 2025Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Setcited by 2
- 2025Structure based SAT dataset for analysing GNN generalisationcited by 1
- 2024HardCore Generation: Generating Hard UNSAT Problems for Data Augmentationcited by 0
- 2025Learning to Solve Weighted Maximum Satisfiability with a Co-Training Architecturecited by 0
- 2025Learning to Solve Weighted Maximum Satisfiability with a Co-Training Architecture24 Nov 2025
- 2025STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization22 May 2025
- 2025Structure based SAT dataset for analysing GNN generalisation17 Feb 2025
- 2025Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set5 Feb 2025
- 2024HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation27 Sep 2024
- 2024LinSATNet: The Positive Linear Satisfiability Neural Networks18 Jul 2024
- 2024GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection17 May 2024
- 2024Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More14 May 2024
- 2024Machine Learning Insides OptVerse AI Solver: Design Principles and Applications11 Jan 2024
- 2023Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime13 Nov 2023
- 2023A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability4 Oct 2023
- 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations19 Jun 2023