A Geometric Perspective on the Difficulties of Learning GNN-based SAT Solvers
arXiv:2508.21513v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have gathered increasing interest as learnable solvers of Boolean Satisfiability Problems (SATs), operating on graph representations of logical formulas. However, their performance degrades sharply on harder and more constrained instances, raising…
