Lecture Schedule

Class : B.Tech(CSE) V sem Academic Year 2019-2020

Course Outcomes :
At the end of the course, a student will be able to
CO1 Classify searching strategies for finding solutions
CO2 Identify knowledge representation methods for inference
CO3 Plan solutions through state space search
CO4 Explain uncertainty
CO5 Classify learning methods

No of
UNIT Topic Date
classes
1 What is Artificial Intelligence (AI) 1
Foundations of Artificial Intelligence (AI), History of AI 1
Agents and Environments, Concept of Rationality 1
Nature of environments 1
Structure of Agents, Problem solving agents 1
Problem formulation 1
Searching for solutions 1
Uninformed search strategies: BFS and DFS 1
Search with partial information 1
Greedy best first search 1
A* search 1
Game Playing: Adversarial search 1
Games , Minimax algorithm 1
Optimal decisions in multi-player games 1
Alpha beta pruning 1
Evaluation functions, Cutting of Search 1
16
Unit 2 Knowledge representation 1
Knowledge based agents 1
The Wumpus world 1
Logic 1
Propositional Logic 1
Reasoning patterns in propositional logic 1
Resolution 1
Forward and backward chaining 1
First order logic 1
Inference in first order logic 1
Propositional vs First order inference 1
Unification and lifting 1
 Forward chaining 1
Backward chaining 1
Resolution 1
15
Unit 3 Planning, Classical planning problem 1
Language of planning problems 1
Expressiveness and extension 1
Planning with state space search 1
Forward state space search, Backward state space search 1
Heuristics for state space search 1
Planning search 1
Planning with state space search 1
Partial order planning graphs 1
9
Unit 4
Acting under uncertainty
Basic probability notation, Axioms of probability 1
Inference using full joint distributions 1
Bayes’ Rule and its use 1
Representing knowledge in an uncertain domain
Semantics of Bayesian networks 1
Efficient representation of conditional distributions 1
Exact inference in Bayesian networks 2
Probabilistic Reasoning over time 1
Time and Uncertainty 1
Inference in Temporal models 1
Hidden Markov models (HMMs) 1
Kalman Filters 1
Dynamic Bayesian Networks 1
Speech recognition 1
14
Unit 5 Forms of learning 1
Induction learning 1
Learning Decision trees 1
Statistical learning methods 1
Learning with complex data 1
Learning with hidden variables 1
EM algorithm 1
Instance based learning 1
Neural networks 1
9
TOTAL NO. OF CLASSES 60
TEXT BOOKS:
1. Stuart J Russell and Peter Norvig , “Artificial Intelligence: A modern approach”, Pearson Education Inc,
Second Edition, 2003

REFERENCES:
1. Patrick H Winston, “Artificial Intelligence”, Pearson Education Inc, Third Edition, 2001
2. E. Rich and K Knight, “Artificial Intelligence”, TMH, Third Edition, 2008

Online Resources:
1. https://www.coursera.org/
2. http://aima.cs.berkley.edu/
3. http://www.cse.iitb.ac.in/