Example of unification, Computer Engineering

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.

Posted Date: 1/11/2013 6:20:35 AM | Location : United States







Related Discussions:- Example of unification, Assignment Help, Ask Question on Example of unification, Get Answer, Expert's Help, Example of unification Discussions

Write discussion on Example of unification
Your posts are moderated
Related Questions
Basic Operational Concepts of a Computer: Most of computer operations are executed in the ALU (arithmetic and logic unit) of a processor. For an example: to add 2 numb

What is a Diagonalization language LD?  The  diagonalization  language  having  of  all  strings  w  such  that  the  TM  whose  code is w does not accept when w is given as in

Instruction Cycle The instruction cycle consists of a series of steps needed for the implementation of an instruction in a program. A typical instruction in a program is descri

COM add-ins are software program's which are included into an application and they add already built in features to an existing application. They have general architecture across m

Explain briefly Loop-invariant code motion of the commonly used code optimization techniques. Loop-invariant code motion If a quantity is calculated inside a loop duri

How to use ActiveX Control in .Net ? ActiveX control is a special type of COM component that handles a User Interface. Using ActiveX Control in your .Net Project is even simple

Suppose we have an array-based list A[0..N - 1] and we want to delete all duplicates. LastPosition is initially N - 1, but gets smaller as elements are deleted. Consider the pseudo

Define Handshaking. Handshaking is a method commonly used to accompany ever data item being transfer with the control signal that show the presence of data in the bus. The unit

Illustrate about object oriented development object oriented development is not direct way of system development as in this approach a holistic view of application domain is co

During the Persian Gulf crisis of 1991, U .S forces deployed a Dynamic Analysis and Re planning Tool, DART ( Cross and Walker, 1994) to do automated logistics planning and schedu