出典:Wiktionary
出典:『Wiktionary』 (2026/01/20 19:50 UTC 版)
conjunctive normal form (countable and uncountable, plural conjunctive normal forms)
出典:Wikipedia
出典:『Wikipedia』 (2011/06/28 11:26 UTC 版)
In Boolean logic, a formula is in conjunctive normal form (CNF) if it is a conjunction of clauses, where a clause is a disjunction of literals, where a literal and its complement cannot appear in the same clause. As a normal form, it is useful in automated theorem proving. It is similar to the canonical product of sums form used in circuit theory.