Example of unification, Computer Engineering

Assignment Help:

Example of Unification:

Let now here, assume instead that we had these two sentences as: 

knows(john,X) → hates(john, X) 

knows(jack, mary) 

Thus here the predicate names have not changed so rather than the arguments are holding us back from making any deductive inference is just as a first case as above given, whether we could allow the variable X to be instantiated to mary through the deduction if so then the constant john just before and after the deduction also matched without problem. Hence moreover there in the second case we see that although we could still instantiate X to mary but there we could no longer match john and jack means that they are two different constants. Just for the same we cannot deduce anything about john or anybody else from the latter two statements of course. 

There is usually the problem comes from our inability just to make the arguments in knows(john, X) and the arguments in like knows(jack, mary) is match up. Here if notice for instance where we can make two predicates match up than we say that there we have  unified  them so we will look at an algorithm for unifying two predicates if they can be unified in this section. Furthermore remember there that unification plays a part in the way Prolog searches for matches to queries.


Related Discussions:- Example of unification

Illustration to demonstrate design of sequential circuits, Q. Illustration ...

Q. Illustration to demonstrate design of sequential circuits? Let us take an illustration to demonstrate above process. Suppose we want to design 2-bit binary counter employing

What is ale and explain the functions of ale in 8085, ALE-> Address latch e...

ALE-> Address latch enable...In the case of microcontroller (8051)& microprocessor 8085 the data line and low order 8 bit address lines are multiplexed. In order to getting address

State and prove demorgan's second theorem, State and prove Demorgan's secon...

State and prove Demorgan's second theorem   Proof: Demorgan's second theorem   = A‾ + B‾ The two sides of the equation here   = A‾ + B‾ is represented through the logic d

When can a user program execution be interrupted, When can a user program e...

When can a user program execution be interrupted? It won't be desirable to interrupt a program when an instruction is being executed and is in a state such as instruction decod

Determine the address when network address prefixed by 1000, A network addr...

A network address prefixed by 1000 is? A network address prefixed through 1000 is Class B address.

Learning algorithm for multi-layered networks, Learning algorithm for multi...

Learning algorithm for multi-layered networks: Furthermore details we see that  if S is too high, the contribution from w i * x i is reduced. It means that t(E) - o(E) is mu

Existential introduction, Existential Introduction: Now if we have any...

Existential Introduction: Now if we have any sentence as, A, and variable, v, that does not occur in A, so then for any ground term, g, such occurs in A, than we can turn A in

Explain the daa instruction, Explain the DAA DAA instruction follows th...

Explain the DAA DAA instruction follows the ADC or ADD instruction to adjust the result into a BCD result. DAA instruction functions only with the AL register, this addition sh

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