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

Explain time sharing operating system, Explain Time sharing operating syste...

Explain Time sharing operating system. Time sharing: It is also called as multi tasking, is a logical execution of multiprogramming. Multiple jobs are executed through the C

Explain the working of a binary counter, In binary counter the flip flop of...

In binary counter the flip flop of lowest order position is complemented with each pulse. This means that JK input position must be maintained with logic one

C, Write a program to find the area under the curve y = f(x) between x = a ...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Illustarte basic flip-flops, Q. Illustarte Basic Flip-flops? Let's firs...

Q. Illustarte Basic Flip-flops? Let's first see a ordinary latch. A latch or flip-flop can be created employing two NOR or NAND gates. Figure (a) presents logic diagram for S-R

Multiple instruction and multiple data stream (mimd), Multiple Instruction ...

Multiple Instruction and Multiple Data stream (MIMD): In this categorization, numerous processing elements and multiple control units are ordered as in MISD. However the differ

What is sap locking, What is SAP locking? It is a mechanism for describ...

What is SAP locking? It is a mechanism for describing and applying logical locks to database objects.

Call the user methods by creating the object, Make a class library and desc...

Make a class library and describe class 'User'. In User class describe the public, protected and Friend functions. Make a console application andadd a reference to this library and

Example of perceptrons, Example of perceptrons: Here as an example fun...

Example of perceptrons: Here as an example function in which the AND boolean function outputs a 1 only but if both inputs are 1 and where the OR function only outputs a 1 then

Explain control word, What is control word? A control word is a word wh...

What is control word? A control word is a word whose individual bits show the various control signals.

What are parallel algorithms, What are Parallel Algorithms? The central...

What are Parallel Algorithms? The central assumption of the RAM model does not hold for some newer computers that can implement operations concurrently, i.e., in parallel algor

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