GUJARAT TECHNOLOGICAL UNIVERSITY - cms.laxmi.edu.in · Approved by AICTE, New Delhi; Affiliated to Gujarat Technological University, Ahmedabad Academic Year 2018-19 Centre Code: 086

GUJARAT TECHNOLOGICAL UNIVERSITY

COMPUTER ENGINEERING/INFORMATION TECHNOLOGY

ARTIFICIAL INTELLIGENCE

SUBJECT CODE: 2180703 SEMESTER: 8

Type of course: Regular

Prerequisite: Data Structures, Mathematics

Rationale: With the usage of Internet and World Wide Web increasing day by day, the field of AI and its techniques are being used in many areas which directly affect human life. Various techniques for encoding knowledge in computer systems such as Predicate Logic, Production rules, Semantic networks find application in real world problems. The fields of AI such as Game Playing, Natural Language Processing, and Connectionist Models are also important. Student should know some programming language for AI.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

Marks

L T P C

Theory Marks Practical Marks

ESE

(E)

PA (M) ESE (V) PA

(I) PA ALA ESE OEP

4 0 2 6 70 20 10 20 10 20 150

Content

Sr

No

Course Contents Teaching

hours

Weightage

1 What is AI? : The AI Problems, The Underlying Assumption, What

Is An AI Techniques, The Level Of The Model, Criteria For Success,

Some General References, One Final Word.

2 4

2 Problems, State Space Search & Heuristic Search Techniques :

Defining The Problems As A State Space Search, Production Systems,

Production Characteristics, Production System Characteristics, And

Issues In The Design Of Search Programs, Additional Problems.

Generate-And-Test, Hill Climbing, Best-First Search, Problem

Reduction, Constraint Satisfaction, Means-Ends Analysis.

5 10

3 Knowledge Representation Issues : Representations And Mappings,

Approaches To Knowledge Representation.

3 5

4 Using Predicate Logic : Representation Simple Facts In Logic,

Representing Instance And Isa Relationships, Computable Functions

And Predicates, Resolution.

4 8

5 Representing Knowledge Using Rules : Procedural Versus

Declarative Knowledge, Logic Programming, Forward Versus

Backward Reasoning.

4 8

6 Symbolic Reasoning Under Uncertainty : Introduction To Non-

monotonic Reasoning, Logics For Non-monotonic Reasoning.

4 8

7 Statistical Reasoning : Probability And Bays’ Theorem, Certainty

Factors And Rule-Base Systems, Bayesian Networks, Dempster-

Shafer Theory, Fuzzy Logic.

3 5

8 Weak Slot-and-Filler Structures : Semantic Nets, Frames. 3 5

9 Strong Slot-and-Filler Structures : Conceptual Dependency,

Scripts, CYC

3 5

10 Game Playing: Overview, And Example Domain : Overview,

MiniMax, Alpha-Beta Cut-off, Refinements, Iterative deepening,

The Blocks World, Components Of A Planning System, Goal Stack

Planning, Nonlinear Planning Using Constraint Posting, Hierarchical

Planning, Reactive Systems, Other Planning Techniques.

6 12

11 Understanding: What is understanding? , What makes it hard?, As

constraint satisfaction

2 4

12 Natural Language Processing : Introduction, Syntactic Processing,

Semantic Analysis, Semantic Analysis, Discourse

And Pragmatic Processing, Spell Checking

5 8

13 Connectionist Models : Introduction: Hopfield Network, Learning

In Neural Network, Application Of Neural Networks, Recurrent

Networks, Distributed Representations, Connectionist AI And

Symbolic AI.

4 6

14 Introduction to Prolog : Introduction To Prolog: Syntax and

Numeric Function, Basic List Manipulation Functions In Prolog,

Functions, Predicates and Conditional, Input, Output and Local

Variables, Iteration and Recursion, Property Lists and Arrays,

Miscellaneous Topics, LISP and Other AI Programming Languages.

8 12

Reference Books:

1 “Artificial Intelligence” -By Elaine Rich And Kevin Knight (2nd Edition) Tata Mcgraw-Hill

2. Artificial Intelligence: A Modern Approach, Stuart Russel, Peter Norvig, PHI

3 Introduction to Prolog Programming By Carl Townsend.

4. “PROLOG Programming For Artificial Intelligence” -By Ivan Bratko( Addison-Wesley)

5. “Programming with PROLOG” –By Klocksin and Mellish.

Course Outcome: After learning the course the students should be able to

Understand various search methods

Use various knowledge representation methods

Understand various Game Playing techniques

Use Prolog Programming language using predicate logic

List of Experiments:

1. Write a program to implement Tic-Tac-Toe game problem. 2. Write a program to implement BFS (for 8 puzzle problem or Water Jug problem or any AI search

problem) .

3. Write a program to implement DFS (for 8 puzzle problem or Water Jug problem or any AI search problem)

4. Write a program to implement Single Player Game (Using Heuristic Function) 5. Write a program to Implement A* Algorithm. 6. Write a program to solve N-Queens problem using Prolog. 7. Write a program to solve 8 puzzle problem using Prolog. 8. Write a program to solve travelling salesman problem using Prolog. 9. Convert following Prolog predicates into Semantic Net

cat(tom). cat(cat1). mat(mat1). sat_on(cat1,mat1). bird(bird1). caught(tom,bird1). like(X,cream) :– cat(X). mammal(X) :– cat(X). has(X,fur) :– mammal(X). animal(X) :– mammal(X). animal(X) :– bird(X). owns(john,tom). is_coloured(tom,ginger).

10. Write the Conceptual Dependency for following statements. (a) John gives Mary a book (b) John gave Mary the book yesterday

Open Ended Problems:

1. Describe major subfields and paradigms of AI.

2. What are the major challenges in the field of AI?

3. How AI can be used to develop a better search Engine?

Major Equipments: Computer/Prolog Language

List of Open Source Software/learning website:

1. http://www.journals.elsevier.com/artificial-intelligence/

2. https://www.technologyreview.com/s/534871/our-fear-of-artificial-intelligence/

3. http://www.sanfoundry.com/artificial-intelligence-mcqs-inductive-logic-unification-lifting-1/

ACTIVE LEARNING ASSIGNMENTS: Preparation of power-point slides: which include videos,

animations, pictures, graphics for better understanding theory and practical work. The faculty will allocate

chapters/ parts of chapters to groups of students so that the entire syllabus can be covered. The power-point

slides should be put up on the web-site of the College/ Institute, along with the names of the students of the

group, the name of the faculty, Department and College on the first slide. The best three works should

submit to GTU.

https://www.technologyreview.com/s/534871/our-fear-of-artificial-intelligence/

http://www.sanfoundry.com/artificial-intelligence-mcqs-inductive-logic-unification-lifting-1/

Laxmi Institute of Technology, SarigamApproved by AICTE, New Delhi; Affiliated to Gujarat Technological University, Ahmedabad

Department: Name of Subject In charge: Subject Name: Artificial IntelligenceAcademic Year: 2018-2019

Sr. No.

01 What is artificial intelligence? Define the different task domains of artificial intelligence.

02 Discuss the following:

03 Analyze 8-puzzle problems with respect to the 7AI.

04 Discuss the AI Problem Characteristics in detail.

05 Explain & Solve Water

06

Solve The following Crypt arithmetic problem: B A S E + B A L L ---------------- G A M E S

07

Consider the following axioms: 1. Anyone whom Mary loves is a football star. 2. Any student who does not pass does not play. 3. John is a student. 4. Any student who does not study does not pass. 5. Anyone who does not play is not a football stProve using resolution process that “If John does not study, then Mary does not love John”

08

Translate these sentences into formulas in predicate logic. 1. John likes all kinds of food. 2. Apples are food. 3. Chicken is food. 4. Anything anyone eats and isn’t killed5. Bill eats peanuts and is still alive. 6. Sue eats everything Bill eats.Convert the formulas derived into clauses. Prove that John likes peanuts using resolution.

09

Consider the following sentences: • Prince is a mega star.• Mega stars are rich. • Rich people have fast cars. • Fast cars consume a lot of petrol. (1) Translate these sentences into formulas in predicate logic.(2) Prove that Prince's car consumes a


ASSIGNMENT -1

Computer Science & Engineering Pinal M Hansora

Artificial Intelligence Subject Code:2019 Semester:

Name of Question

What is artificial intelligence? Define the different task domains of artificial intelligence.

Discuss the following: I) Turing Test II) State space of a problem

problems with respect to the 7 problem characteristics of

Discuss the AI Problem Characteristics in detail.

Explain & Solve Water-Jug Problem.

Solve The following Crypt arithmetic problem:

Consider the following axioms: 1. Anyone whom Mary loves is a football star. 2. Any student who does not pass does not play.

4. Any student who does not study does not pass. 5. Anyone who does not play is not a football star. Prove using resolution process that “If John does not study, then Mary

Translate these sentences into formulas in predicate logic. 1. John likes all kinds of food.

4. Anything anyone eats and isn’t killed-by is food. 5. Bill eats peanuts and is still alive. 6. Sue eats everything Bill eats. Convert the formulas derived into clauses. Prove that John likes peanuts

Consider the following sentences: • Prince is a mega star. • Mega stars are rich. • Rich people have fast cars. • Fast cars consume a lot of petrol. (1) Translate these sentences into formulas in predicate logic. (2) Prove that Prince's car consumes a lot of petrol

Laxmi Institute of Technology, Sarigam Approved by AICTE, New Delhi; Affiliated to Gujarat Technological University, Ahmedabad

Subject Code: 2180703 8th

Remark

problem characteristics of

Prove using resolution process that “If John does not study, then Mary

Convert the formulas derived into clauses. Prove that John likes peanuts


10

Consider the following facts.i) The member of the St. Bridge club are Joe,Sally,Bill and Ellen.ii) Joe is married to Sally. iii) iii) Bill is Ellen’s brother. iv) The spouse of every married person iv) The last meeting

1) Translate the above sentences into formulas in predicate logic.2) Prove that Ellen is not married


Sr. No.

01 Explain the Forward and Backward Reasoning.

02 Explain Non Monotonic reasoning and discuss the logics for Non Monotonic reasoning.

03 Explain the Bayesian Networks.

04 Explain Probability and Bay’s Theorem.

05 Explain Inference Rules in Propositional Calculus.


Consider the following facts. The member of the St. Bridge club are Joe,Sally,Bill and Ellen.Joe is married to Sally. iii) Bill is Ellen’s brother. The spouse of every married person in the club is also in the club.The last meeting of the club was at Joe’s house. 1) Translate the above sentences into formulas in predicate logic.2) Prove that Ellen is not married

ASSIGNMENT -2



Name of Question

Explain the Forward and Backward Reasoning.

Explain Non Monotonic reasoning and discuss the logics for Non reasoning.

Explain the Bayesian Networks.

Explain Probability and Bay’s Theorem.

Explain Inference Rules in Propositional Calculus.


The member of the St. Bridge club are Joe,Sally,Bill and Ellen.

n the club is also in the club.

1) Translate the above sentences into formulas in predicate logic.


Remark



Sr. No.

01 Explain the Alpha-Beta Cutoffs Procedure in Game Playing.

02 Describe briefly the applications of

03 Write a short note on: Hopfield Networks.

04 Write a short note on: Recurrent Networks.

05 Explain Artificial Neural Network in brief.

06 Explain the algorithm for Backpropagation in Neural Networks.

07 What is natural language processing? Explain the NLP steps in process.

08 Explain Semantic and Syntactic analysis in NLP.

09 Describe the various steps of Natural language Processing

10 Explain Min-max procedure for game playing with


ASSIGNMENT - 3



Date:

Name of Question

Beta Cutoffs Procedure in Game Playing.

Describe briefly the applications of Neural Networks.

Write a short note on: Hopfield Networks.

Write a short note on: Recurrent Networks.

Explain Artificial Neural Network in brief.

Explain the algorithm for Backpropagation in Neural Networks.

language processing? Explain the NLP steps in

Explain Semantic and Syntactic analysis in NLP.

Describe the various steps of Natural language Processing

max procedure for game playing with any example.



Remark

any example.


Academic Year 2018-19

Centre Code: 086 Examination : Mid I Branch: CSE Semester: VIII Sub Code: 2180703

Sub: Artificial Intelligence Date: 29-1-19 Time: 9.00 am to 10.00 am Marks: 20 Q. 1 What is AI? Explain its Applications. 3 Q. 2 Define and discuss different task domain of artificial intelligence. 5 Q. 3 Explain state space representation using water jug problem. 5 Q. 4 What is production system? Explain it with an example. Discuss the characteristics of a production

system. 5

Q. 5 Describe heuristic function for the Travelling Salesman Problem. 2


Academic Year 2018-19

Centre Code: 086 Examination : Branch: Semester: Sub Code: Sub: Date: Time: Marks: 20

Note: <if any> Q. <marks> Q. Q. Q. Q. Q.

1

Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY BE - SEMESTER–VIII (NEW) - EXAMINATION – SUMMER 2017

Subject Code: 2180703 Date: 29/04/2017 Subject Name: Artificial Intelligence Time: 10:30 AM to 01:00 PM Total Marks: 70 Instructions:

1. Attempt all questions. 2. Make suitable assumptions wherever necessary. 3. Figures to the right indicate full marks.

Q.1 (a) Consider the following initial and goal configuration for 8-puzzle problem.

Draw the search tree. Apply A* algorithm to reach from initial state to goal

state and show the solution. Consider Manhattan distance as a heuristic function

(i.e. sum of the distance that the tiles are out of place.).

Initial State Goal State

1 2 3 1 2 3

7 8 4 8 4

6 5 7 6 5

07

(b) Explain non-monotonic reasoning in detail. 07

Q.2 (a) Explain property inheritance algorithm with example. 07

(b) Consider following facts.

1. Every child loves Santa.

2. Every child loves every candy.

3. Anyone who loves some candy is not a nutrition fanatic.

4. Anyone who eats any pumpkin is a nutrition fanatic.

5. Anyone who buys any pumpkin either carves it or eats it.

6. John buys a pumpkin.

7. Lifesavers is a candy.

Use resolution and prove: If John is a child, then John carves some pumpkin.

07

OR

(b) Describe following facts into predicate logic.

1. Every child loves Santa.

2. Everyone who loves Santa loves any reindeer.

3. Rudolph is a reindeer, and Rudolph has a red nose.

4. Anything which has a red nose is weird or is a clown.

5. No reindeer is a clown.

6. Scrooge does not love anything which is weird.

07

Q.3 (a) Explain difference between forwards reasoning and backward reasoning. 07

(b) What do you understand by the term Fuzzy Logic? How is a fuzzy set denoted

mathematically?

07

OR

Q.3 (a) Define Frames. Draw Semantic Net for following statements.

a) Every kid likes candy.

b) Every school going kid likes candy.

07

(b) Explain Bayesian Network in detail. 07

Q.4 (a) Define Scripts. Write conceptual dependency for following statements.

a) John flew to New York.

b) John shot Mary.

c) John ate eggs.

07

2

(b) Explain syntax and semantic analysis of natural language processing in detail. 07 OR

Q.4 (a) Explain connectionist models. What is perceptron? What is concept of back

propagation for ANNs?

07

(b) What is state space representation of a problem? Show the state space of the

water jug problem.

07

Q.5 (a) Write following prolog programs:

i. To find the sum of first n natural numbers.

ii. To append List2 to List1 and bind the result to List3.

07

(b) We have two players: MIN who plays first and can make 4 moves, MAX who

plays second and can make 2 moves. Suppose that after 1 turn, the values of the

leaves are as in the figure :

Compute (with the algorithm minimax) the value of the root of the tree, than

say which is the most convenient move for MIN. Then tell with the reason,

which parts of the tree are not generated if we perform an alpha-beta pruning.

07

OR

Q.5 (a) Write following prolog programs:

i. To find the factorial of a positive integer number.

ii. To find the nth element of a given list.

07

(b) Discuss hill climbing search method. Also discuss limitations and ways to

overcome these limitations.

07

*************

1


GUJARAT TECHNOLOGICAL UNIVERSITY BE - SEMESTER–VIII (NEW) EXAMINATION – WINTER 2017

Subject Code: 2180703 Date: 02/11/2017 Subject Name: Artificial Intelligence Time:02:30 PM TO 05:00 PM Total Marks: 70 Instructions:


MARKS

Q.1 (a) Describe different heuristics for the Blocks world problem. 03

(b) Discuss Cut and Fail in Prolog. 04

(c) Discuss with examples: AI Problem Characteristic. 07

Q.2 (a) Discuss : Turing Test. 03

(b) Explain Best First Search method. 04

(c) What is wrong with the following arguments?

Men are widely distributed over the earth

Socrates is a man.

Therefore, Socrates is widely distributed over the earth.

How should the facts represented by these sentences be represented in logic

so that this problem does not arise?

07

OR

(c) Consider the following sentences:

Raj likes all kinds of food.

Apples are food.

Anything anyone eats and isn’t killed by is food.

Sachin eats peanuts and is still alive.

Vinod eats everything Sachin eats.

Now, attempt following:

i. Translate these sentences into formulas in predicate logic

ii. Use resolution to answer the question, “What food does Vinod eat?”

07

Q.3 (a) Discuss limitations of Hill climbing search method. 03

(b) Explain non monotonic reasoning. 04

(c) Explain difference between forwards reasoning and backward reasoning. 07

OR

Q.3 (a) Discuss steepest ascent hill climbing. 03

(b) Discuss various issues in design of search program. 04

(c) Define Frames. Draw Semantic Net for following statements.

a) Every kid likes candy.

b) Every school going kid likes candy.

07

Q.4 (a) Discuss Bay’s theorem. 03

(b) Discuss Simulated Annealing method of search. 04

(c) Explain alpha-beta cut off search with an example. State a case when to do

alpha pruning. 07

OR

Q.4 (a) Discuss Min-Max search method. 03

(b) Compare Fuzzy Vs Crisp logic and their membership function. 04

(c) Explain steps of Natural Language Processing 07

Q.5 (a) What us Hopfield network? 03

2

(b) Write a prolog program to compute factorial of a given number. 04

(c) What is state space representation of a problem? Show the state space of the

8 puzzle problem. 07

OR

Q.5 (a) Discuss algorithm for perceptron learning. 03

(b) Write a prolog program to find the sum of first N natural numbers. 04

(c) Discuss Iterative Deepening Search. Also give one example to explain. 07

*************

1


GUJARAT TECHNOLOGICAL UNIVERSITY BE - SEMESTER–VIII (NEW) - EXAMINATION – SUMMER 2018

Subject Code: 2180703 Date: 04/05/2018 Subject Name: Artificial Intelligence Time: 10:30 AM to 01:00 PM Total Marks: 70 Instructions:


MARKS

Q.1 (a) What is state space of a problem? 03

(b) Describe Breadth First Search. Comment on the optimalality of this method. 04

(c) In the Missionaries and Cannibals Problem, three missionaries and three

cannibals must cross a river using a boat which can carry at most two people,

under the constraint that, Number of cannibals should be lesser than the

missionaries on either side. The boat cannot cross the river by itself with no

people on board.

For the above mentioned problem, describe state space representation,

actions, start and end state.

07

Q.2 (a) Describe heuristic function for the Travelling Salesman Problem. 03

(b) Discuss Turing Test. 04

(c) Discuss and Analyze Tower of Hanoi problem with respect to the seven

problem characteristics. 07

OR

(c) Discuss Simulated Annealing search method. Compare it with hill climbing

method. 07

Q.3 (a) Discuss cut in prolog. 03

(b) Differentiate with example representation of “Instance” and “Isa”

relationships. 04

(c) Explain with example how choosing the granularity of representation and

finding the right structure are crucial issues in knowledge representation? 07

OR

Q.3 (a) Discuss with example: Constraint Satisfaction Problem. 03

(b) Write a PROLOG program to find GCD of two numbers. 04

(c) Consider the following sentences:

Tennis is a game. Chess is a game.

John and Steve are students.

John plays Tennis.

Steve plays everything that John plays.

Students who play Tennis, do not play Chess.

i. Translate the above sentences into formulas in Predicate logic

ii. Prove using resolution that “Steve does not play Chess”

07

Q.4 (a) Differentiate Fuzzy logic and Crisp logic. 03

(b) Explain Hopfield Network. 04

(c) Discuss Nonlinear Planning using Constraint Posting with example. 07

2

OR

Q.4 (a) Discus non-monotonic reasoning. 03

(b) Discuss various defuzzification methods. 04

(c) Explain following terms in reference to predicate logic Resolution.

a. Unsuccessful attempt at resolution

b. Equality

c. Reduce

d. Trying several substitute

07

Q.5 (a) What is meant by Perceptron? Give one example. 03

(b) Discuss Bayesian network and its application. 04

(c) Write a PROLOG program Checking for Password.

1. Give an opportunity to user to re-enter the password ‘n’ no. of times,

on entering wrong password using Repeat predicate.

2. Give an opportunity to user to re-enter the password three (03) times,

on entering wrong password.

07

OR

Q.5 (a) Consider the game tree given in Fig. 1, in which the evaluation function

values are shown below each leaf node for the max player. Assume that the

root node corresponds to the minimizing player. Assume that the search

always visits children left-to-right.

Fig : 1

Compute the backed-up values computed by the minimax algorithm by

writing values at the appropriate nodes in the tree given.

03

(b) For the game tree given in Fig. 1, which nodes will not be examined by the

alpha-beta pruning algorithm? Show the process of alpha-beta pruning to

justify your answer.

04

(c) Explain various steps of Natural Language Processing. 07

*************


Department: Name of Subject In charge:

Subject Name: Artificial IntelligenceAcademic Year: 2018-2019

Sr. No.

01

What are the Problem Characteristics of Artificial Intelligence?

What is artificial intelligence? Define the different task domains of artificial intelligence.

What is Intelligence ?Define AI.

Solve 8 Puzzle problem by any AI Technique.

02

Explain the State Space with the use of Water Jug Problem.

Explain the State Space with the use of 8 Puzzle Problem.

What is production system? Explain it with an example. Discuss the characteristics of a production system.

Solve Water-Jug Problem using Production Rule System.

03

What is local maximum, Plateau and Ridge?

Explain the Best-First

What is depth first search? Explain algorithm and its advantages.

What is hill climbing? Explain steepest

Solve The following Crypt arithmetic problem: C R O S S + R O A D S ------------------- D E N G E R




Question Bank

Questions

Chapter 1 What are the Problem Characteristics of Artificial Intelligence?

What is artificial intelligence? Define the different task domains of artificial

What is Intelligence ? Discuss types of problems requiring Intelligence to solve it.

Solve 8 Puzzle problem by any AI Technique.

Chapter 2 Explain the State Space with the use of Water Jug Problem.

Explain the State Space with the use of 8 Puzzle Problem.

What is production system? Explain it with an example. Discuss the characteristics of a production system.

Jug Problem using Production Rule System.

Chapter 3 What is local maximum, Plateau and Ridge?

First-Search Procedure with example.


What is hill climbing? Explain steepest-ascent hill climbing algorithm

Solve The following Crypt arithmetic


Subject Code: 2180703 Semester: 8th

What are the Problem Characteristics of Artificial Intelligence?

What is artificial intelligence? Define the different task domains of artificial

Discuss types of problems requiring Intelligence to solve it.

What is production system? Explain it with an example. Discuss the characteristics


ascent hill climbing algorithm


Solve The following Crypt arithmetic problem: B A S E + B A L L ---------------- G A M E S

Explain A* algorithm in detail

Explain mean-end analysis approach to solve AI problems.

What is Hill Climbing? Explain Simple Hill Climbing and SteepestClimbing.

Solve the following Cryptarithmetic Problem.

S E N D

+ M O R E

-------------------

M O N E Y


B E S T

+ M A D E

-------------------

M A S E R

04

Explain Different Approaches for Knowledge representation.What is Mapping?

Assume the following facts : • Steve only likes easy courses. • Science courses are hard. • All the courses in the basketweaving department are easy. • BK301 is a basketweaving course. Use Resolution to answer the question, “What Course would Steve like?” Assume the following facts : · John likes all kinds of food. · Apples are food. · Chicken is food. · Anything anyone eats and isn’t killed by is food.


Solve The following Crypt arithmetic

Explain A* algorithm in detail

end analysis approach to solve AI problems.

What is Hill Climbing? Explain Simple Hill Climbing and Steepest



Chapter 4,5,6,7 Explain Different Approaches for Knowledge representation.What is Mapping?

Assume the following facts : • Steve only likes easy courses. • Science courses are hard. • All the courses in the basketweaving department are easy. • BK301 is a basketweaving course. Use Resolution to answer the question, “What Course would Steve like?” Assume the following facts : · John likes all kinds of food. · Apples are food. · Chicken is food. · Anything anyone eats and isn’t killed by is


What is Hill Climbing? Explain Simple Hill Climbing and Steepest- Ascent Hill

Explain Different Approaches for Knowledge representation.


· Bill eats peanuts and is still alive. · Sue eats everything Bill eats. - Translate these sentences into formulas in Predicate logic - Prove that John likes peanuts using backward chaining.

Explain the algorithm of predicate logic resolution.Consider the following sentences: • Prince is a mega star. • Mega stars are rich. • Rich people have fast cars. • Fast cars consume a lot of petrol. (1) Translate these sentences into formulas in predicate logic. (2) Prove that Prince's car consumes a lot of petrol.Consider the following sentences and Answer a,b,c given below: 1. Rama likes all kinds of vegetarian food. 2. Oranges are food. 3. Mutton is food. 4. Anything anyone eats and is not killed by is food. 5. Like x eats peanuts and is still alive. 6. Love x eats everything Like(a) Translate these sentences into formulas in Predicate Logic (b) Prove that Rama likes peanuts using Backward Chaining. (c) Prove Rama likes peanuts using ResolutionExplain the Forward and Backward Reasoning.

What is Non-monotonic Reasoning. Explain Non Monotonic reasoning and discuss the logics for Nonreasoning.

05

Explain Probability and Bay’s Theorem.Explain the Bayesian Networks. Explain Inference Rules in Propositional Construct the partitioned semantic net representations for the following: • Every batter hit a ball. • All the batters like the pitcher.

Explain semantic net and frames with proper example.What is Semantic Nets? Consider the following statements and draw the semantic net: Tom is a cat. Tom caught a bird. Tom is owned by John. Tom is ginger in colour. Cats like cream.


· Bill eats peanuts and is still alive. · Sue eats everything Bill eats.

Translate these sentences into formulas in

Prove that John likes peanuts using backward chaining.

Explain the algorithm of predicate logic resolution. Consider the following sentences: • Prince is a mega star. • Mega stars are rich. • Rich people have fast cars. • Fast cars consume a lot of petrol. (1) Translate these sentences into formulas in predicate logic. (2) Prove that Prince's car consumes a lot of petrol. Consider the following sentences and Answer a,b,c given below: 1. Rama likes all kinds of vegetarian food. 2. Oranges are food. 3. Mutton is food. 4. Anything anyone eats and is not killed by is food.

x eats peanuts and is still alive. x eats everything Like x eats.

(a) Translate these sentences into formulas in Predicate Logic (b) Prove that Rama likes peanuts using Backward Chaining. (c) Prove Rama likes peanuts using Resolution Explain the Forward and Backward Reasoning.

monotonic Reasoning. Monotonic reasoning and discuss the logics for Non

Chapter 8,9 Explain Probability and Bay’s Theorem. Explain the Bayesian Networks. Explain Inference Rules in Propositional Calculus. Construct the partitioned semantic net representations for the

• Every batter hit a ball. • All the batters like the pitcher.Explain semantic net and frames with proper example. What is Semantic Nets? Consider the following statements and draw the

Tom caught a bird. Tom is owned by John. Tom is ginger in colour. Cats like cream.


(1) Translate these sentences into formulas in predicate logic.

Consider the following sentences and Answer a,b,c given below:

(a) Translate these sentences into formulas in Predicate Logic (b) Prove that Rama likes peanuts using Backward Chaining.

Monotonic reasoning and discuss the logics for Non Monotonic

Construct the partitioned semantic net representations for the

• Every batter hit a ball. • All the batters like the pitcher.

What is Semantic Nets? Consider the following statements and draw the


The cat sat on the mat. A cat is a mammal. A bird is an animal. All mammals are animals. Mammals have fur

06

Explain the AlphaExplain Min-max procedure for game playing with any example. Describe the various steps of Natural language Processing Explain Semantic and Syntactic analysis in NLP. What is natural language processing? Explain the NLP steps in process. Explain the algorithm for BackDescribe briefly the applications of Neural Networks. Write a short note on: Hopfield Networks. Write a short note on: Recurrent Networks. Explain Artificial Neural Network in brief.

07 Describe the Expert System Development Procedure.Explain Expert System Architecture In Artificial What is Expert System? Explain it’s Architecture, Features & applications in brief.

08

What are the Applications, Features and Limitations of Prolog? Demonstrate the use of Cut and Fail Predicates in Prolog with example. What is Red Cut and Green Cut in Prolog? Demonstrate the use of Repeat Predicate in Prolog with example. Write a prolog program to solve Tower of Hanoi Problem.

Write a prolog program to reverse the given list.Write a prolog program to count vowels in a list of characters.

Write a prolog program to find factorial of a given number.Explain CUT, FAIL & REPEAT predicates in PROLOG.

Write a prolog program to find the sum of elements of a List.


The cat sat on the mat. A cat is a mammal. A bird is an animal. All mammals are animals. Mammals have fur

Chapter 10,11,12 Explain the Alpha-Beta Cutoffs Procedure in Game Playing.

max procedure for game playing with any example. Describe the various steps of Natural language Processing Explain Semantic and Syntactic analysis in NLP. What is natural language processing? Explain the NLP steps in process. Explain the algorithm for Back propagation in Neural Networks. Describe briefly the applications of Neural Networks. Write a short note on: Hopfield Networks. Write a short note on: Recurrent Networks. Explain Artificial Neural Network in brief.

Chapter 13 Describe the Expert System Development Procedure. Explain Expert System Architecture In Artificial Intelligence.What is Expert System? Explain it’s Architecture, Features & applications in

Chapter 14 What are the Applications, Features and Limitations of Prolog? Demonstrate the use of Cut and Fail Predicates in Prolog with example. What is Red Cut and Green Cut in Prolog? Demonstrate the use of Repeat Predicate in Prolog with example. Write a prolog program to solve Tower of Hanoi Problem.

Write a prolog program to reverse the given list. Write a prolog program to count vowels in a list of characters.

Write a prolog program to find factorial of a given number.Explain CUT, FAIL & REPEAT predicates in PROLOG.

Write a prolog program to find the sum of elements of a List.


Beta Cutoffs Procedure in Game Playing. max procedure for game playing with any example.

What is natural language processing? Explain the NLP steps in process. propagation in Neural Networks.

Intelligence. What is Expert System? Explain it’s Architecture, Features & applications in

What are the Applications, Features and Limitations of Prolog? Demonstrate the use of Cut and Fail Predicates in Prolog with example.

Demonstrate the use of Repeat Predicate in Prolog with example.

Write a prolog program to find factorial of a given number.

Documents

GUJARAT TECHNOLOGICAL UNIVERSITY - cms.laxmi.edu.in · Approved by AICTE, New Delhi; Affiliated to Gujarat Technological University, Ahmedabad Academic Year 2018-19 Centre Code: 086