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 do you mean by data warehousing, What do you mean by data warehousing?...

What do you mean by data warehousing? Data warehouse implies as: a) It is subject oriented b) It is integrated and c) It is time variant d) It is non-volatile colle

Returns the information about tasks running, Returns the information about ...

Returns the information about tasks running int info = pvm_tasks( int where, int *ntask, struct pvmtaskinfo **taskp ) struct pvmtaskinfo {  int ti_tid; int ti_pt

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

what is a persistent cookie in php, A persistent cookie is a cookie which ...

A persistent cookie is a cookie which is keeps in a cookie file permanently on the browser's computer. By default, cookies are formed as temporary cookies which keep only in the br

Explain register addressing mode, Q. Explain Register Addressing Mode? ...

Q. Explain Register Addressing Mode? Operand can be a 16-bit register: Addressing Mode Description Example AX, BX, CX, DX, SI,

What are the role of an operating system, What are the role of an operating...

What are the role of an operating system? Sharing the Processor Virtual Machine: Resource management: Memory Management

Binary resolution - artificial intelligence, Binary Resolution: We look...

Binary Resolution: We looked at unit resolution (a propositional inference law) in the last lecture: A ∨ B,   ¬B /A We may have this a bit further to propositional bin

Difference between the testing and verification, Difference between the tes...

Difference between the testing and verification. Verification proves conformance with a specification. Testing tries to find cases where the system does not meet its specifi

How a physical addressing is performed in wan, How physical addressing is p...

How physical addressing is performed in WAN? WAN networks operate as similar to a LAN. All WAN technology classifies the exact frame format a computer uses while sending and re

Describe the necessary conditions for deadlock, Describe the necessary cond...

Describe the necessary conditions for Deadlock. Required conditions for deadlock 1. Mutual exclusion 2. Hold and wait 3. No preemption 4. Circular wait Mutual e

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