Agent-directed tree search improves LLM performance on Lean formal verification tasks, with context-based orchestration solving more intermediate specs at lower token cost than baseline agents.
A machine-checked proof of the odd order theorem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Describes integrating symbolic code reasoning into CS1 and discrete math courses at Haverford and Grinnell, introduces the Orca proof assistant, and poses research questions on effectiveness.
citing papers explorer
-
Automating Formal Verification with Agent-Guided Tree Search
Agent-directed tree search improves LLM performance on Lean formal verification tasks, with context-based orchestration solving more intermediate specs at lower token cost than baseline agents.
-
A Bridge Anchored on Both Sides: Formal Deduction in Introductory CS, and Code Proofs in Discrete Math
Describes integrating symbolic code reasoning into CS1 and discrete math courses at Haverford and Grinnell, introduces the Orca proof assistant, and poses research questions on effectiveness.