Implicative normal form, Computer Engineering

Implicative normal form:

Thus the sentence is now in CNF. In Fact for simplification can take place by removing duplicate literals and dropping any clause that contains both A and ¬A where one will be true because the clause is always true. However in the conjunction of clauses we want everything to be true than we can drop it. Furthermore there is an optional final step that takes it to Kowalski normal form called as implicative normal form (INF) too aS: 

Although by reintroduce implication by gathering up all the negative literals in the negated ones and forming them in their conjunction N thus taking the disjunction P of the positive literals so forming the logically equivalent clause N  →P. 

There is example for understand: just Converting to CNF. Here we will work through a simple propositional example like: 

(B ? (A ^ C)) → (B?  ¬ A) 

So there is this first thing to do is remove the implication sign as: 

¬ (B?  (A ^ C)) ? (B ? ¬ A)  

Now we use De Morgan's laws just to move our negation sign from the outside to the inside of brackets as: 

(¬ B  ^ ¬ (A^  C)) ? (B ? ¬ A) 

So now we can use De Morgan's law again just to move a negation sign inwards as: 

(¬ B^  ( ¬ A?  ¬ C)) ? (B  ?¬ A) 

And now next we distribute  over  as follows: 

(¬ B ? (B ? ¬ A))  (( ¬ A ? ¬ C) ? (B ? ¬ A)) 

There if we flatten our disjunctions so than we get our sentence into CNF form. Notice here the conjunction of disjunctions: 

(¬ B?  B ? ¬ A)^  ( ¬ A ? ¬ C ?  B ? ¬ A) 

Now the finally first conjunction has ¬B and B, then the whole conjunction must be true that we can remove the duplicate ¬A in the second conjunction also as: 

True ^  (¬ A ? ¬ C ? B) 

So however the truth of this sentence is only dependent on the second conjunct. Then if it is false, the complete thing is false hence it is true for the whole thing is true. Thus we can remove the True through giving us a single clause into its final conjunctive normal form as: 

¬ A ? ¬ C ?B 

There if we want Kowalski normal form we take one more step to get as: 

(A ^ C) → B

Posted Date: 1/11/2013 6:19:18 AM | Location : United States







Related Discussions:- Implicative normal form, Assignment Help, Ask Question on Implicative normal form, Get Answer, Expert's Help, Implicative normal form Discussions

Write discussion on Implicative normal form
Your posts are moderated
Related Questions
Q. Explain Status and Control Registers? For control of numerous operations several registers are used. These registers can't be used in data manipulation though content of som

Q. Write a pseudo code to find sum of two functions? Let's write a pseudo code to find sum of two functions f(A) + f(B). In first algorithm we will not use locking. Process

Write the HTML code for the following table: T E M P E R A T U R E C I T I E S

Sigmoid units: Always remember that the function inside units take as input the weighted sum, S and of the values coming from the units connected to it. However the function i

This branch of AI is concerned with incorporating knowledge from varied disciplines such as biolog neurology psychology mathematics and several linked disciplines. It is typic

Explain the architecture of SS7 . A block schematic diagram of the CCITT no. 7 signaling system is demonstrated in figure. Signal messages are passed by the central proces

write alp to perform bcd addition without using procedure

BIOS - Basic Input Output System, Power On Self Test (POST) and Loading Bootloader from the Hard disk drive Boot Sector is being completed by BIOS. It started the system for

Q. What is Dots per Inch? DPI (Dots per Inch) is a measure for actual sharpness of onscreen image. This relies on both the resolution and size of the image. Practical experienc

Some of the uses of append query are as follows ? You will save time by appending data to an existing table rather than manual update. ? Appending files based on particular