Discussion
Which WFF is in CNF form ?
Answer: D
The formula in CNF is (p ∨ q) ∧ (¬r ∨ p).
A formula is in conjunctive normal form when it is a conjunction (AND) of clauses, each clause being a disjunction (OR) of literals, and a literal is a variable or a negated variable. (p ∨ q) and (¬r ∨ p) are both clauses of literals, joined by ∧, so the formula qualifies.
p → q uses the implication connective, which CNF does not allow until it is rewritten as ¬p ∨ q. p ∨ (q ∧ r) has an AND inside an OR, the shape of disjunctive form; its CNF is (p ∨ q) ∧ (p ∨ r). In ¬(p ∧ q) ∨ r the negation applies to a compound expression rather than to a single variable.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development