按年被提到
20162019 · 2 次2026
数学、逻辑与理论›AI 数学与定理证明·arXiv:1608.02644 · cs.AI

Holophrasm: a neural Automated Theorem Prover for higher-order logic

Daniel Whalen · 2016
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2019-08-24 · 最近 2022-12-25
2不同的人
3活跃月份
3讨论串
22被引(OpenAlex)
arXiv 摘要(候选层不写导读)

I propose a system for Automated Theorem Proving in higher order logic using deep learning and eschewing hand-constructed features. Holophrasm exploits the formalism of the Metamath language and explores partial proof trees using a neural-network-augmented bandit algorithm and a sequence-to-sequence model for action enumeration. The system proves 14% of its test theorems from Metamath's set.mm module.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论drchewbacca · 2019-08

“And another https://arxiv.org/pdf/1608.02644.pdf I'd really love to see someone like Deepmind get a hold of this. They are perfectly placed to apply a lot of resources to it and it's right in their wheelhouse. Don't know how to contact them about it though.”

Learning to prove theorems via interacting with proof assistants原评论 ↗
评论drchewbacca · 2019-09

“It's not really like that. NN's are only used when searching for new proofs or steps which can be used to fill in details, the verification of a finished proof is done by a classical program by a series of substitutions which are very straightforward and spelled out in detail. Here is an example. https://arxiv.org/pdf/1608.02644.pdf”

Number theorist fears many proofs widely considered to be true are wrong原评论 ↗
评论raphlinus · 2022-12

“Do not nerd snipe me! There's tons of juice left on the CPU side. Again I recommend Metamath Zero (which is somewhat of an opposite direction as HoTT), as it's able to check the entire Metamath proof database in a few hundred milliseconds. This is orders of magnitude faster than most other proof systems. If you did want to manipulate trees on the GPU, t…”

Introduction to Homotopy Type Theory原评论 ↗