ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis

ReaComp compiles LLM reasoning into symbolic program synthesizers to overcome the inefficiency and unreliability of LLMs on hard program synthesis tasks. These standalone solvers achieve higher accuracy and efficiency, outperforming LLMs and significantly reducing token usage in neuro-symbolic hybrid settings.