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

Explain the violating basic security principles, Explain the violating basi...

Explain the violating basic security principles There are drawbacks to permitting users to access the Intranet as well as not permitting them. A simple consideration such as a

Define grid computing, GRID COMPUTING Grid Computing signifies applying...

GRID COMPUTING Grid Computing signifies applying resources of different computers in a network concurrently to a single problem for solving a scientific or technical problem wh

Explain virtual memory, In a memory hierarchy system, data and programs are...

In a memory hierarchy system, data and programs are first stored in secondary or auxiliary memory. Program and its related data are brought in main memory for execution. What if th

Illustrate benefits of register addressing mode, Q. Illustrate benefits of ...

Q. Illustrate benefits of register addressing mode? The key benefits of register addressing are: Register access is faster than memory access and henceforth register add

What is set screen, SET SCREEN With SET SCREEN the present screen simpl...

SET SCREEN With SET SCREEN the present screen simply specifies the next screen in the chain , control branches to this next screen  as soon as the current screen has been proce

What is function scope, What is Function scope Function scope: A labe...

What is Function scope Function scope: A label is the only part of identifier that has function scope. A label is declared implicitly by its use in a statement. Label names m

How can arithmetic processor be associated to the CPU, Q. How can this arit...

Q. How can this arithmetic processor be associated to the CPU?  Two mechanisms are used for connecting arithmetic processor to CPU.   If an arithmetic processor is treated a

Dataset accept changes and data adapter update method, Explain Dataset Acce...

Explain Dataset Accept Changes and Data Adapter Update methods?  Data Adapter Update method Calls the respective INSERT, UPDATE, or DELETE statements for every inserted, update

Explain the different sub-functions of process scheduling, Explain the diff...

Explain the different sub-functions of Process Scheduling. Process scheduling contains the subsequent sub-functions: 1. Scheduling: Chooses the process to be executed next

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