Вы находитесь на странице: 1из 2

15CS401 Artificial Intelligence L T P C

3 0 0 3
Co-requisite: Nil
Prerequisite: Nil
Data Book / Nil
Codes/Standards
Course Category P Professional Core
Course designed by Department of Computer Science and Engineering
Approval 32nd Academic Council Meeting , 23rd July 2016

PURPOSE Introduce the concepts of Artificial Intelligence; Learn the methods of solving problems using
Artificial Intelligence in Graph Playing, Natural Language Processing, Expert Systems and
Machine Learning.
INSTRUCTIONAL OBJECTIVES STUDENT
OUTCOMES
At the end of the course, student will be able to
1. Identify problems that are amenable to solution by AI methods. a b
2. Identify appropriate AI methods to solve a given problem. a b
3. Formalize a given problem in the language/framework of different AI methods a b
4. Design and carry out an empirical evaluation of different algorithms on a problem a b c
formalization, and state the conclusions that the evaluation supports

Contact C-D-
Session Description of Topic IOs Reference
hours I-O
UNIT I: Introduction 9
1. Introduction to Artificial Intelligence-History of AI- AI Techniques 1 C 1 1,2,3,4
2. Problem Solving with AI- AI models-Data Acquisition and 3 C 1 1,2,3,4
Learning Aspects in AI
3. Problem-Solving Process – Formulating Problems-Problem Types 3 C,D 1 1,2,3,4
and Characteristics- Problem Analysis and Representation
4. Performance Measuring-Problem Space and Search-Toy 2 C,D 1 1,2,3,4
Problems- Real-world problems-Problem Reduction Methods
UNIT II: Heuristic Search Techniques 9
5. General Search algorithm – Uniformed Search Methods – 2 C 2-4 1,2,3,4
BFS, Uniform Cost Search
6. Depth First search , Depth Limited search (DLS), Iterative 2 C,D 2-4 1,2,3,4
Deepening
7. Informed Search-Introduction- Generate and Test, BFS, A* 3 C,D 2-4 1,2,3,4
Search, Memory Bounded Heuristic Search.
8. Local Search Algorithms and Optimization Problems – Hill 2 D,I 2-4 1,2,3,4
climbing and Simulated Annealing
UNIT III: Knowledge and Reasoning 9
9. Knowledge Representation-Knowledge based Agents-The 2 C 3 1,2,3,4
Wumpus World
10. Logic-Propositional Logic-Predicate Logic-Unification and Lifting 3 C,D,I 3 1,2,3,4
11. Representing Knowledge using Rules-Semantic Networks- 2 C,D 3 1,2,3,4
Frame Systems
12. Inference – Types of Reasoning 2 C 3 1,2,3,4
UNIT IV: Planning 9
13. Planning Problem – Simple Planning agent –Blocks world 2 C 4 1,2,3,4
14. Goal Stack Planning-Means Ends Analysis- Planning as a State- 2 D,I 4 1,2,3,4
space Search
15. Partial Order Planning-Planning Graphs-Hierarchical Planning- 1 C,D,I 4 1,2,3,4
Non- linear Planning -Conditional Planning-Reactive Planning
16. Knowledge based Planning-Using Temporal Logic – Execution 2 C,D 4 1,2,3,4
Monitoring and Re-planning-Continuous Planning-Multi-agent
Planning-Job shop Scheduling Problem

33 CS-Engg&Tech-SRM-2015
Contact C-D-
Session Description of Topic IOs Reference
hours I-O
17. NLP-Introduction-Levels of NLP-Syntactic and Semantic analysis- 2 C,D,I 1-4 1,2,3,4,5
Discourse and Pragmatic Processing-Information Retrieval-
Information Extraction-Machine Translation-NLP and its
Application
UNIT V: Game Playing 9
18. Introduction-Important Concepts of Game Theory 1 C 3-4 1,2,3
19. Game Playing and Knowledge Structure-Game as a Search 2 C, D 3-4 1,2,3
Problem
20. Alpha-beta Pruning-Game Theory Problems Game Theory 3 C, D, I 3-4 1,2,3
21. Expert System-Architecture- Knowledge acquisition-Rule based 3 C,D,I 1-4 1
Expert System-Frame based and Fuzzy based expert system- Case
study in AI Applications
Total contact hours 45*

LEARNING RESOURCES
Sl.
No.
1.Parag Kulkarni, Prachi Joshi, “Artificial Intelligence –Building Intelligent Systems ”PHI learning private
Ltd, 2015
2.Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, Mc Graw Hill- 2008.
3.Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson Education 2007.
4.Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education 2013.
5.Akshar Bharati, Vineet Chaitanya, Rajeev Sangal, “Natural Language Processing: A Paninian
Perspective”, Prentice Hall India Ltd.,New Delhi, 1996

Course nature Theory


Assessment Method (Weightage 100%)
In-semester Assessment tool Cycle test I Cycle test II Cycle Test III Surprise Test Quiz Total
Weightage 10% 15% 15% 5% 5% 50%
End semester examination Weightage : 50%
* Excluding Assessment Hours

34 CS-Engg&Tech-SRM-2015

Вам также может понравиться