Full resolution rule - artificial intelligence, Computer Engineering

Assignment Help:

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.


Related Discussions:- Full resolution rule - artificial intelligence

How non- textual information is contained in a web page, How non- textual i...

How non- textual information is contained in a web page? Non-textual information as digitized photo and a graphics image is not inserted directly into a HTML document. In place

Power supply in computer system, Q. Power supply in computer system? Co...

Q. Power supply in computer system? Computer operate electronically- either by power supply attained from your electric plug or batteries in case of portable computers. Though

Minimum and maximum algorithm, For this assignment, you will need to create...

For this assignment, you will need to create an ARM assembly language code routine that implements an algorithm to search through an array and find BOTH the minimum and maximum val

Assembly 8086 program that computes the minimum and maximum, Write a progra...

Write a program that computes the minimum and maximum of elements in an array in Assembly 8086.

Simple instruction formats, Simple instruction formats: RISC uses simpl...

Simple instruction formats: RISC uses simple instruction formats. Usually only one or a few instruction formats are used. In these machines instruction length is fixed and alig

What is a priority interrupt, What is a Priority Interrupt? A priority ...

What is a Priority Interrupt? A priority interrupt is an interrupt that establishes a priority over the various sources to determine which condition is to be serviced first whe

What is directory, What is Directory?   The device directory or simply ...

What is Directory?   The device directory or simply called as directory records information-such as name, location, size, and type for all files on that certain partition. The

By using what nested macro calls are expanded, Nested Macro calls are expan...

Nested Macro calls are expanded using the? Ans. By using the LIFO (Last in First out) Nested Macro calls are expanded.

Explain operation of time multiplexed space switching, With a neat diagram ...

With a neat diagram explain operation of time multiplexed space switching. Time division switches, an inlet or an outlet corresponded to a particular subscriber line with one s

Describe about the desk top publishing, Desk Top Publishing (DTP) As wo...

Desk Top Publishing (DTP) As word processors develop increasingly more sophisticated features, differences with desk top publishing (DTP) packages becomes more and more blurred

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