Blake canonical form

Karnaugh map of AB + BC + AC, a sum of all prime implicants (each rendered in a different color). Deleting AC results in a minimal sum.
ABD + ABC + ABD + ABC
ACD + BCD + ACD + BCD
Boolean function with two different minimal forms. The Blake canonical form is the sum of the two.

In Boolean logic, a formula for a Boolean function f is in Blake canonical form (BCF),[1] also called the complete sum of prime implicants,[2] the complete sum,[3] or the disjunctive prime form,[4] when it is a disjunction of all the prime implicants of f.[1]

  1. ^ a b Cite error: The named reference Brown_2012 was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference Sasao_1996 was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference Kandel_1998 was invoked but never defined (see the help page).
  4. ^ Cite error: The named reference Knuth_2011 was invoked but never defined (see the help page).