Learning How to Cube

📰 ArXiv cs.AI

arXiv:2605.16632v1 Announce Type: cross Abstract: Despite the effectiveness of Cube-and-Conquer (C&C) for solving challenging Boolean Satisfiability (SAT) problems, no prior work has shown that transformer-based models can learn effective cubing heuristics. We introduce a neuro-symbolic post-training framework for this task. We design an MCTS-based data curation pipeline that uses symbolic heuristics to explore splitting decisions over SAT competition formulas, producing preference data grounded

Published 19 May 2026
Read full paper → ← Back to Reads