Major in

Artificial Intelligence
Proposed by: Asst.Prof.A.K.Tripathi
 Proposed Name of Major Scheme and Credit Requirement

• Artificial Intelligence
Proposed Credits Requirement = 18
Credits to be earned from MOOC Swayam/NPTEL courses
Minimum course duration and credits: 8-12 weeks and 2/3 credits
 Proposed Courses from NPTEL
  Title of SWAYAN /     Name of Institute Duration of  Content-Type/
Sr  Credit(s)
NPTEL Course SME (Subject Matter Expert) Course ID offering course Course Category
No
  AN INTRODUCTION TO    106102220        
1 ARTIFICIAL INTELLIGENCE PROF. MAUSAM Department of CSE, 12 3 Elective/Video
IIT Delhi

  ARTIFICIAL INTELLIGENCE:    106106140  Department of CSE      

  KNOWLEDGE PROF. DEEPAK KHEMANI IIT Madras 12 3 Elective/Video
2 REPRESENTATION AND
REASONING

3 ARTIFICIAL INTELLIGENCE: PROF. DEEPAK KHEMANI 106106126 Department of CSE 12 3 Elective/Video

SEARCH METHODS FOR IIT Madras
PROBLEM SOLVING

4 FUNDAMENTALS OF PROF.SHYAMANTA M. 112103280 IIIT Guwahati 12 3 Elective/Video

ARTIFICIAL INTELLIGENCE HAZARIKA
5 INTRODUCTION TO ARTIFICIAL PROF. S. SARKAR, PROF. 106105078 Not Mentioned Not Web
INTELLIGENCE P. MITRA IIT Kharagpur in NPTEL Mentioned in
NPTEL
6 ARTIFICIAL INTELLIGENCE Prof.P.Dasgupta 106105079 IIT Kharagpur Not Mentioned Not Video
in NPTEL Mentioned in
NPTEL
 Progression and Courses to core industry areas

 If students knows the above courses they can have career in the following applied science
fields
 Computer Science Engineering
 IT Engineering
 Electronics Engineering
 Cyber Security
 Industrial Automation
 Benefits of Taking Major in Mechanical Engineering
 Progression of students to
 Placements
 Higher studies: M.Tech, MBA, MS, PhD
 Entrepreneurship
 Benefits to society and nation
 Progression to research
 Motivation for lifelong learning
 Artificial Intelligence
Sr. Course Content Credit Duration
No

1. An Introduction Week 1: Introduction: Philosophy of AI, Definitions 3 12

to Artificial Week 2: Modeling a Problem as Search Problem, Uninformed weeks
Intelligence Search
Week 3: Heuristic Search, Domain Relaxations
Week 4: Local Search, Genetic Algorithms
Week 5: Adversarial Search
Week 6: Constraint Satisfaction
Week 7: Propositional Logic & Satisfiability
Week 8: Uncertainty in AI, Bayesian Networks
Week 9: Bayesian Networks Learning & Inference, Decision
Theory
Week 10: Markov Decision Processes
Week 11: Reinforcement Learning
Week 12: Introduction to Deep Learning & Deep RL
 Artificial Intelligence
Sr. Course Content Credit Duration
No
2. Artificial week 1: introduction, propositional logic, syntax and semantics 3 12
Intelligence: week 2: proof systems, natural deduction, tableau method, resolution method weeks
Knowledge week 3: first order logic (fol), syntax and semantics, unification, forward
Representatio chaining
n week 4: the rete algorithm, rete example, programming rule based systems
and week 5: representation in fol, categories and properties, reification, event
Reasoning calculus
week 6: deductive retrieval, backward chaining, logic programming with
prolog
week 7: resolution refutation in fol, fol with equality, complexity of theorem
proving
week 8: description logic (dl), structure matching, classification
week 9: extensions of dl, the alc language, inheritance in taxonomies
week 10: default reasoning, circumscription, the event calculus revisited
week 11: default logic, autoepistemic logic, epistemic logic, multi agent
scenarios
week 12: optional topics a: conceptual dependency (cd) theory, understanding natural
language optional topics b: semantic nets, frames, scripts, goals and plans
 Artificial Intelligence
Sr. Course Content Credit Duration
No
3. Artificial Intelligence : Week 0 : Introduction: History, Can Machines think?, Turing Test, Winograd 3 12 weeks
Search Methods for Schema Challenge, Language and Thought, Wheels & Gears
Week 1 : Introduction: Philosophy, Mind, Reasoning, Computation,
Problem Solving Dartmouth Conference, The Chess Saga, Epiphenomena
Week 2 : State Space Search: Depth First Search, Breadth First Search, Depth
First Iterative Deepening
Week 3 : Heuristic Search: Best First Search, Hill Climbing, Solution Space,
TSP, Escaping Local Optima, Stochastic Local Search
Week 4 : Population Based Methods: Genetic Algorithms, SAT, TSP,
emergent Systems, Ant Colony Optimization
Week 5 : Finding Optimal Paths: Branch & Bound, A*, Admissibility of A*,
Informed Heuristic Functions
Week 6 : Space Saving Versions of A*: Weighted A*, IDA*, RBFS,
Monotone Condition, Sequence Alignment, DCFS, SMGS,
Beam Stack Search
Week 7 : Game Playing: Game Theory, Board Games and Game Trees,
Algorithm Minimax, AlphaBeta and SSS*
Week 8 : Automated Planning: Domain Independent Planning, Blocks World,
Forward &Backward Search, Goal Stack Planning, Plan Space
Planning
Week9 :Problem Decomposition: Means Ends Analysis, Algorithm
Graphplan, Algorithm AO*
Week10: Rule Based Expert Systems: Production Systems, Inference Engine,
Match-Resolve-Execute, Rete Net
Week11: Deduction as Search: Logic, Soundness, Completeness, First Order Logic, Forward
Chaining, Backward Chaining
Week12: Constraint Processing: CSPs, Consistency Based Diagnosis, Algorithm Backtracking,
Arc Consistency, Algorithm Forward Checking
 Artificial Intelligence
Sr. Course Content Credit Duration
No
4. Fundamental Week 1: AI and Problem Solving by Search 3 12
s of Artificial Week 2: Problem Solving by search weeks
Intelligence Week 3: Problem Solving by search (contd)
Week 4: Knowledge Representation and Reasoning
Week 5: Knowledge Representation and Reasoning (Contd)
Week 6: Knowledge Representation and Reasoning (contd)
Week 7: Reasoning under uncertainty
Week 8: Planning
Week 9: Planning, Decision Making
Week 10:Decision Making
Week 11: Machine Learning
Week 12: Machine Learning (contd)
 Artificial Intelligence
Sr. Course Content Credit Duration
No
5. Introduction to Introduction Not mentioned in NPTEL Not
mentioned
Artificial Problem Solving using Search- (Single agent search) in NPTEL
Intelligence Problem Solving using Search-(Two agent)
Constraint satisfaction problems
Knowledge Representation and Logic (Propositional Logic)
Knowledge Representation and Logic (First Order Logic)
Knowledge Representation and Logic (Rule based Systems)
Other representation formalisms
Planning
Reasoning with Uncertainty - Probabilistic reasoning
Reasoning with uncertainty-Fuzzy Reasoning
Machine Learning
Natural Language Processing
 Artificial Intelligence
Sr Course Content Credit Duratio
. n
N
o
6. ARTIFICIAL Introduction to Artificial Intelligence Not Not
INTELLIGENCE Problem Solving by Search Mentione Mentioned
Searching with Costs d in in NPTEL
Informed State Space Search
Heuristic Search: A* and Beyond NPTEL
Problem Reduction Search: AND/OR Graphs
Searching Game Trees
Knowledge Based Systems: Logic and Deduction
First Order Logic
Inference in First Order Logic
Resolution - Refutation Proofs
Resolution Refutation Proofs
Logic Programming : Prolog
Prolog Programming
Prolog: Exercising Control
Additional Topics
Introduction to Planning
Partial Order Planning
GraphPLAN and SATPlan
SATPlan
Reasoning under uncertainty
Bayesian Networks
Reasoning with Bayes Networks
Reasoning with Bayes networks (Contd.)
Reasoning under uncertainty: Issues
Learning : Decision Trees
Learning : Neural Networks
Back Propagation Learning
Thank You