In Boolean logic, a formula is in conjunctive normal form (CNF) when it is an AND of ORs, essentially a conjunction of clauses where each clause is a disjunction of literals. A CNF formula can only contain the propositional connectives: and, or, and not, with the not operator only preceding a variable or predicate symbol. This form is valuable in automated theorem proving and circuit theory, with "clausal normal form" sometimes referring to a specific representation of a CNF formula.
Brown University
Spring 2023
CSCI 0220 provides a foundation in discrete math and probability theory. Key topics include logic, set theory, number theory, combinatorics, graph theory, and probability. No prior math background assumed. Aims to develop problem solving, communication, and collaboration skills. Introduces new concepts and ways of thinking to enable analyzing problems arising in computer science. Beginner-friendly introduction to core mathematical concepts underlying many aspects of CS.
No concepts data
+ 26 more concepts