R.V.R.& J.C.
COLLEGE OF ENGINEERING (Autonomous)
DEPARTMENT OF COMPUTER SCIENCE &ENGINEERING
CS 321 – Artificial Intelligence
Lesson Plan
__________________________________________________________________________________
Academic Year 2024 - 2025
Year & Semester Semester-VI [Third Year]
Regulation R-20
Name of Faculty Ms. Ch V Madhavi Lakshmi /Ms. [Link]
Course Objectives:
The objectives of the course are:
1. Introduce fundamental concepts of artificial intelligence.
2. Impart knowledge on problem solving using uninformed, informed, local
and adversarial search strategies.
3. Create awareness on formalization of knowledge and reasoning.
Course Outcomes:
After successful completion of the course, students will be able to:
1. Explain the fundamental concepts of artificial intelligence.
2. Apply search strategies for solving real world problems.
3. Utilize game playing strategies for solving problems.
4. Infer knowledge using propositional and predicate logic.
5. Discuss knowledge representation of the real world using Ontologies.
6. Summarize the algorithms for classical planning.
Unit- I
Learning Outcomes
1. Discuss about Artificial Intelligence and its applications . [CO1]
2. Discuss various search techniques for solving problems [CO2].
Teaching Hours
Topic of syllabus covered
Mode Required
Introduction to AI: What Is AI?, The
Lecture 1
Foundations of AI
The History of AI, The State of the Art. Lecture 1
Intelligent Agents: Agents and Environments,
Lecture 1
Good Behaviour: The Concept of Rationality,
The Nature of Environments, Lecture 1
The Structure of Agents. Lecture 1
Problem Solving by Search: Problem-Solving
Lecture 1
Agents
Example Problems, Searching for Solutions Lecture 1
Uninformed Search Strategies Lecture 2
Informed (Heuristic) Search Strategies Lecture 2
Heuristic Functions Lecture 1
Total [Link] Hours 12
Unit- II
Learning Outcomes
1. Explain various Local search algorithms for solving problems in AI.
[CO2]
2. Explain different game playing strategies. [CO3 ]
Teaching Hours
Topic of syllabus covered
Mode Required
Beyond Classical Search: Local Search
Lecture 1
Algorithms
Optimization Problems Lecture 1
Searching with Non-Deterministic Actions Lecture 1
Adversarial Search: Games, Optimal Decisions in
Lecture 1
Games,.
Alpha–Beta Pruning Lecture 1
Constraint Satisfaction Problems: Defining
Lecture 1
Constraint Satisfaction Problems
Constraint Propagation Lecture 2
Backtracking Search for CSPs Lecture 2
Local Search for CSPs, The Structure of Problems Lecture 2
Total [Link] Hours 12
Unit- III
Learning Outcomes
1. Represent the given knowledge in Proportional Logic. [CO4 ]
2. Represent the given knowledge in First order Logic . [CO4]
Teaching Hours
Topic of syllabus covered
Mode Required
Logical Agents: Knowledge-Based Agents Lecture 1
The Wumpus World Lecture 1
Logic, Propositional Logic, Lecture 1
Effective Propositional Model Checking Lecture 1
Agents Based on Propositional Logic. Lecture 1
First-Order Logic: Representation Revisited,
Lecture 1
Syntax and Semantics of First-Order Logic,
Using First Order Logic Lecture 1
Knowledge Engineering in First-Order Logic. Lecture 1
Inference in First-Order Logic: Propositional vs.
Lecture 1
First-Order Inference, Unification and Lifting
Forward Chaining, Backward Chaining Lecture 2
Resolution Lecture 1
Total [Link] Hours 12
Unit- IV
Learning Outcomes
1. Examine the issues involved in knowledge bases, reasoning systems.
2. Discuss the algorithms for classical planning.
Teaching Hours
Topic of syllabus covered
Mode Required
Knowledge Representation: Ontological Lecture
1
Engineering,
Categories and Objects Lecture 1
Events Lecture 1
Mental Events and Mental Objects, Reasoning Lecture
2
Systems for Categories
Reasoning with Default Information Lecture 1
Automated Planning: Definition of Classical Lecture
1
Planning,
Algorithms for Classical Planning Lecture 3
Planning and Acting in the Real World: Time,
Lecture 2
Schedules and Resources
Hierarchical Planning Lecture 2
Total [Link] Hours 14
Signatures of the Teachers Signature of the HOD
1.
2.
3.
Date: