Rajiv Gandhi College of Engineering & Research, Nagpur Department of Computer Technology Artificial ntelligence !

"em CT

#$ E%plain the differences &ith e%ample' i( )rocedural !s Declarative *no&ledge$ ii( +or&ard !s ,ac*&ard reasoning$ -$ .rite & e%plain resolution algorithm for predicate logic$ Also e%plain unification algorithm /$ Represent the follo&ing statements in predicate calculus$ Also convert them to e0uivalent clause form' i( All men are mortal$ ii( All )ompeian died &hen volcano erupted in 12 A$D$ iii( No mortal lives longer than #34 yrs$ iv( f someone dies then he is dead at all later times$ v( Alive means not dead$ 5$ .rite a short note on' i( +rames$ ii( "cripts$ 3$ Design a "cript for ta*ing admission into an engineering college$ llustrate all components &ith the help of suita6le 6loc* diagram$ 7$ Design a frame for' i(Chair ii(Ta6le 1$ Represent the follo&ing facts in predicate logic$ #( Everyone is loyal to someone$ -( All Romans &ere either loyal to Caesar or hated him$ /( No mortal lives longer than #74 years$ 5( t8s no& -449$ 3( Amit is soft&are engineer and he is also a singer$ 7( The spouse of every married person in the clu6 is also in the clu6 9$ .rite short notes on #( )rocedural !s Declarative *no&ledge -( :euristic search and com6inatorial e%plosion /( ;ogic programming 5( Control strategy 2$ .hat do you mean 6y semantic net&or*< Dra& a semantic net&or* for the fact' =Rajeev give a 6oo* to "h&eta>$ #4$ .hat is "cript< .rite a script to illustrate the follo&ing' =,oo*ing a tic*et at online reservation counter> ##$ Construct the partitioned semantic net&or* for the follo&ing facts' #( A 6atsman hit a 6all$ -( A 6atsman hits every 6all in a over$ /( Every 6atsman in team ndia hitted every 6all in a over$ #-$ E%plain ?no&ledge Representation & @apping in detail &ith the help of diagram$ #/$ .rite a short note on'A i( "imple Relational ?no&ledge$ ii( nherita6le ?no&ledge$ iii( )rocedural *no&ledge$

#5$ "tate and e%plain ,aye8s Theorem$ #3$ .hat do you mean 6y ?no&ledge Ac0uisition and ?no&ledge !alidation$ #7$ E%plain difference 6et&een procedural and declarative *no&ledge$ #1$ Consider the follo&ing sentences' #( "teve only li*es easy courses$ -( All courses in science department are easy$ /( CB@ /4- is commerce course$ 5( )hysics is a science course$ Convert these facts into predicate logic statements and Clauses$ Cse Resolution to ans&er the follo&ing$ =.hat courses &ould "teve li*e>< #9$ E%plain conceptual dependency in detail #2$ .hat do you mean 6y "emantic Net&or*< Dra& a semantic net&or* for the fact'>Rajeev gives a 6oo* to ranjeet>$ -4$ Construct the partitioned semantic net&or* for the follo&ing facts' #( Every dog has 6itten a mail carrier$ -( Every dog in to&n has 6itten the consta6le$ /( Every dog has 6itten every mail carrier -#$ .hat is "cript< .rite a script to illustrate the follo&ing' =Restaurant> --$ E%plain unification algorithm in detail