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
what is uml ?

Somehow, the worksheet has external links to files that are no longer around. How can we delete the links? Ans) This happens all of the time to MrExcel. I downloaded a little

Q. Write a program for comparing two strings? Let's write a program for comparing two strings. Determine the following piece of code that has been written in C to compare two s

Explain difference between macro call and macro expansion. Macro expansion: While a macro name is used along with a set of actual parameters this is replaced through a code g

Explanation:- A script within Rational Robot is a file that haves a sequence of SQABasic code. The extension of the file is always ".REC". Syntax [FEATURE] + "_" + [FUNCTION

States briefly the generic framework for e-commerce. Generic framework of e-commerce comprises the Applications of e-commerce (as like banking, shopping within online stores an

Real time (transaction) processing In real time (transaction) processing files are generally updated in real time (for example when booking flights on an airplane); however in

What is index register? In index mode the effective address of the operand is formed by adding a constant value to the contents of a register. The register used might be either

Define Google calendar Google Calendar is free, full featured, and easy to use. It lets the user create both personal and shared calendars, which makes it ideal for tracking bu

Explain the significance IPV6 over IPV4. The maximum size of an Ipv6 datagram is 65575 bytes, with the 0 bytes Ipv6 header. Ipv6 also describe a minimum reassembly buffer size: