Unification algorithm, Computer Engineering

Assignment Help:

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.


Related Discussions:- Unification algorithm

Dos function calls, INT 21H supports about 100 different functions. A funct...

INT 21H supports about 100 different functions. A function is recognised by putting the function number in AH register. For illustration if we want to call function number 01 then

Explain about hyper-threading, Q. Explain about Hyper-threading? Non th...

Q. Explain about Hyper-threading? Non threaded program instructions are executed in a single order at a time until the program completion. Presume a program have four tasks nam

Network topology, According to the report, network 1 and network 2 are not ...

According to the report, network 1 and network 2 are not able to reach network 3. As shown on OTBNetwork Topology above, OTB Inc. has 2 routing protocols running due transition iss

Displaying a number, Displaying a number Supposing that two digit num...

Displaying a number Supposing that two digit number 59 is stored as number 5 in BH and number 9 in BL to convert them to equivalent ASCII we will add "0" to each one of them.

The void type is used for, The void type is used for  The void type is ...

The void type is used for  The void type is used to make generic pointers.

Explain about different types of mice, Q. Explain about different types of ...

Q. Explain about different types of Mice? Mice can be classified on the foundation of numbers of buttons, position sensing technology or type of Interface:  Sensing Technol

The concept of parallel execution and concurrent , The Concept of Parallel ...

The Concept of Parallel Execution and Concurrent Real world systems are obviously concurrent, and computer science is about modelling the actual world. Examples of actual worl

Explain the working of a three bit binary ripple counter, With the help of ...

With the help of clocked JK flip flops and waveforms, explain the working of a three bit binary ripple counter. Write truth table for clock transitions. Ans. Three-Bit Binary Rip

Which is most general phase structured grammar, Which is most general phase...

Which is most general phase structured grammar? Context – Sensitive is most common phase structured grammar.

Variable or compound expression - unification algorithm, Variable or compou...

Variable or compound expression - Unification algorithm: Here some things to note regarding this method are:  (i) There if really trying to match a constant to a different

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