Course Title: ARTIFICIAL INTELLIGENCE

Subject Code : 18CS55 Credit : 03 CIE: 50

Number of Lecture Hours/Week 3Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: Discrete Mathematics
Course Objectives:
 To Apply a given AI technique to a given concrete problem
 To Implement non-trivial AI techniques in a relatively large system
 To understand uncertainty and Problem solving techniques.
 To understand various symbolic knowledge representation to specify domains and reasoning
tasks of a situated software agent.
 To understand different logical systems for inference over formal domain representations, and
trace how a particular inference algorithm works on a given problem specification.
 To understand various learning techniques and agent technology.

MODULES Teaching Hours

Module I
What is Artificial Intelligence: The AI Problems, The Underlying
assumption, What is an AI Technique? The Level of the model, Criteria for
09 Hrs
success. Problems, problem spaces, and search: Defining, the problem as a
state space search, Production systems, Problem characteristics, Production
system characteristics, Issues in the design of search programs.

Module II

Heuristic search techniques: Generate-and-test, Hill climbing, Best-first

08 Hrs
search, Problem reduction, Mean-ends analysis.
Knowledge representation issues: Representations and mappings, Approaches
to knowledge representation, Issues in knowledge representation, the frame
problem.

Module III
Using predicate logic: Representing simple facts in logic, representing
instance and ISA relationships, Computable functions and predicates,
08 Hrs
Resolution, Natural Deduction
Representing Knowledge Using Rules: Procedural versus Declarative
knowledge, Logic programming, forward versus backward reasoning,
matching, control knowledge.

Module IV

Symbolic Reasoning Under Uncertainty: Introduction to nonmonotonic

reasoning, Logic for nonmonotonic reasoning, Implementation Issues, 09 Hrs
Augmenting a problem-solver, Implementation: Depth-first search,
Implementation: Breadth-first search.

Statistical Reasoning: Probability and bayes Theorem, Certainty factors and

rule-based systems, Bayesian Networks, Dempster-Shafer Theory, Fuzzy logic.

Module V
Natural Language Processing: Language Models, Text Classification,
08 Hrs
Information Retrieval, Information Extraction.
ROBOTICS: Introduction, Robot Hardware, Robot Perception, Planning to
Move, Planning uncertain Movement, Moving, Robotics software
Architectures.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
TEXT BOOKS:
1. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill, 3rd Edition 2008
2. Stuart Russell, Peter Norvig, “Artificial Intelligence”, A Modern Approach, Pearson

Education/Prentice Hall of India, 3rd Edition Dec 2009

REFERENCES:
1. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd.
2. George F. Luger, “Artificial Intelligence-Structures and Strategies for Complex Problem
Solving”, Pearson Education/ PHI.

Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO) Blooms
Code Level
Discuss artificial intelligence techniques, problem and heuristic
CO1
search algorithm C2
Apply knowledge representation techniques and predicate Logic
CO2 C3
rules to solve reasoning programs.
Apply various symbolic reasoning under uncertainty in
16CS663 CO3 intelligent system development as well as understand the C3
importance of maintaining intelligent systems.
CO4 Discuss various learning methods using probabilistic models. C2
Design and develop Natural Language Processing and Robotics
CO5 applications. C5