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

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page