CS-14 Intelligent Systems Dec-2004
Q.5(a) Trace the operation of unification algorithm on each of the following paris of literals
(i) f(Marcus) & f(Caesar)
(ii),f(x) and f(g(y))
(iii) f(Marcus, g(x,y)) and f(x, g(Caesar, Marcus))
(b) Differentiate between the follwing :
(i) Associative network and Conceptual graph
(ii) Frame and Script
© Elaborate the meaning of the following conceptual dependency primitive actions:
(i)MTRANS
(ii) ATTEND
(iii) INGEST
(iv) PROPEL
(v) EXPEL
(vi) MBUILD
(d) Check whether or not ((R→S) & ~ S) → ~ R is a tautology.

