Jisho

×
加法標準形
Links
Wikipedia definition
1. Disjunctive normal form​In boolean logic, a disjunctive normal form (DNF) is a standardization (or normalization) of a logical formula which is a disjunction of conjunctive clauses. As a normal form, it is useful in automated theorem proving. A logical formula is considered to be in DNF if and only if it is a disjunction of one or more conjunctions of one or more literals. A DNF formula is in full disjunctive normal form if each of its variables appears exactly once in every clause.
Read “Disjunctive normal form” on English Wikipedia
Read “加法標準形” on Japanese Wikipedia
Read “Disjunctive normal form” on DBpedia

Discussions

to talk about this word.