作者位次 #2/2ACL 2026Poster· Natural Language Processing
From Trajectories to Graphs: Contract-Checked Editing for Verifier-Guided LLM Reasoning
Rui Li · Shuang Cao
摘要
Inference-time search can substantially improve LLM reasoning when tasks admit deterministic verification, but existing methods largely refine single trajectories and lack a reliable mechanism for composing partial solutions across candidates. We propose contract-checked graph editing: represent...