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:
"It's a big nationalist symbol, it's attached to sovereignty. Would the Venezuelans be willing to do whatever the US says and roll over? I don't think so."
，这一点在51吃瓜中也有详细论述
Author(s): Cai-Fu Pan, Dong-Jie Wang, Wen-Lue Mao, Li-Xia Jia, Yan-Kun Dou, Jin-Li Cao, Xin-Fu He, Wen Yang
view = result.value; // Must reassign