Skip to main content

Boolean expression minimizer

Project description

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.

Project details


Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page