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
i want an assignment on application of integraton and my topc of assifment is area under the curve includin solved examples

How can i made Carnot engine

In order to suppress the leading zeroes of a number field the which keywords is used ? NO-ZERO.


Explain High Level Data Link Control. HDLC - it is High Level Data Link Control: Protocol Overall explanation: Layer 2 of the OSI model is the data link layer. One of the

Q. why we need Web Browser? A Web browser is software program which allows you to easily display Web pages and navigate the Web. The first graphical browser, Mosaic, was develo

Translate the following sentences into predicate logic, using Russell's theory of definite descriptions to represent the article the. a. The wizzard of Oz fell. b. Everyone a

What is a Table attribute? The table's attributes verifies who is responsible for maintaining a table and which types of access are permitted for the table.  The most signific

Q. How to Information transfer from one register to another? Information transfer from one register to another is designated in symbolic notation by a replacement operator. For

Returns the information about tasks running int info = pvm_tasks( int where, int *ntask, struct pvmtaskinfo **taskp ) struct pvmtaskinfo {  int ti_tid; int ti_pt