Logic Minimizer is an innovative, versatile application for simplifying Karnaugh maps and Boolean expressions step-by-step. It is geared for those involved in engineering fields, more precisely digital logic scholars and academics, digital devices constructors or anybody involved with Boolean expressions. With its powerful minimization capabilities and full-fledged features, Logic Minimizer allows you to work with all forms of Boolean expressions.

Features:
→ Minimize Karnaugh Map up to 8 variables
→ Step-by-step simplification of Boolean expressions up to 26 variables (A-Z) using Boolean algebra laws and theorems
→ Step-by-step simplification of Boolean functions up to 8 variables by the Quine-McCluskey algorithm, showing the prime implicant chart and using Petrick’s method where appropriate
→ Multi-Output minimization up to 8 inputs and 8 outputs, using the de-facto industry standard Espresso algorithm
→ View minimized solutions on Karnaugh Map in Sum-of-Products (SOP/CNF) and Product-of-Sums (POS/DNF) forms
→ Supports Don’t Cares
→ Fill Karnaugh map with truth table, sets of terms and Boolean expressions
→ Search for all equivalent solutions for Karnaugh Maps up to 4 variables
→ Guaranteed minimal solution when using the Karnaugh Map, Quine–McCluskey and Algebraic Minimizer
→ Highlight minimized term on Karnaugh Map
→ Complete optimization of simplified Boolean formula with XOR gates
→ Generate logic circuits from minimized solution using AND/OR, NAND and NOR gates
→ Generate random Karnaugh maps, truth tables and Boolean expressions
→ Support ALL Boolean operators and constants
→ Fully customizable Karnaugh map orientation, variable names, operator symbols and expression format
→ Import/Export Karnaugh maps as CSV files
→ Supports Dark Mode