Unification algorithm, Computer Engineering

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 that we write V/T to signify in which we have substituted term T for variable V as read the "/" sign as "is substituted by". So now here our purpose of this algorithm will be to produce a substitution as a set of pairs V/T for a given pair of sentences. Here notice for instance example like the output for the pair of sentences as: 

 knows(john,X) 

knows(john, mary) 

will be: {X/mary}. Whether for the two sentences above involving jack and the function should fail as there was no way to unify the sentences. 

  • Thus if notice for describe instance the algorithm we use to simplify some functions it calls internally as.

  There the function isa_variable(x) checks where x is a variable. 

  • And another function isa_compound(x) checks whether x is a compound expression:

Here if we considered for instance that either a predicate or type a function or a connective usually contains subparts. Hence the subparts of a predicate or function are the arguments. Now there subparts of a connective are the things it connects. In fact we write  args(x)  for the subparts of compound expression x. So always remember that args(x) outputs a list: as the list of subparts.

Posted Date: 1/11/2013 6:21:15 AM | Location : United States







Related Discussions:- Unification algorithm, Assignment Help, Ask Question on Unification algorithm, Get Answer, Expert's Help, Unification algorithm Discussions

Write discussion on Unification algorithm
Your posts are moderated
Related Questions
CIH, also known  as Chernobyl or Spacefiller, is a Microsoft Windows computer virus which first emerged in 1998. It is one of the most damaging viruses, overwriting critical inform

General principles of pruning: The general principles are such that: 1. Given a node N that can be chosen by player one, thus if there is another node, X, along any path,

For executing recursive function the data structure used is: For executing recursive function, stack is used as a data structure.

Explain briefly Common sub expression elimination of the commonly used code optimization techniques. Common sub expression elimination: In given expression as "(a+b)-(

Differentiate Traditional Commerce verses Electronics Commerce. Identity: Into traditional commerce customers can simply authenticate the identity of a merchant simply throug

write an assembly language program for fibonacci series?

FACSIMILE : This is often known as 'fax' and it represents the interface between reprographic and computer technology. By using fax, the contents of a sheet of paper (text or illu

Describe generic framework for electronic commerce Generic Framework for electronic commerce contains the Applications of EC   (like as banking, shopping in online stores and m

For the sake of trying to make intelligent behavior though really all that's being done is work with artificial neural networks where every cell is a very easy processor and the go

What is a Turing Machine?  Turing machine is a simple mathematical model of a computer. TM has unlimited an unrestricted memory and is a much more accurate model of a general