mlsanityData to 7 Oct 2026

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

arXiv 2302.02104 ↗First posted 4 Feb 2023cs.AI cs.LGcited by 12

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

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2017Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphscited by 307
  4. 2018Learning a SAT Solver from Single-Bit Supervisioncited by 198
  5. 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 81
  6. 2020It's Not What Machines Can Learn, It's What We Cannot Teachcited by 29
  7. 2021Goal-Aware Neural SAT Solvercited by 27
  8. 2022ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanationscited by 26
  9. 2020NLocalSAT: Boosting Local Search with Solution Predictioncited by 25
  10. 2022Machine Learning Methods in Solving the Boolean Satisfiability Problemcited by 22
  11. 2019G2SAT: Learning to Generate SAT Formulascited by 20
  12. 2020Enhancing SAT solvers with glue variable predictionscited by 11

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 5; 2025: 4.

12 papers.