In boolean logic, a disjunctive normal form (DNF) is a 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. The disjunctive normal form and its counterpart, the conjunctive normal form, are the most common standardized ways of representing boolean expressions.
In boolean logic, a disjunctive normal form (DNF) is a 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. The disjunctive normal form and its counterpart, the conjunctive normal form, are the most common standardized ways of representing boolean expressions.
Source: Wikipedia "Disjunctive normal form" · CC BY-SA 4.0
Share this article: X · Bluesky