boolopt

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

Release history Release notifications | RSS feed

This version

1.1

Feb 21, 2008

1.0

Jul 13, 2006

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

boolopt-1.1.tar.gz (8.2 kB view hashes)

Uploaded Jan 16, 2016 Source

Built Distribution

boolopt-1.1-py2.py3-none-any.whl (9.2 kB view hashes)

Uploaded Jan 16, 2016 Python 2 Python 3

Hashes for boolopt-1.1.tar.gz

Hashes for boolopt-1.1.tar.gz
Algorithm	Hash digest
SHA256	`2afcde1f537c0253773cfc60e55f4aa31eef80553b5c0774efe1cc02a6a323d1`
MD5	`c4e554b635bdd4d44ad68dff2cbc2fc8`
BLAKE2b-256	`8e0bc89751183b447cee69f75851a1bed62c11a5d3674307a21b4e21a9ba4844`

Hashes for boolopt-1.1-py2.py3-none-any.whl

Hashes for boolopt-1.1-py2.py3-none-any.whl
Algorithm	Hash digest
SHA256	`adae4fa5fb6c2139c0c4cd6706d3ef5d380fe37010b49137a11cd6dad621606d`
MD5	`40a4c584cb3ec2400cae85d0b06a4718`
BLAKE2b-256	`b1c634d4c38635cf1140512519618346a966439b0565eb97ff659b8ac4e717d1`