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:
Get our breaking news email, free app or daily news podcast
，推荐阅读旺商聊官方下载获取更多信息
更多详细新闻请浏览新京报网 www.bjnews.com.cn
ITmedia�̓A�C�e�B���f�B�A�������Ђ̓o�^���W�ł��B
"We're now busy building a line-up of some of the world's most loved artists to perform live for tens of thousands of people in the park, as well as for millions of listeners and viewers at home or on the move."