Dev tools · alternatives · 2026
24 alternatives to State Algebra, new algebraic framework for logic, an alternative to BDD
Hey HN, My co-author and I just published a paper on arXiv that formalises a framework we'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'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…
Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1
2017 · craftinginterpreters.com · its alternatives →
- 2
An Interpreter for Extended Relational Algebra (Scheme based) - scvalencia/Coddie
2016 · github.com · its alternatives →
- 3
Agentic problem solving in its current state is very brittle. I fell in love with it, but it creates as many problems as it solves. I'm Ben Cochran, I spent 20+ years in the trenches with full-stack Engineering, DevOps, high performance computing & ML with stints at NVIDIA, AMD and various other organizations most recently as a Distinguished Engineer. For agents to work reliably you either need massive parameter counts or massive context windows to keep the solution spaces workable. Most people are brute forcing reliability with bigger models and longer prompts. What if I made the problem…
May 2026 · github.com · its alternatives →
- 4
Stephen Wolfram's new book on the Wolfram Language
2015 · wolfram.com · its alternatives →
- 5
Rules Engine based on State Algebra. Contribute to dmitry-lesnik/vector-logic development by creating an account on GitHub.
Nov 2025 · github.com · its alternatives →
- 6
Haskell re-implementation of STOKE, the stochastic superoptimizer - blaze/notebooks/tutorial.ipynb at master · bollu/blaze
2019 · github.com · its alternatives →
- 7
Zero-Knowledge Proofs (ZKPs) let an untrusted proved show that computation was executed correctly without revealing the inputs to the verifier. However to prove anything, the computation first has to be expressed as a circuit: a system of polynomial equations (constraints) over a finite field. Circuits are the assembly language of zk and every constraint costs prover (and sometimes verifier) time, so production circuits are aggressively hand-optimized. Over the last months, we have been experimenting with writing formal specifications instead and letting LLMs produce the circuits: as long as…
Jul 2026 · zk.golf · its alternatives →
- 8
See what it’s like to program in a language without null.
2015 · books.thoughtbot.com · its alternatives →
- 9SA
Hey HN, I’m a physicist turned quant. Some friends and I 'built' SymDerive because we wanted a symbolic math library that was "Agent-Native" by design, but still a practical tool for humans. It boils down to two main goals: 1. Agent Reliability: I’ve found that AI agents write much more reliable code when they stick to stateless, functional pipelines (Lisp-style). It keeps them from hallucinating state changes or getting lost in long procedural scripts. I wanted a library that enforces that "Input -> Transform -> Output" flow by default. 2. Easing the transition to Python: For many…
Feb 2026 · its alternatives →
- 10OA
2017 · osqp.readthedocs.io · its alternatives →
- 11MA
I'm interested in Buddhist philosophy, and specifically studying Nāgārjuna's Middle Way gave me inspiration to formalize it mathematically and see what would emerge as a result. (My background: engineer/co-founder (Qualcomm/Adreno GPU, Bumble, Stereo), 16 years of meditation practice, 2+ years in Southeast Asian monasteries and silent retreats) Starting from one Buddhist-inspired axiom—recursive duality E={E⁻,E⁺} - I derived: 1) Boolean logic (from period structure of minimal couplings) 2) Universal computation (closure enables Turing-completeness) 3) Memory (pattern persistence…
Jan 2026 · its alternatives →
- 12
a Pythonic toolkit for working with Boolean expressions - welchbj/tt
2016 · github.com · its alternatives →
- 13OS
We’ve just released an open-source library for solving the Maximum Independent Set (MIS) problem with neutral atom quantum computing, running on both quantum processing units (QPUs) and classical hardware, thanks to emulators. This project is the result of collaboration between Pasqal, academic researchers, and industry partners, aiming to make it practical to experiment with quantum approaches to hard combinatorial optimization tasks. The MIS problem appears in real-world scenarios like scheduling, resource allocation, and network optimization, areas where classical solvers often struggle…
2025 · its alternatives →
- 14
Fast equality saturation in Haskell
2022 · hackage.haskell.org · its alternatives →
- 15
Hi HN, Today I'd like to present the results of my weekend project of the last year or so. Given there are many posts on HN about LLMs and Prolog, I thought that this would be of interest. DeepClause is my own (possibly misguided :-) attempt at combining LLMs with Logic Programming, ultimately hoping to establish a foundation for building more reliable agents, that produce reproducible and fully traceable result. At the heart of DeepClause is a DSL called "DeepClause Meta Language" (DML) which can be used to encode agent behaviors as executable logic programs. DML is executed by a…
Nov 2025 · github.com · its alternatives →
- 16
Linear algebra concepts implemented in Go, mainly matrix manipulation - igomez10/linearalgebra
Jun 2026 · github.com · its alternatives →
- 17DS
Hi, I wrote a distributed SAT solver in Elixir to get a feel of the language, perhaps someone out there might find this interesting. I really don't know if this can be a economic approach to SAT solving. https://github.com/roehst/elisat
2016 · its alternatives →
- 18
Hey HN! We built *lapisla*, a theorem proving platform designed to make formal proofs more open and collaborative. We developed a kernel, editor, proof registry, and platform ── all accessible directly in the browser. Why we built this: Existing theorem provers are powerful, but they often feel isolated and difficult to extend. Unlike modern programming languages, which thrive on package managers and shared libraries, theorem proving tools lack a seamless way to integrate others' work. lapisla aims to bridge this gap by: * Offering a verified public proof registry for sharing and discovering…
2025 · github.com · its alternatives →
- 19
Decision engine for developers. Language agnostic, low code.
Jun 2026 · hub.docker.com · its alternatives →
- 20
Hey HN, We’ve been experimenting with how to make AI agents more deterministic, observable, and production-safe, and that led us to build AgentML — an open-source language for defining agent behavior as state machines, not prompt chains. My co-founder posted before but linked to the project website instead of the repo, so resharing here. AgentML lets you describe your agent’s reasoning and actions as a finite-state model (think SCXML for agents). Each state, transition, and tool call is explicit and machine-verifiable. That means you can: - Reproduce any decision path deterministically -…
Nov 2025 · github.com · its alternatives →
- 21AH
This paper formally defines where current AGI hits a structural wall — not a technical one. It shows that no amount of scaling, reinforcement learning, or recursive optimization will break through three deep epistemological and formal constraints: 1. Semantic Closure — An AI system cannot generate outputs that require meaning beyond its internal frame. 2. Non-Computability of Frame Innovation — New cognitive structures cannot be computed from within an existing one. 3. Statistical Breakdown in Open Worlds — Probabilistic inference collapses in environments with heavy-tailed uncertainty.…
2025 · its alternatives →
- 22
A finite-state machine library for the Go programming language - calebwin/go-sm
2018 · github.com · its alternatives →
- 23
Course on Metaprogramming. Contribute to namin/metaprogramming development by creating an account on GitHub.
2025 · github.com · its alternatives →
- 24
A friend and I spent a month throwing together a visual rule engine product– wanted to share it with HN today. I've been building automation tooling for a few years at prefix.app and one of the messier things both to support and to teach users was around encoding logic in their automations– most folks get a hold of the basic concepts quite easily, but every (visual) automation tool out there seems to have their own way of actually pulling it all together. For small decisions those work great! But for bigger decisions and more complex logic we don’t think it makes much sense to be embedding…
2022 · rulebricks.com · its alternatives →
Also compare
- “Statements and State”, the next chapter of my book on interpreters alternatives
- An Interpreter for Extended Relational Algebra (Scheme Based) alternatives
- Statewright – Visual state machines that make AI agents reliable alternatives
- An Elementary Introduction to the Wolfram Language alternatives
- Vector-logic, a lightweight rules engine from first principles alternatives
- A weekend replication of STOKE, a stochastic superoptimiser alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →