The truth table of a -order Boolean function has rows. Its disjunctive normal form extracts all rows that return True. The prime implicants for these cases consolidate rules by introducing so-called "don't care" inputs that specify cases that do not depend on the value of a particular input. The minimal disjunctive form of a Boolean function is found by taking the smallest number of prime implicants.