Differentiable Satisfiability and Differentiable Answer Set Programming for Sampling-Based Multi-Model Optimization · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1812.11948/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTDifferentiable Satisfiability and Differentiable Answer Set Programming for Sampling-Based Multi-Model Optimization — mentioned by mleventalhttps://news.ycombinator.com/item?id=20089288urn:hackerpapers:mention:1812.11948:20089288Mon, 03 Jun 2019 21:54:22 GMT<p>there&#x27;s also this https://arxiv.org/abs/1812.11948</p><p><a href="https://hackerpaper.kaipfister.de/p/1812.11948/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.AIDifferentiable Satisfiability and Differentiable Answer Set Programming for Sampling-Based Multi-Model Optimization — mentioned by nlhttps://news.ycombinator.com/item?id=19957306urn:hackerpapers:mention:1812.11948:19957306Mon, 20 May 2019 03:23:39 GMT<p>We propose Differentiable Satisfiability and Differentiable Answer Set Programming (Differentiable SAT/ASP) for multi-model optimization. Models (answer sets or satisfying truth assignments) are sampled using a novel SAT/ASP solving approach which uses a gradient descent-based branching mechanism. https://arxiv.org/abs/1812.11948</p><p><a href="https://hackerpaper.kaipfister.de/p/1812.11948/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.AI