<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>State Algebra for Propositional Logic · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2509.10326/</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.10326/feed.xml" rel="self" type="application/rss+xml" /><item><title>State Algebra for Propositional Logic — mentioned by dmitry_stratyfy</title><link>https://news.ycombinator.com/item?id=45887374</link><guid isPermaLink="false">urn:hackerpapers:mention:2509.10326:45887374</guid><pubDate>Tue, 11 Nov 2025 14:04:50 GMT</pubDate><description>&lt;p&gt;Hi HN, I&amp;#x27;m one of the creators. I&amp;#x27;ve been tackling the problem of managing complex business rules for years (especially in fintech), and wanted a lightweight, Python-native tool that was built on a solid theoretical foundation. We built vector-logic (it&amp;#x27;s on PyPI) and wrote a hands-on guide for Towards Data Science: https://towardsdatascience.com/building-a-rules-engine-from-... The whole framework is based on a theory we call &amp;#x27;State Algebra,&amp;#x27; which we co-authored for arXiv: https://arxiv.org/abs/2509.10326 Happy to answer any questions!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2509.10326/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>State Algebra for Propositional Logic — HN submission</title><link>https://news.ycombinator.com/item?id=45248747</link><guid isPermaLink="false">urn:hackerpapers:submission:2509.10326:45248747</guid><pubDate>Mon, 15 Sep 2025 12:14:08 GMT</pubDate><description>&lt;p&gt;Show HN: State Algebra, new algebraic framework for logic, an alternative to BDD&lt;/p&gt;&lt;p&gt;Hey HN, My co-author and I just published a paper on arXiv that formalises a framework we&amp;#x27;ve been using successfully in probabilistic logic for many years. We decided it was time to properly lay out its foundations for classical propositional logic. We cast propositional logic into a formal algebra where logical formulas are represented by sparse matrices. State Algebra isn&amp;#x27;t an algorithm in itself, but rather a language for manipulating Boolean functions. It provides a new set of tools that lets you express and reformulate existing optimization heuristics (like those from modern SAT solvers)…&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2509.10326/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
