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
In a raw Itanium, a 'Processor Abstraction Layer' (PAL) is incorporated in system. When it's booted PAL is loaded in the CPU and provides a low-level interface which abstracts a nu

Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.

what is computer

Q. Amdahl Law to measure speed up performance? Remember that speed up factor assists us in knowing relative gain attained in shifting execution of a task from sequential comput

Specifying the Problem: Now next here furtherly we now use to look at how you mentally constructed your decision tree where deciding what to do at the weekend. But if one way

Some famous projects on cluster computing are as follows: High Net Worth Project: (developed by: Bill McMillan, JISC NTI/65 - The HNW Project, University of Glasgow, The prim

Explain the term- Hacking    Use of passwords and ids to prevent illegal access to files. Also locking the computer itself or locking computer room can help here. Encryption s

Q. How to Create a Rollover Image? A rollover image is an image whose display changes when pointer passes ('rolls') over it. You will use Dreamweaver's Insert Rollover Image co

Q. VLSI Implementation of Control Unit? A main potential advantage of RISC is VLSI implementation of microprocessor. VLSI Technology has decreased the delays of transfer of inf

Line A Line is, on a simple level, a mark connecting 2 points. However, how lines are used in an image is extremely important. By varying the quality of line used in an image,