There is a special form for boolean formulas called "Conjunctive Normal Form" (CNF). A problem in this form consists of clauses connected with and operators, where each clause only contains variables connected with or operators. The variables can appear negated, but only variables can be directly negated, something like !(a && b) is not allowed. An example boolean formula in CNF form is:
圖像來源，Getty Images
。夫子对此有专业解读
CreditsHosts: Devindra Hardawar and Igor Bonifacic
Replay started with initial input: {