<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Committing to the bit: Relational programming with semiring arrays and SAT solving · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2509.22614/</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/2509.22614/feed.xml" rel="self" type="application/rss+xml" /><item><title>Committing to the bit: Relational programming with semiring arrays and SAT solving — mentioned by sporkl</title><link>https://news.ycombinator.com/item?id=48899974</link><guid isPermaLink="false">urn:hackerpapers:mention:2509.22614:48899974</guid><pubDate>Mon, 13 Jul 2026 22:50:13 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve been working on something similar, implementing a relational language on top of a tensor library[0]. Mathematically, einsum and database joins are the same thing, just over different semirings (real numbers for einsum, booleans for databases). A lot of papers about datalog explore this sort of thing in more depth. In particular, Dyna[1] might be interesting. [0]: https://arxiv.org/abs/2509.22614 [1]: https://dyna.org/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2509.22614/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
