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

Telnet services, java program for implementation of telnet services

java program for implementation of telnet services

What is booting, What is booting? When the power is turned on, the OS h...

What is booting? When the power is turned on, the OS has to be loaded into the main memory which is taken place as part of a process known as booting. To initiate booting a tin

How many bits must be decoded for 128 × 8 ram chips, How many bits must be ...

How many bits must be decoded for chip select? What is the size of decoder when 128 × 8 RAM chips are required to provide a memory capacity of 2048 bytes? Ans. All higher order l

Appropriate problems for ann learning , Appropriate Problems for ANN learni...

Appropriate Problems for ANN learning - artificial intelligence-  As we did for decision trees, it is essential to know when ANNs are the correct representation scheme for the

Describe set-associative mapping, Q. Describe Set-Associative Mapping? ...

Q. Describe Set-Associative Mapping? A third type of cache organization known as set-associative mapping is an improvement on direct mapping organization in that every word of

Address phase timing - computer architecture, Address phase timing: On...

Address phase timing: On the rising edge of clock 0, the initiator notes IRDY # and FRAME# both high, and GNT# low, so it drives the command, address and asserts FRAME# in tim

Affective functioning - integrated test result, Mr. X's MMPI suggests that ...

Mr. X's MMPI suggests that he either suppresses anger and hostility or has a naturally low level of anger and hostility (O-H=58, ANG=36, TPA=41, AGGR=36). His responses on the PAS

Explain the stack in digital computers, Explain the stack in digital comput...

Explain the stack in digital computers The stack in digital computers is fundamentally a memory unit with an address register which can count only (after first value is loaded

:P, My name is mrs flo and i apporve dubstep, do you apporve it?

My name is mrs flo and i apporve dubstep, do you apporve it?

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