Conjunctive Normal Forms:

However there for the resolution rule to resolve two sentences so they must both be in a normalised format called as conjunctive normal form, that is usually abbreviated to CNF.

Just because this is an unfortunate name thus the sentences themselves are made up of sets of disjunctions. Rather than it is implicitly assumed that the complete knowledge base is a big conjunction of the sentences, that is when conjunctive normal form gets its name. But, CNF is usually a conjunction of disjunctions. Most of the disjunctions are madeup of literals that can either be a predicate or the negation of a predicate like for the negation of a proposition or propositional read a proposition: 

Thus CNF sentences are of the form as: 

(p1 ? p2 ? ... ? pm) ^  (q1?  q2 ? ... ? qn) ^ etc. 

whether each pi and qj  is a literal means that we call the disjunction of that literals a clause. So as a concrete example like, 

likes(george, X)  ? likes(tony, george) ?  ¬ is_mad(maggie) 

that is in conjunctive normal form, so: 

likes(george, X)  ? likes(tony, george)  → ¬ is_mad(maggie) ^  is_mad(tony) 

this is not in CNF.

Posted Date: 1/11/2013 6:16:25 AM | Location : United States

Ask an Expert

Related Discussions:- Conjunctive normal forms, Assignment Help, Ask Question on Conjunctive normal forms, Get Answer, Expert's Help, Conjunctive normal forms Discussions

Write discussion on Conjunctive normal forms
Your posts are moderated

Write your message here..

Related Questions

What is transistor, what is transistor? what is transistor?

Define the edge-triggered flip-flops, Define the Edge-Triggered Flip-flops?... Define the Edge-Triggered Flip-flops? An edge-triggered flip-flop changes states either at the negative edge (falling edge) or at the positive edge (rising edge) of the clock p

What is a turing machine, What is a Turing Machine?  Turing machine is... What is a Turing Machine?  Turing machine is a simple mathematical model of a computer. TM has unlimited an unrestricted memory and is a much more accurate model of a general

Define variants of turing machine, Define variants of Turing Machine?  ... Define variants of Turing Machine?  Variants are  Non deterministic turing machine.  Mutlitape turing  machine.  Enumerators

Define the circular shifts, Q. Define the Circular shifts ? Circular sh... Q. Define the Circular shifts ? Circular shifts ROTATE RIGHT andROTATE LEFT. Bits shifted out at one end of word are not lost as in a logical shift however are circulated back

Explain approaches to identify free memory area in a heap, Discuss two main... Discuss two main approaches to identify free memory area in a heap. Two popular systems to identify free memory areas as a result of allocation and de-allocations in a heap are

Drawbacks of specifying parameter assignments using defparam, The disadvant... The disadvantages of specifying parameter assignments using defparam are: -  Parameter  is  essentially specified  by  the  scope  of  hierarchies  underneath  which  it exists

Salient points about addressing mode, Salient points about addressing mode ... Salient points about addressing mode are:  This addressing mode is employed to initialise value of a variable. Benefit of this mode is that no extra memory accesses are

Why timing signal distributor required, Q. Why Timing Signal Distributor r... Q. Why Timing Signal Distributor required? What do you mean by Memory Cycle? How many Memory Cycles required for following instructions: 1. ADD 2. CLEAR and ADD 3. DC

Define the do while loop, The do while Loop This is very similar to the... The do while Loop This is very similar to the while loop except that the test occurs at the end of the loop body. This guarantees that the loop is executed at least once before