Processes boolean functions which can be provided either as a list of 0s and 1s or which can be provided as a formula in first-order logic (using disjunctive or conjunctive normal forms). Internally the Quine McCluskey algorithm is used.

Project Activity

See All Activity >

License

GNU General Public License version 2.0 (GPLv2)

Follow The Boolfreak Minimizer

The Boolfreak Minimizer Web Site

Other Useful Business Software
Cloud-based help desk software with ServoDesk Icon
Cloud-based help desk software with ServoDesk

Full access to Enterprise features. No credit card required.

What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of The Boolfreak Minimizer!

Additional Project Details

Languages

English

Intended Audience

Advanced End Users, Developers, Information Technology, Science/Research

User Interface

Command-line

Programming Language

Java, Python

Related Categories

Python Electronic Design Automation (EDA) Software, Java Electronic Design Automation (EDA) Software

Registered

2006-09-19