AI Syllabus 22-23.docx
AI Syllabus 22-23.docx
AI Syllabus 22-23.docx
The course aims to provide exposure to concept and techniques of Artificial Intelligence (AI) by
introducing importance of rational agent approach. It aims to train the students to the basic concepts of
the classical search, local search, adversarial search, constraint satisfaction problems, logical agents, first
order logic and planning associated with AI. Finally, this course motivates the students to find AI based
solutions for some of the typical real-world problems by applying these concepts and techniques.
Course Objectives:
UNIT I
Introduction:
UNIT II
Problem solving Methods, Search Strategies, Uninformed, Informed, Heuristics, Local Search Algorithms and
Optimization Problems, Searching with Partial Observations, Backtracking Search, Performance of search
algorithms.
UNIT III
Knowledge Representation:
First Order Predicate Logic, Unification, Forward Chaining, Backward Chaining, Resolution, Knowledge
Representation using First order Predicate logic, Reasoning Systems.
UNIT IV
Planning:
Planning with state-space search, Partial-order planning, Planning graphs, planning and acting in the real
world,Plan generation systems.
UNIT V
Course Outcomes:
CO1: Discover the concepts, applications, and the theory underlying AI.
different domains.
Textbooks:
1. Stuart Russel, Peter. Norvig, “Artificial Intelligence – A Modern Approach”, Fourth Edition, Pearson
Education, 2022
Reference Books:
1. Introduction to Artificial Intelligence and Expert Systems, Dan W. Patterson, Pearson Education.
Assessment:
Activities Marks Mode of Date
Conduct
1. Quiz 5 Offline TBD
2. Class Test 5 Offline TBD
3. Assignment 5 -------- TBD
Mid-Sem 17/09/2024 -
21/09/2024
4. Quiz 5 Offline TBD
5. Class Test 5 Offline TBD
6. Assignment 5 -------- TBD
Lesson Plan
3. Applications of AI
ACTIVITY- 1 [5 marks]
Date:
3. Solving Problems by 1. Search strategies and performance 7 8-15 Text Book Online, PPT
Searching measure and Handouts
4. Heuristic functions
ACTIVITY-2 [5 marks]
Date:
4. Beyond Classical 1. Local search algorithms & 2 16-17 Text Book Online, PPT
Search optimization problems and Handouts
2. Hill Climbing
3. Simulated Annealing
ACTIVITY-3 [5 marks]
Date:
3. Sudoku game
4. Cryptarithmetic problem
5. Constraint propagation
6. backtracking search
Mid Semester
3. Alpha-Beta pruning.
ACTIVITY-4 [5 marks]
Date:
5. Planning Graph
ACTIVITY-5 [5 marks]
Date:
3. Bayesian network
4. Temporal Models
ACTIVITY-6 [5 marks]
Date: