mlsanityData to 14 Oct 2026

Learning to Solve Weighted Maximum Satisfiability with a Co-Training Architecture

arXiv 2511.19544 ↗First posted 24 Nov 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Wepropose SplitGNN, a graph neural network (GNN)-based approach that learns to solve weighted maximum satisfiabil ity (MaxSAT) problem. SplitGNN incorporates a co-training architecture consisting of supervised message passing mech anism and unsupervised solution boosting layer. A new graph representation called edge-splitting factor graph is proposed to provide more structural information for learning, which is based on spanning tree generation and edge classification. To improve the solutions on challenging and weighted instances, we implement a GPU-accelerated layer applying efficient score calculation and relaxation-based optimization. Exper iments show that SplitGNN achieves 3* faster convergence and better predictions compared with other GNN-based ar chitectures. More notably, SplitGNN successfully finds solu tions that outperform modern heuristic MaxSAT solvers on much larger and harder weighted MaxSAT benchmarks, and demonstrates exceptional generalization abilities on diverse structural instances.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 30 references that are in the map. First posted on arXiv 24 Nov 2025.

Builds on

9 of 30 references.

References · 9

  1. 2017Attention Is All You Needcited by 60,361
  2. 2021Combinatorial optimization and reasoning with graph neural networkscited by 268
  3. 2018Learning a SAT Solver from Single-Bit Supervisioncited by 200
  4. 2022Augment with Care: Contrastive Learning for Combinatorial Problemscited by 22
  5. 2023HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baselinecited by 12
  6. 2023Effective Auxiliary Variables via Structured Reencodingcited by 7
  7. 2024GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selectioncited by 5
  8. 2024torchmSAT: A GPU-Accelerated Approximation To The Maximum Satisfiability Problemcited by 3
  9. 2024Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solverscited by 2

Built on by

Not cited yet.