Satisfiability Solving with LLMs: A Matched-Pair Evaluation of Reasoning Capability 事件

Satisfiability Solving with LLMs: A Matched-Pair Evaluation of Reasoning Capability arXiv:2605.28602v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly used for tasks that implicitly reduce to Boolean satisfiability (SAT), yet their reasoning ability on SAT remains unclear. We present a systematic study of LLMs on 2-SAT and 3-SAT, together with two canonical reductions, Vertex Cover and discrete 3D packing, to probe representation-invariant reasoning. We first evalua