X

CNF meaning in Computing ?

( 5 )  .  1 Rating
770 views   .  0 comments  .   . 

Download Solution PDF

Answer: What is Conjunctive Normal Form mean?

In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is a product of sums or an AND of ORs. As a canonical normal form, it is useful in automated theorem proving and circuit theory.

All conjunctions of literals and all disjunctions of literals are in CNF, as they can be seen as conjunctions of one-literal clauses and conjunctions of a single clause, respectively. As in the disjunctive normal form (DNF), the only propositional connectives a formula in CNF can contain are and, or, and not. The not operator can only be used as part of a literal, which means that it can only precede a propositional variable or a predicate symbol.

In automated theorem proving, the notion "clausal normal form" is often used in a narrower sense, meaning a particular representation of a CNF formula as a set of sets of literals.

reference

Take Quiz To Earn Credits!

Turn Your Knowledge into Earnings.




Give Rating
Report
Write Your Comments or Explanations to Help Others
Comments(0)





Miscellaneous in Computing
Miscellaneous in Computing

Ever curious about what that abbreviation stands for? fullforms has got them all listed out for you to explore. Simply,Choose a subject/topic and get started on a self-paced learning journey in a world of fullforms.

Explore Other Libraries

X

Important Computing Links





Copyright (c) 2021 TuteeHUB

OPEN APP
Channel Join Group Join