Implicative normal form, Computer Engineering

Assignment Help:

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


Related Discussions:- Implicative normal form

Hashing collision resolution techniques, Hashing collision resolution techn...

Hashing collision resolution techniques are a) Chaining, b) Bucket addressing

Which one state is not a fundamental process state, Which one state is not ...

Which one state is not a fundamental process state? Ans. Blocked state is not a fundamental process state.

By which companding helps in reducing signal, Companding helps in reducing ...

Companding helps in reducing with respect to signal:  (A) Interference                    (B) Signal overloading (C) Non linearity                 (D) Quantization noise

Give the meaning of spc, SPC stands (A)   Standard Protocol Control ...

SPC stands (A)   Standard Protocol Control (B)   Stored Program Control (C)  Signaling and switching Centre (D)  Signaling Process Center Ans: SPC repres

What is managed extensibility framework, What is managed extensibility fram...

What is managed extensibility framework? Managed extensibility framework (MEF) is a new library that is introduced as a part of .NET 4.0 and Silverlight 4. It helps in extendin

How the simulation is done - Weather simulation, How the simulation is done...

How the simulation is done -  Information from the satellites/sensors sent to computer -  This data is compared to information stored on files ..... -  ..... Which contain kno

Define far and near procedures, Q. Define Far and Near Procedures? Proc...

Q. Define Far and Near Procedures? Procedure offers the primary means of breaking the code in a program into modules. Procedures have one maindrawbackwhich is they need extra c

Explain three-way handshake mechanism, Explain Three-Way Handshake Mechanis...

Explain Three-Way Handshake Mechanism used by TCP to terminate a Session reliably. Just to guarantee that connection is sets up or terminated reliably, transfer control protoco

Explain programmer visible registers, Q. Explain Programmer Visible Registe...

Q. Explain Programmer Visible Registers? These registers can be accessed employing machine language. In general we encounter four kinds of programmer visible registers.

Define seek time and latency time, Define seek time and latency time. ...

Define seek time and latency time.  The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wai

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd