. . . . . . . "In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. As a normal form, it is useful in automated theorem proving."@en . . . . . . "6194"^^ . . . . "In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. As a normal form, it is useful in automated theorem proving."@en . . "1048937265"^^ . . . . . . . . . . . . . . . . . . "73341"^^ . . . . "Disjunctive normal form"@en . . . . . . . . . . . . .