ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis
概要
arXiv:2605.05485v1 Announce Type: cross Abstract: LLMs can solve program synthesis tasks but remain inefficient and unreliable on hard instances requiring large combinatorial search. Given a small set of reasoning traces, we use coding agents to compile them into reusable symbolic program synthesiz…
