Eight-stage process - conjunctive normal forms, Computer Engineering

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.

Posted Date: 1/11/2013 6:17:44 AM | Location : United States







Related Discussions:- Eight-stage process - conjunctive normal forms, Assignment Help, Ask Question on Eight-stage process - conjunctive normal forms, Get Answer, Expert's Help, Eight-stage process - conjunctive normal forms Discussions

Write discussion on Eight-stage process - conjunctive normal forms
Your posts are moderated
Related Questions
Parallel computing has been a topic of interest in computing society over the previous few decades. Ever-growing amount of databases and increasing complexity of new problems are

Explain the term- Scan Insertion Scan Insertion is completed by a tool and results in all (or most) of your design's flip-flops to be changed by special "Scan Flip-flops". Sca

Likewise to arrays but is preferred over an array due to of the following reasons. 1. A collection objects uses less Memory than an array. 2. It gives methods to add and dele

Explain the differences between Paging and segmentation. Paging and segmentation P aging Segmentation Computer memory is separa

Businesses are interested in AI because of the characteristics it offers that no other systems type offers. That is AI ability to: a. Preserve Intelligence and Knowledge: C

What are the two ways of constructing a larger module to mount flash chips on a small card? The two ways are:- a) Flash cards b) Flash drivers.

Canonical Genetic Algorithm: In such a scenario with all search techniques there one of the first questions to ask along with GAs is how to define a search space that is actua

A disk drive with removable disks is known as removable drive. A removable disk can be replaced by other similar disk on same or different computer so providing huge data storage w

Convert the binary number 10110 to Gray code ? Ans. For changing binary number 10110 in its equivalent Gray code the rules are as, the left most bit that is MSB in Gray code is 1

Q. Show the example of internet address? The following can be a typical person understandable address on Internet: VVS @ expertsmind.us VVS is an username which in gene