Title of Course: Artificial Intelligence Course Code: CS303
L-T Scheme: 3-1 Course Credits: 4
Objectives: In this course we will study the basic components of an intelligent system, their functions,
mechanisms, policies and techniques used in their implementation and examples.
Learning Outcomes: The students will have a detailed knowledge of the concepts of artificial intelligence,
various applications of AI in different fields, Aware of a variety of approaches to AI techniques.
Course
Description
Outcome
CO1 Demonstrate knowledge of the building blocks of AI as presented in terms of intelligent agents.
Analyze and formalize the problem as a state space, graph, design heuristics and select
CO2
amongst different search or game based techniques to solve them.
Develop intelligent algorithms for constraint satisfaction problems and also design intelligent
CO3
systems for Game Playing.
Attain the capability to represent various real life problem domains
CO4
using logic based techniques and use this to perform inference or planning. playing.
CO5 Formulate and solve problems with uncertain information using Bayesian approaches.
Apply concept Natural Language processing to problems leading to understanding of cognitive
CO6
computing.
Course Contents:
Unit-1 (Introduction to AI):
Definitions, Goals of AI, AI Approaches, AI Techniques, Branches of AI, Applications of AI. Introduction of
Intelligent Systems: Agents and Environments, Good Behavior: the concept of Rationality, The Nature of
Environments, The structure of Agents, How the components of agent programs work.
Unit-2 (Problems Solving, Search and Control Strategies)
Solving Problems by Searching, Study and analysis of various searching algorithms. Implementation of Depth-
first search, Problem-Solving Agents, Searching for Solutions, Uninformed Search Strategies: Breadth-first
search, Uniform-cost search, Depth-first search, Depth-limited search, Iterative deepening depth-first search,
Bi-directional search Informed (Heuristic) Search Strategies: Greedy best-first search A* search: Minimizing
the total estimated solution cost, Conditions for optimality: Admissibility and consistency, Optimality of A*,
Memory-bounded heuristic search, Heuristic Functions, Generating admissible heuristics from sub problems:
Pattern databases, Learning heuristics from experience.
Beyond Classical Search: Local Search Algorithms and Optimization Problems: Hill-climbing search Simulated
annealing, Local beam search, Genetic algorithms, Local Search in Continuous Spaces, Searching with Non-
deterministic Actions: AND-OR search trees, Searching with Partial Observations.
Adversarial Search and Constraint Satisfaction Problems, Study of min-max algorithm Adversarial Search:
Games, Optimal Decisions in Games, The mini-max algorithm, Optimal decisions in multiplayer games, Alpha--
Beta Pruning, Move ordering , Imperfect Real-Time Decisions, Evaluation functions, Cutting off search,
Forward pruning, Search versus lookup, Stochastic Games, Evaluation functions for games of chance, Partially
Observable Games
Constraint Satisfaction Problems: Defining Constraint Satisfaction Problems, Variations on the CSP formalism,
Constraint Propagation: Inference in CSPs, Backtracking Search for CSPs, Local Search for CSPs, Alpha-beta
pruning and CSP, Implementation aspects of mini-max algorithm and CSP.
Unit- 3 (Knowledge Representations Issues, Predicate Logic, Rules)
Knowledge representation, KR using predicate logic, KR using rules. Reasoning System - Symbolic,
Statistical: Reasoning, Symbolic reasoning, Statistical reasoning.
Unit-4 (Quantifying Uncertainty, Learning Systems)
Acting under Uncertainty, Basic Probability Notation, Inference Using Full Joint Distributions, Bayes' Rule and
Its Use, Representing Knowledge in an Uncertain Domain, Other Approaches to Uncertain Reasoning, Rule-
based methods for uncertain reasoning, Representing vagueness: Fuzzy sets and fuzzy logic, Study of fuzzy
logic and Decision trees, Implementation aspects of Decision trees.
Learning from Examples: Forms of Learning, Supervised Learning, Learning Decision Trees, The decision tree
representation, Expressiveness of decision trees, inducing decision trees from examples.
Unit-5 (Expert Systems)
Introduction, Knowledge acquisition, Knowledge base, Working memory, Inference engine, Expert system
shells, Explanation, Application of expert systems.
Fundamentals of Neural Networks: Introduction and research history, Model of artificial neuron, Characteristics
of neural networks, learning methods in neural networks, Single-layer neural network system, Applications of
neural networks.
Fundamentals of Genetic Algorithms: Introduction, Encoding, Operators of genetic algorithm, Basic genetic
algorithm.
Evalution Scheme:
Evaluation Marks Remarks
T1 15 Marks(1 Hr.) 1 -4 Week
st th
T2 25 Marks(1:30 Hr.) 5 – 10 Week
th th
T3 35 Marks(2:00 Hr.) 11 -16 Week
th th
Tutorial/Presentation 10
Assignments 5
Quiz 5
Attendance 5
Total 100
Text Books
1. Rich, Elaine Knight, Kevin, Artificial Intelligence, Tata McGraw Hill.
2. Luger, George F, Artificial Intelligence: Structures and Strategies for Complex Problem Solving,
Pearson Education.
References
1. Nilsson, Nils J, Artificial Intelligence, Morgan Kaufmann, Russell, Stuart J. Norvig, Peter, AI: A
Modern Approach, Pearson Education.
2. Neural networks and Learning Machines, Simon Haykin, PHI Learning Pvt. Ltd.
