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

Why sram are said to be volatile, Why SRAM are said to be volatile? Bec...

Why SRAM are said to be volatile? Because their contents are lost when power is interrupted. So SRAM are said to be volatile.

Discuss about os as system software, Discuss about OS as system software? ...

Discuss about OS as system software? OS is a large program or actually a collection of routines that is used to control the sharing of and interaction between various computer

State about an active graphics device, State about An active graphics devic...

State about An active graphics device An active graphics device allows the user to communicate with the computer graphically. Generally, this implies that the user is supplyin

Determine the nand gate, If  the input to T-flipflop is 100 Hz signal, the ...

If  the input to T-flipflop is 100 Hz signal, the final output of the three T-flipflops in cascade is ? Ans. The  final  output  of  the  three  T-flip-flops in cascade is 12

Why is xml such an important development, It takes away two constraints whi...

It takes away two constraints which were holding back Web developments: 1. Dependence on a one, inflexible document type (HTML) which was being much abused for tasks it was neve

Define the operand data types, Operand is that part of an instruction which...

Operand is that part of an instruction which specifies the address of source or result or the data itself on which the processor is to operate. Operand types typically give operand

Calculate width and height of the grid, Given a cell, we must determine its...

Given a cell, we must determine its neighbouring cells i.e. those with which it shares a wall. The cells with an x are the neighbours of the cell c. Write the function getneighbour

Definition of lists, Q. Definition of Lists? Another type of list is a ...

Q. Definition of Lists? Another type of list is a definition list. Definition lists have a heading and text appears below that. EXPERTSMI

What are program-invisible registers, What are program-invisible registers?...

What are program-invisible registers? Ans: the local and global descriptor tables are found in the memory system. To access and specify the address of these tables, program inv

Prolog programming language, Prolog Programming Language : Probably pr...

Prolog Programming Language : Probably programming languages are procedural: than the programmer specifies exactly the right instructions (algorithms) required to get an agent

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