CS1502 Formal Methods in Computer Science. Lecture Notes 5 Normal Forms Boolean Logic. Normal Forms. Using logical equivalences , we can transform logical sentences into more standard forms . Important for applications of computers science.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
CS1502 Formal Methods in Computer Science
Lecture Notes 5
(P ^ Q) ^ R P ^ (Q ^ R)
P ^ (Q v R) (P ^ Q) v (P ^ R)
~(P v Q) ~P ^ ~Q
Negation Normal FormNNF
~(~(P ^ Q) v R)
P ^ Q ^ ~R
[(A B) C] (A B) C(A B) C(A B) C NNF, CNF(A C) (B C) NNF,DNF
We will use these normal forms when we do resolution
Cube(a) ^ Small(a) ^ ~Red(a)
CNF: all outside connectives are ^
(each term contains just one literal)
DNF: all inside connectives are ^
(there is just one term)
Gates are Building Blocks of Circuits
And, Xor, Not, Or, Nor, Nand
Not covered, we ran out of time.