<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph Representations for Higher-Order Logic and Theorem Proving · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.10006/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1905.10006/feed.xml" rel="self" type="application/rss+xml" /><item><title>Graph Representations for Higher-Order Logic and Theorem Proving — mentioned by aSanchezStern</title><link>https://news.ycombinator.com/item?id=38042406</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.10006:38042406</guid><pubDate>Fri, 27 Oct 2023 18:52:58 GMT</pubDate><description>&lt;p&gt;Sounds like you&amp;#x27;ve stumbled into the wonderful world of machine-learning guided proof synthesis! While I don&amp;#x27;t think the full system you&amp;#x27;re describing has been built yet, many similar systems and pieces have. In terms of the initial phase of supervised learning on existing proofs to prove new ones, there&amp;#x27;s TacticToe (https://arxiv.org/abs/1804.00596), Tactician (https://arxiv.org/pdf/2008.00120.pdf), CoqGym/ASTactic (https://arxiv.org/abs/1905.09381), Proverbot9001 (https://arxiv.org/abs/1907.07794), and Diva (https://dl.acm.org/doi/10.1145/3510003.3510138#sec-terms), among others. Most of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.10006/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Graph Representations for Higher-Order Logic and Theorem Proving — HN submission</title><link>https://news.ycombinator.com/item?id=24389058</link><guid isPermaLink="false">urn:hackerpapers:submission:1905.10006:24389058</guid><pubDate>Sun, 06 Sep 2020 04:49:07 GMT</pubDate><description>&lt;p&gt;Graph Representations for Higher-Order Logic and Theorem Proving (2019)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;104 points; 15 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1905.10006/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
