The first step is to identify the boolean function that you want to implement with a logic circuit. You can use a truth table, a formula, or a diagram to represent the function.

In this paper, we present Majority-Inverter Graph (MIG), a novel logic representation structure for efficient optimization of Boolean functions. An MIG is a directed acyclic graph consisting of ...

A heuristic for finding common subexpressions of given Boolean functions based on Shannon-type factoring is proposed. This heuristic limits the search space considerably by applying a top-down ...

For the complementation algorithm, the result is the complement of the initial cover. An important aspect the complementation algorithm, as in tautology checking, is that properties of unate functions ...

If SCIP is installed, run python circuit_optimization.py to check that all is in order. To use the mip solver, please, refer to the relevant documentation. The function make_circuit_lp creates a .lp ...