Conference
Open access
2026
From Trajectories to Graphs: Contract-Checked Editing for Verifier-Guided LLM Reasoning
Contract-checked graph editing is proposed : represent each candidate as an interface-typed reasoning DAG and validate every nontrivial edit with a deterministic structural gate (acyclicity, namespace closure, schema validity, terminal constraints) before invoking the verifier.
Rui Li, Shuang Cao
· Annual Meeting of the Associ... · 2 citations