Danus uses a main planner, parallel workers, and a shared verified fact graph to construct long research-level mathematical proofs across six case studies.
On some open problems in commutative algebra resolved by Rethlas
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We report on a collection of open problems in commutative algebra and related areas that have been resolved (proved or disproved) using the Rethlas natural-language automated reasoning system. The problems are drawn from several published lists, including Open Problems in Commutative Ring Theory (Cahen-Fontana-Frisch-Glaz), Erman-Sam's survey of Boij-S\"oderberg theory. For each problem we record the precise statement and a self-contained proof produced (with no human intervention) by Rethlas and subsequently verified by human experts.
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory
Danus uses a main planner, parallel workers, and a shared verified fact graph to construct long research-level mathematical proofs across six case studies.