<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>End-to-End Differentiable Proving · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1705.11040/</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/1705.11040/feed.xml" rel="self" type="application/rss+xml" /><item><title>End-to-End Differentiable Proving — mentioned by popinman322</title><link>https://news.ycombinator.com/item?id=24823949</link><guid isPermaLink="false">urn:hackerpapers:mention:1705.11040:24823949</guid><pubDate>Mon, 19 Oct 2020 07:10:03 GMT</pubDate><description>&lt;p&gt;IIRC these nets don&amp;#x27;t actually build a knowledge base (though I may be wrong, it&amp;#x27;s been a while). They&amp;#x27;re still functioning in lossy continuous space. This is probably fine with a low number of symbols and relations, but once you get to the level of a neural theorem prover you need to properly handle symbol binding. If I&amp;#x27;m working with integers and integer-valued variables, how do I represent the variables? How do I represent the operations? This gets more complex once you leave a closed domain, where all the operations and variables are defined up front, and you enter an open domain like…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1705.11040/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>End-to-End Differentiable Proving — mentioned by maffydub</title><link>https://news.ycombinator.com/item?id=14497363</link><guid isPermaLink="false">urn:hackerpapers:mention:1705.11040:14497363</guid><pubDate>Tue, 06 Jun 2017 14:18:34 GMT</pubDate><description>&lt;p&gt;I recently went to a talk at the London Machine Learning meetup (https://www.meetup.com/London-Machine-Learning-Meetup/) on &amp;quot;End-to-end Differentiable Proving&amp;quot; (https://arxiv.org/abs/1705.11040). Basically, this was about building neural networks based on propositional logic (e.g. Prolog-style statements), which was how some traditional expert systems were built. Unfortunately, there wasn&amp;#x27;t a video of the presentation, and I can&amp;#x27;t find the slides anywhere. If you&amp;#x27;re based around London, the London Machine Learning meetups are always worth attending!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1705.11040/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
