BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

WORK INTEGRATED LEARNING PROGRAMMES

Digital Learning
Part A: Content Design

Course Title Artificial Intelligence

Course No(s) IS ZC444
Credit Units 3
Credit Model 1 - 0.5 - 1.5
1 unit for class room hours, 0.5 unit for Tutorial, 1.5 units for
student preparation.
1 unit = 32 hours
Course Authors Vimal SP, Raja vadhana P
Version No 3.0
Date February 16, 2022

Course Objectives

No Course Objective

CO1 To provide solid foundation for designing intelligent agents

CO2 Learn the representation and use of knowledge in inference-based problem solving
approaches

CO3 Learn to apply probability theory to describe and model agents operating in uncertain
environments

CO4 Learn the optimization models of computation and processing in real world application
of intelligent agents

Text Book(s)

T1 Stuart Russell and Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson
Education, 2006. Third Edition.
T2 Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill Publishing
Company, New Delhi, 2003. Second Edition.
Reference Book(s) & other resources
R1 Ryszard S. Michalski, Jaime G. Carbonell and Tom M. Mitchell, “Machine Learning: An
Artificial Intelligence Approach”, Elsevier, 2014
R2 Dan W Patterson, “Introduction to AI and Expert Systems”, Prentice Hall of India, New
Delhi, 2010
R3 A.M. Turing(1950) Computing Machinery and Intelligence Mind LIX (236): 433-460
R4 Michael Skirpan, Micha Gorelick, The Authority of Fair in Machine Learning
https://arxiv.org/pdf/1706.09976.pdf
R5 Christoph Molnar, Interpretable Machine Learning,
https://christophm.github.io/interpretable-ml-book/
Modular Content Structure

1. Introduction to AI
1.1. History
1.2. Intelligent Agent & Environment
1.3. Role of Learning
1.4. Expert Systems
1.4.1. Stages of Development
1.4.2. Structure of Knowledge base

2. Problem Solving: Knowledge representation and Inference

2.1. Search Strategies
2.1.1. Uninformed
2.1.2. Informed
2.2. Constraint Satisfaction Problem
2.3. Representation
2.3.1. Logic
2.3.2. Rule system & Fuzzy system
2.3.3. Semantic Nets
2.3.4. Objects

3. Reasoning: Static and Dynamic

3.1. Monotonic
3.1.1. Forward Chaining
3.1.2. Backward Chaining
3.2. Non-Monotonic
3.2.1. Probability
3.2.2. Bayesian Networks
3.2.3. Introduction to Hidden Morkov Model

4. Introduction to Learning
4.1. Supervised
4.2. Unsupervised
4.3. Reinforcement Learning
4.4. Neural Network
4.5. Overview of Deep Learning

5. Optimization Models
5.1. Hill climbing Algorithm
5.2. Genetic Algorithm
5.3. Ant Colony Optimization
5.4. Particle Swarm Optimization

6. Game Playing
6.1. AI & Gaming
6.2. Min-Max Algorithm
6.3. Alpha – beta Pruning

7. Anatomy of building AI systems

7.1. Shortcomings of AI
7.2. Building Fair models
7.3. Interpretable models

8. Application in Natural Language Processing

Learning Outcomes:
No Learning Outcomes

LO1 Understand the environment and process of development to build intelligent agents

LO2 Identify heuristics to pursue goals in exponentially large search spaces.

LO3 Represent problem and derive reasoning using logical inferences

LO4 Apply probability theory to describe and model agents operating in uncertain
environments

LO5 Analyse ways to supervise agents to learn and improve their behaviour.

Part B: Course Handout

Academic Term <Semester , Year>

Course Title Artificial Intelligence
Course No IS ZC444
Lead Instructor

Contact List of Topic Title Topic # Text/Ref Book/external

Hour (from content structure (from content structure in Part resource
in Part A) A)

1 Introduction to AI History T1: Chapter 1

2 Introduction to AI Intelligent Agent & Environment T1: Chapter 2

3 Introduction to AI Role of Learning T1: 18.1, R1: Chapter 2

4 Introduction to AI Expert Systems R2 : Chapter 1, Class

 Stages of Development Notes
 Structure of Knowledge
base

5 Problem Solving: Search Strategies T1: Chapter 3

Knowledge  Uninformed
representation and
Inference

6-7 Problem Solving: Search Strategies T1: Chapter 3

Knowledge  Informed
representation and
Inference

8-9 Problem Solving: Constraint Satisfaction Problem T1: Chapter 6.1,6.2

 Knowledge
representation and
Inference

10-11 Problem Solving: Representation T1: Chapter 7, 8, 9.1, 9.2

Knowledge  Logic - Propositional &
representation and Predicate
Inference

12 Problem Solving: Representation T1: Chapter 12.2, 12.3

Knowledge  Rule system & Fuzzy T2: Chapter 8.5,9,10
representation and system
Inference  Semantic Nets
 Objects

13 Reasoning: Static and Monotonic T1: Chapter 9.3, 9.4

Dynamic  Forward Chaining

14 Reasoning: Static and Monotonic T1: Chapter 9.4, 9.5

Dynamic  Backward Chaining

15-16 Reasoning: Static and Non-Monotonic T1: Chapter 13

Dynamic  Probability
 Towards Bayesian
Networks

17-18 Reasoning: Static and Non-Monotonic T1: Chapter 14.1 – 14.4,

Dynamic  Bayesian Networks & 15.1-15.3
Introduction to HMM

19 Introduction to Learning Supervised Learning T1: 18.2, 18.3

20 Introduction to Learning Unsupervised Learning Class Notes

21 Introduction to Learning Overview of Neural Network & T1: 18.7

Deep Learning T2: 18.2-18.4
http://
www.deeplearningbook.or
g/contents/intro.html
Page 1-8

22-23 Introduction to Learning Reinforcement Learning T1: 21.1-21.3, 21.6

24 Optimization Models  Optimization Models T1: 4.1

 Hill climbing Algorithm

25 Optimization Models  Genetic Algorithm T1: 4.1

26-27 Optimization Models  Ant Colony Optimization Class Notes:

 Particle Swarm http://
Optimization www.globalspec.com/
reference/66198/203279/
chapter-11-introduction-to-
particle-swarm-
 optimization-and-ant-
colony-optimization

28 Game Playing AI & Gaming T2: Chapter 12

T1 : Chapter 5

29-30 Game Playing Min-Max Algorithm & Alpha – T2: Chapter 12

beta Pruning T1 : Chapter 5.1-5.3

31-32 Anatomy of building AI Class Notes

➢ Shortcomings of AI
systems R4, R5 Chapter 6
➢ Building Fair models
Application of Natural
Language Processing ➢ Interpretable models T1: Chapter 22, 23
T2: Chapter 15

➢ Process, Rule system &

Application

Detailed Plan for Lab work/Design work

Lab Lab Objective Tool/ Lab Sheet Content Reference
No Program Access
ming URL
Language

1 Implement Informed and Uniformed Search Python TBD Module 2.1 - Search Strategies

2 Simulate the working of inference in a rule Prolog/ TBD Module 2.3, 3.1:
based system Python Rule design, Unification, Inference

3 Familiarize with the working of Learning Python TBD Module 4.1, 4.3
algorithms -Decision Trees, Reinforcement
Learning

4 Understand the implementation of TBD Module 5.1

Optimizations in Problem Solving Travelling Salesman / N-Queens

5 Understand the design of Gaming TBD Module 6.2

-Min-Max / Alpha – beta pruning

6 Apply right technique to build AI system TBD Module 7

Build a ChatBot

7 Familiarize with the basics of natural TBD Module 8

language processing Building a Corpus Extracting Word
Pattern

Case studies: Detailed Plan

Case Case study Objective Case study Sheet
study Access URL
No
- - -

- - -
Evaluation Scheme:
Legend: EC = Evaluation Component; AN = After Noon Session; FN = Fore Noon Session
No Name Type Duration Weight Day, Date, Session,
Time
EC-1 Quiz-I Online - 5% TBA
Quiz-II Online - 5% TBA
Assignment / Lab Offline - 10% or 20% TBA
EC-2 Mid-Semester Test Closed 1.5 hours 30% TBA
/Open Book
EC-3 Comprehensive Open Book 2.5 hours 50% or 40% TBA
Exam

Note: If Assignment kindly remove Quiz-I, II, III

Syllabus for Mid-Semester Test (Closed Book): Topics in Contact Hours : 1 to 16 (or) 1 to 5
Syllabus for Comprehensive Exam (Open Book): All topics (Session Nos. 1 to 32 (or) 1 to 10)
Important links and information:
Elearn portal: https://elearn.bits-pilani.ac.in
Students are expected to visit the Elearn portal on a regular basis and stay up to date with the latest
announcements and deadlines.
Contact sessions: Students should attend the online lectures as per the schedule provided on the Elearn
portal.
Evaluation Guidelines:
1. EC-1 consists of an Assignment and two Quizzes. Students will attempt them through the
course pages on the Elearn portal. Announcements will be made on the portal, in a timely
manner.
2. For Closed Book tests: No books or reference material of any kind will be permitted.
3. For Open Book exams: Use of books and any printed / written reference material (filed or
bound) is permitted. However, loose sheets of paper will not be allowed. Use of calculators is
permitted in all exams. Laptops/Mobiles of any kind are not allowed. Exchange of any
material is not allowed.
4. If a student is unable to appear for the Regular Test/Exam due to genuine exigencies, the
student should follow the procedure to apply for the Make-Up Test/Exam which will be made
available on the Elearn portal. The Make-Up Test/Exam will be conducted only at selected
exam centres on the dates to be announced later.
It shall be the responsibility of the individual student to be regular in maintaining the self study
schedule as given in the course handout, attend the online lectures, and take all the prescribed
evaluation components such as Assignment/Quiz, Mid-Semester Test and Comprehensive Exam
according to the evaluation scheme provided in the handout.