Full resolution rule - artificial intelligence, Computer Engineering

Full Resolution Rule - Artificial intelligence:

Now that we know about unification, we can correctly describe the complete edition of resolution:

p1 ... pj ... pm,     q1 ...qk  ... qn

Subst(θ, p1 ... pj-1 pj+1 ...pm q1 ... qk-1  qk+1 ... qn)

Unify(pj, ¬qk) = θ

This solves literals pj and qk. Note that we get to add ¬ to qk to make it join with pj, so it is in fact pj which is the negative truthful here. The principal is more ordinary than first-order binary resolution in that it allows an arbitrary number of literals in every clause.  Moreover,  θ  is  the  most  common  unifier,  rather  than  an  arbitrary unifying replacement.

To use the principal in practice, we first take a couple of statements and convey them in CNF using the actions defined above. Then we look for two literals, pj and qk for which may search a substitution mu to combine pj and ¬qk. Then we have a disjunction of all the literals (in both sentences) except pj and qk. Finally, we use the substitution θ to the new disjunction to agree on what we have just inferred using resolution.

In the next lecture, we will look at how resolution theorem verification is put into act, counting some example proofs, some heuristics for improving its appearance and some applications.

Posted Date: 10/2/2012 9:33:48 AM | Location : United States







Related Discussions:- Full resolution rule - artificial intelligence, Assignment Help, Ask Question on Full resolution rule - artificial intelligence, Get Answer, Expert's Help, Full resolution rule - artificial intelligence Discussions

Write discussion on Full resolution rule - artificial intelligence
Your posts are moderated
Related Questions
Features of Supply Chain Management Supply Chain Management Consultancy's scope is extensive, and typically contains:  1.  Sales order processing and customer service 2.

(a) What is Grid computing? (b) What are the key distinctions between conventional distributed computing and Grid computing? (b) Describe how five features of Grid Computi

Explain the use of structures with pointers C permits a pointer to a structure variable. In fact a pointer to a structure is same to a pointer to any other variable. The pointe

Discuss about Translation table encryption technique to ensure secured transactions onto the net? Translation table: In this process each chunk of data is used like an of


Example of Bitwise-AND Operator In the following example, the bitwise-AND operator (&) compares the bits of two integers, nNumA and nNumB: // Example of the bitwise-AND oper

Q. Use of Overlapped Register Windows? Register file comprises 138 registers. Let them be called by register number 0 - 137.  Diagram demonstrates the use of registers: when

The octal equivalent of (247) 10 is ? Ans. (247) 10 = (367) 8

Q. Find the Physical address of instruction? Value of Instruction Pointer and holding address of instruction = 1234h Value of code segment register (CS) = 448Ah Physical

Define underflow and overflow. Underflow: If the result the arithmetic operation including n-bit numbers is too small to show by n-bits, underflow is said to occur. Overflow