ブール関数
The sum of all prime implicants of a Boolean function is called its complete sum, minimal covering sum, or Blake canonical form.