Unification - artificial intelligence, Computer Engineering

Assignment Help:

Unification - Artificial intelligence:

We have said that the laws of inference for propositional logic detailed in the previous lecture can also be used in first-order logic. However, we have to clear that a little. One important distinction between propositional and first-order logic is that the latter has predicates with expressions as arguments. So, one explanation we have to form is that we may use the inference lawsas long as the predicates and Arguments match up. That's why, not only do we have to check for the right kinds of sentence before we may carry out a law of inference, we also need to check that the arguments do not prohibit the inference.

For instance, let it in our knowledge base, we have the these two statements:

Knows (john) -> hates(john, X)

Knows(john, marry)

and we need to use the Modus Ponens law to infer something latest. In this case, there is no difficulty, and we may infer that, because john hates everybody  he knows, and he knows Mary, then he should hate Mary, i.e., we may infer that hates(john, mary) is right.

However, let it instead that we had these two sentences:

knows(john,X) -> hates(john, X)

knows(jack, mary)

Here, the predicate names have not altered, but the arguments are handling us back from forming any deductive inference. In the first case above, we might allow the variable X to be instantiated to marry during the assumption, and the constant john before and after the assumption also matched without error. However, in the second case, although we might still instantiate X to marry, we could no longer match john and jack, because they are two dissimilar constants. So we cannot deduce anything for john (or anyone else) from the latter two statements.

The problem here arises from our incapability to make the arguments in knows(john, X) and the arguments in knows(jack, marry) match up. When we may make two predicates match up, we say that we have combined them, and we will look at an algorithm for unifying two predicates (if they can be combined) in this section. Remember that unification acts a part in the way Prolog searches for matches to queries.


Related Discussions:- Unification - artificial intelligence

Define range which a normalised mantissa can signify, Now let's define rang...

Now let's define range which a normalised mantissa can signify. Let's presume that our present representations has normalised mantissa so left most bit can't be zero so it has to b

What is bus arbitration, What is bus arbitration? It is method by which...

What is bus arbitration? It is method by which the next device to become the bus master is selected and bus mastership is transferred to it. There are two ways for doing this:

Deta sturcture, algorithm of travalling salesman problam

algorithm of travalling salesman problam

What is deadlock in operating system, Explain Deadlock in operating system ...

Explain Deadlock in operating system ? Deadlock: all process in a set of processes is waiting for an event which only a process in the set can cause.

Full resolution rule - artificial intelligence, Full Resolution Rule - Arti...

Full Resolution Rule - Artificial intelligence: Now that we know about unification, we can correctly describe the complete edition of resolution: p1  ∨ ...  ∨ pj  ∨ ...  ∨ p

Unification algorithm, Unification Algorithm: Here if notice for insta...

Unification Algorithm: Here if notice for instance that to unify two sentences as we must find a substitution that makes the two sentences the same. Furthermore remember there

Example multi-layer ann with sigmoid units, Example Multi-layer ANN with Si...

Example Multi-layer ANN with Sigmoid Units - Artificial intelligence: We will discuss ourselves here with ANNs containing only 1 hidden layer, as this makes describing the back

Describe in brief the history of e-commerce, Describe in brief the history ...

Describe in brief the history of E-Commerce.  History of E-commerce. E-commerce started before personal computers were prevalent and has grown into a multi-billion d

#chemistry, Please explain the construction and working of calomel electrod...

Please explain the construction and working of calomel electrode..

Illustrate layout of magnetic disk, Q. Illustrate Layout of Magnetic Disk? ...

Q. Illustrate Layout of Magnetic Disk? Head is a relatively small device capable of reading from or writing to a part of platter rotating beneath it. This gives rise to organiz

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