Satisfiability Solving with LLMs: A Matched-Pair Evaluation of Reasoning Capability
arXiv:2605.28602v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used for tasks that implicitly reduce to Boolean satisfiability (SAT), yet their reasoning ability on SAT