Constraint Analysis for Minimization of Multiple Inputs Logic Programming

<p> </p> <p> Minimization of logic functions by computer programs are considered traditionally to be difficult and tedious as the incorporation of full logic negation tends to super-exponential time complexity. The paper presents constrains for minimization of logic circuits. Using these analysis minimized sum of products terms may be generating from any given sum of product terms of multiple input variables. For a new algorithm for minimization using computer programming must be overcome these problem presented. We also discuss the scope heuristic minimization technique over the exact minimization technique.