Scribd
Upload
69 views2 pages

M-Tech Syllabus

This document provides an overview of an Artificial Intelligence course. The course is 4 hours per week and offers 4 credits. It covers topics like problem solving, search techniques, constraint satisfaction problems, adversarial search, knowledge representation, probabilistic reasoning, planning, and expert systems. The textbook is Artificial Intelligence by Elaine Rich, Kevin Knight and Nair. Reference books include titles by Saroj Kausik, Padhy, Nils Nilsson, and David Poole.

Uploaded by

sourabh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
69 views2 pages

M-Tech Syllabus

This document provides an overview of an Artificial Intelligence course. The course is 4 hours per week and offers 4 credits. It covers topics like problem solving, search techniques, constraint satisfaction problems, adversarial search, knowledge representation, probabilistic reasoning, planning, and expert systems. The textbook is Artificial Intelligence by Elaine Rich, Kevin Knight and Nair. Reference books include titles by Saroj Kausik, Padhy, Nils Nilsson, and David Poole.

Uploaded by

sourabh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code Course Name Hours per Week Total Total

L T P Hrs. Credits

CS5EL21 Artificial Intelligence 4 0 0 4 4

Unit 1
Introduction, Overview of Artificial intelligence: Problems of AI, AI technique,Intelligent
Agents, Agents & environment, nature of environment, structure of agents, goal based agents,
utility based agents, learning
agents. Problem Solving, Problems, Problem Space & search: Defining the problem as
state space search, production system,expert system, problem characteristics

UNIT 2:
Search techniques:Problem solving agents, searching for solutions; uniform search
strategies: breadth first search, depth first search, depth limited search, bidirectional
search, comparing uniform search strategies. Heuristic search strategies Greedy best-
first search, A* search, AO* search, memory bounded heuristic search: local search
algorithms & optimization problems: Hill climbing search, simulated annealing
search, local beam search

Unit 3
Constraint satisfaction problems: Local search for constraint satisfaction problems.
Adversarial search, Games, optimal decisions & strategies in games, the minimax
search procedure, alpha-beta pruning, additional refinements, iterative deepening.

Unit 4
Knowledge & reasoning: Knowledge representation issues, representation &
mapping, approaches to knowledge representation. Using predicate logic, representing
simple fact in logic, representing instant & ISA relationship, computable functions &
predicates, resolution, natural deduction. Representing knowledge using rules,
Procedural verses declarative knowledge, logic programming, forward verses
backward reasoning, matching, control knowledge.

Unit 5
Probabilistic reasoning: Representing knowledge in an uncertain domain, the
semantics of Bayesian networks, Dempster-Shafer theory, Planning Overview,
components of a planning system, Goal stack planning, Hierarchical planning, other
planning techniques. Expert Systems:Representing and using domain knowledge,
expert system shells, and knowledge acquisition.

Text Book:
1. Elaine Rich, Kevin Knight and Nair,  Artificial Intelligence, TMH 
2. S. Russel, Peter Norvig,  Artificial Intelligence: A Modern Approach, Pearson.

Reference Books:
1. Saroj Kausik, Artificial Intelligence, Cengage Learning 4
2. Padhy, Artificial Intelligence and Intelligent Systems, Oxforfd University Press,
3. Nils Nilsson, Artificial Intelligence: A New Synthesis, Morgan Kaufmann.
4. David Poole, Alan Mackworth, Artificial Intelligence: Foundations for Computational
Agents, Cambridge Univ. Press..

You might also like