<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.12149/</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.12149/feed.xml" rel="self" type="application/rss+xml" /><item><title>SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver — mentioned by bmc7505</title><link>https://news.ycombinator.com/item?id=34103915</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.12149:34103915</guid><pubDate>Fri, 23 Dec 2022 09:35:26 GMT</pubDate><description>&lt;p&gt;There are architectures with layers which can approximate MAXSAT [1] (or rather, an SDP relaxation thereof), but I doubt this is what OP was referring to. [1]: https://arxiv.org/abs/1905.12149&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.12149/"&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>SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver — mentioned by AlexCoventry</title><link>https://news.ycombinator.com/item?id=23666773</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.12149:23666773</guid><pubDate>Sun, 28 Jun 2020 04:39:18 GMT</pubDate><description>&lt;p&gt;SATnet is an interesting paper, in this regard. It&amp;#x27;s built on a theory of backpropping through the semi-definite programming relaxation of a MAXSAT problem, to learn the MAXSAT problem associated with a class of training examples. It gets good results: learns to solve sudoku puzzles with only binary feedback on its performance (i.e. &amp;quot;that&amp;#x27;s the solution&amp;quot; or &amp;quot;that&amp;#x27;s not the solution&amp;quot;, no partial feedback on partially-correct solutions). They say it&amp;#x27;s the first time a neural net has been able to do that. On the other hand, if you look at the coefficient matrix they learn for the MAXSAT problem…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.12149/"&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>SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver — mentioned by bglazer</title><link>https://news.ycombinator.com/item?id=23318374</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.12149:23318374</guid><pubDate>Wed, 27 May 2020 01:15:15 GMT</pubDate><description>&lt;p&gt;You might be interested in the line of work around differentiable relaxations of formal solvers that was kicked off by Zico Kolter et al. They add a Max=SAT solver as a differentiable layer. This allows the neat trick of solving handwritten Sudoku puzzles by composing a ConvNet with the differentiable Max-SAT layer. [1] https://arxiv.org/abs/1905.12149&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.12149/"&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>SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver — mentioned by skdotdan</title><link>https://news.ycombinator.com/item?id=21108876</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.12149:21108876</guid><pubDate>Sun, 29 Sep 2019 18:47:53 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1905.12149&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.12149/"&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>SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver — HN submission</title><link>https://news.ycombinator.com/item?id=20088639</link><guid isPermaLink="false">urn:hackerpapers:submission:1905.12149:20088639</guid><pubDate>Mon, 03 Jun 2019 20:55:28 GMT</pubDate><description>&lt;p&gt;SATNet: Bridging deep learning and logical reasoning with differentiable SAT&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;116 points; 17 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1905.12149/"&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>
