A minimal agentic system achieves competitive performance in automated theorem proving with a simpler design and lower cost than state-of-the-art methods.
Towards formal proofs of feedback control theory
1 Pith paper cite this work, alongside 15 external citations. Polarity classification is still indexing.
1
Pith paper citing it
15
external citations · external index
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Minimal Agent for Automated Theorem Proving
A minimal agentic system achieves competitive performance in automated theorem proving with a simpler design and lower cost than state-of-the-art methods.