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

What is delegation, What is Delegation? A delegate acts like a strongly...

What is Delegation? A delegate acts like a strongly type function pointer. Delegates can raise the methods that they reference without making explicit calls to those methods. D

Explain quadratic probing with respect to hashing technique, Quadratic prob...

Quadratic probing: In the above case when the first insertion is made the probability of latest element being inserted in a certain position is 1/n    where n is the size of the a

Determine about the programmable read only memory, Programmable read only m...

Programmable read only memory (PROM) A PROM is a memory chip on which data can be written only one time. Once a program has been written onto a PROM, it's permanent. Unlike RAM

Logical drives is it possible to fit onto a physical disk, How many logical...

How many logical drives is it possible to fit onto a physical disk? Ans) Maximum of 24 logical drives can be fit into physical disk. The extended partition can only have 23 lo

What are the types of pipeline hazards, What are the types of pipeline haza...

What are the types of pipeline hazards? The various pipeline hazards are:  1. Data hazard  2. Structural Hazard  3. Control Hazard.

Show the decimal representation in computers, Binary number system is most ...

Binary number system is most common for computer due to two stable states of its components. However unfortunately this isn't a very natural system for us as we deal with decimal n

What are universal gates, What  are  universal  gates.  Construct  a  lo...

What  are  universal  gates.  Construct  a  logic  circuit  using  NAND  gates  only  for  the expression x = A . (B + C). Ans. Universal Gates: NAND and NOR Gates both are t

What is critical section problem, What is critical section problem? A ...

What is critical section problem? A race condition at data item occurs when many processes simultaneously update its value data consistency, needs that only one process should

Draw a schematic for managing dynamic storage allocation, Draw a simple sch...

Draw a simple schematic for managing dynamic storage allocation. A simple schematic for managing dynamic storage allocation is as follows: Block size pointe

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