Eight-stage process - conjunctive normal forms, Computer Engineering

Assignment Help:

Eight-stage process - Conjunctive normal forms:

Hence we notice the following eight-stage process converts any sentence with CNF as: 

1.  Eliminate all arrow connectives by rewriting into 

      P ↔ Q    =>   (P  →Q) ^  (Q → P)

      P → Q   =>   ¬P ? Q

2.  Just move ¬ inwards requiring De Morgan's laws in inc. quantifier versions and double

3.  Here rename variables apart: as the same variable name may be reused several times for different variables, contained by one sentence or between several. However to avoid confusion later rename each distinct variable into a unique name. 

4. Now move quantifiers outwards: as the sentence is now in a form whether all the quantifiers can be moved safely to the outside else affecting the semantics, which are provided they are kept in the same order. 

5. Skolemise existential variables  by replacing them into  Skolem constants and functions. But this is similar to the existential elimination rule from the last lecture: as we just substitute a term for each existential variable such are represents the 'something' for that it holds. Suppose if there are no preceeding universal quantifiers the 'something' is a fresh constant. Moreover, if there are then we use a function that takes all these preceeding universal variables as arguments then we're done we just drop all the universal quantifiers. Thus this types  leaves a quantifier-free sentence.


Related Discussions:- Eight-stage process - conjunctive normal forms

Explain cocomo model, A COCOMO model is :- COCOMO:- Constructive Cost Es...

A COCOMO model is :- COCOMO:- Constructive Cost Estimation Model.

Message passing programme development environment, In a multicomputer syste...

In a multicomputer system the computational load amid different processors should be balanced.  To pass information between different nodes message passing technique is used. The p

Determine the minimal sum of products for boolean expression, Determine the...

Determine the Minimal sum of products for the Boolean expression? Obtain the minimal sum of products for the Boolean expression f=(1,2,3,7,8,9,10,11,14,15) using Quine-McCluske

What is artificial intelligence recognition, There are two goals to AI; the...

There are two goals to AI; the major one is to produce an artificial system that is about as good as or good than a human being at dealing with the actual world. The second goal is

Intuitively simple - user friendliness, Intuitively Simple - User Friendlin...

Intuitively Simple - User Friendliness This is the degree to which the system operates in congruence with human operation, in effect the machine does what we naturally think i

Why are high-speed memories required, Q. Why are high-speed memories requir...

Q. Why are high-speed memories required? Is the main memory not a high-speed memory? The answer to second question is absolutely 'No' though why so? Then if memories are slowe

What are parity generator and checker, What are parity generator and checke...

What are parity generator and checker? Ans: While a digital signal is transmitted, this may not be received correctly through the receiver. At the receiving end this may o

Find the boolean expression for boolean algebra, Find the Boolean expressio...

Find the Boolean expression for logic circuit shown in Figure below and reduce it using Boolean algebra. Ans. Y = (AB)' + (A' + B)' = A' + B' + AB' by using Demorgan's Theorem. =

Difference between static and dynamic ram, Static RAM: No refreshing, 6 to ...

Static RAM: No refreshing, 6 to 8 MOS transistors are needed to form one memory cell, Information stored as voltage level in a flip flop. Dynamic RAM: Refreshed periodically, 3

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