Canonical Representation

As it turns out, every boolean function can be expressed using at least one boolean expression called
the canonical representation, Starting with the function's truth table, we focus on all the rows in
which the function has value 1. For each such row, we construct a term created by And-ing together literals
(variables or their negations) that fix the values of all the row's inputs.