Boolean expression minimizer
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.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Hashes for boolopt-1.1-py2.py3-none-any.whl