Question: (a) Given any propositional boolean formula, one can always convert it into CNF by using the following three rules: (a = -b) + (a Vb)^(-a

(a) Given any propositional boolean formula, one can always convert it into CNF by using the following three rules: (a = -b) + (a Vb)^(-a V-b) (a = b^c) + (a V-6 V-c) A(-a Vb)^(-a Vc) (a = b Vc) (VbVc)^(a V-b) A (a V -c) Clearly show that how to convert the following boolean formula into CNF by using the rules above. (1022) V (13 432) (a) Given any propositional boolean formula, one can always convert it into CNF by using the following three rules: (a = -b) + (a Vb)^(-a V-b) (a = b^c) + (a V-6 V-c) A(-a Vb)^(-a Vc) (a = b Vc) (VbVc)^(a V-b) A (a V -c) Clearly show that how to convert the following boolean formula into CNF by using the rules above. (1022) V (13 432)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
