Skip to main content

This module optimizes propositional logic (“boolean expressions”, in programming language terms). Given an AST in the form of tagged tuples, it produces an equivalent disjunctive-normal formula that is minimal.

For the curious and bored, it uses the Quine-McCluskey algorithm.

Metadata

Release history Release notifications | RSS feed

1.1

2 release files

This release

1.0 This release

Anthropic, PBC Visionary sponsor Bloomberg Visionary sponsor Hudson River Trading Visionary sponsor Meta Visionary sponsor NVIDIA Visionary sponsor Microsoft Sustainability sponsor Depot Continuous Integration AWS Cloud computing and Security Sponsor Datadog Monitoring Fastly CDN Google Download Analytics Sentry Error logging StatusPage Status page