Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No CAP610


Course Planner 12279 :: Avneet Kaur Dhawan

Lectures Tutorial Practical Credits 4 0 0 4

Text Book:

1 1. Rich ,Knight,” Artificial Intelligence”, Tata McGraw Hill, 2009

Other Specific Book:

2 2. D.W.Patterson, Introduction to AI & Expert Systems, Prentice Hall. 3 4 3. A.J. Gongalez & D.D. Dankel, The Engineering of Knowledge based systems theory & practice, Prentice Hall, 1993. 4. Stuart Russels & Peter Norvig, Artificial Intelligence , Prentice Hall, 2007

5 5. VS jankiraman, K Sarukshi & P Gopalakrishnan, Artificial Intelligence and Expert Systems, Macmillan 2007 6 6. Nils J. Nilson, Artificial Intelligence, Narosa Publishing House, 1990

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 7 7 (Complete reference) 8 8 9 9 Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) 10 Salient Features It consists of all the current development related to Artificial intelligence.


Approved for Spring Session 2011-12

D..pdf its provide the brief introduction about machine learning It provides brief introduction 19 zeno.. Production System and its characteristics. exercise files and compiler to run prolog. ro.pdf 17 www. it showcase the state of the art in pattern-matching conversational machines.11 http://www..umd. ents.. it gives brief introduction about lisp language 16 www.chscene.ling.pdf This is the complete introduction of the prolog. demonstrated by HAL.Ch-1 Pg 3-8 ->Reference :1.washington.csupomona. 12 Pg 30-31 43-44 2 . planned Part 1 Week 1 Lecture 1 Lecture 2 Lecture 3 Lecture 4 Week 2 Lecture 5 Lecture 6 Meaning of AI Historical foundations Development of 13 On this 14 References/prolog 15 http://www.p it proide brief introduction df 20 ->Reference :1.cs.VoiceRecog It provide comprehensive knowledge about voice recognition it showcase the programs using prolog.hitl.2. demonstrated by Alan.till.Ch-1 Pg 22-24 ->Reference Pg 25-30 CA/REGULAR/CAP610/ Lecture1 CA/REGULAR/CAP610/ Lecture2 CA/REGULAR/CAP610/ Lecture3 CA/REGULAR/CAP610/ Lecture4 CA/REGULAR/CAP610/ Lecture5 CA/REGULAR/CAP610/ Lecture6 Approved for Spring Session 2011-12 Problem.pdf 18 http://www./ Turing test Applications of AI & related fields Problems and state space Search ->Reference :1.ppt file. It provide It provide comprehensive knowledge about pattern recognition.Ch-1 Pg 20-22 ->Reference and in reinforcement learning algorithms.html Detailed Plan For Lectures Week Number Lecture Number Lecture Topic Chapters/Sections of Pedagogical tool Textbook/other Demonstration/case reference study/images/anmatio n On this website. o The AI Depot is a website dedicated to help in solving problems using artificial intelligence.Ch-1 Pg 18-20 ->Reference :1..

Week 2 Lecture 7 Lecture 8 BFS.Ch-4 Pg 91-97 ->Reference :1.Ch-4 Pg 82-90 ->Reference :1.Ch-5 Pg 115-125 ->Reference :1. Heuristic search: . Natural deduction Procedural Vs Declarative Knowledge.Ch-10 Pg 207-220 CA/REGULAR/CAP610/ Lecture14 CA/REGULAR/CAP610/ Lecture15 CA/REGULAR/CAP610/ Lecture16 CA/REGULAR/CAP610/ Lecture17 CA/REGULAR/CAP610/ Lecture18 CA/REGULAR/CAP610/ Lecture19.Ch-3 Pg 64-66 ->Reference :1.Ch-6 Pg 129-131 ->Reference :1. Means-End Analysis Part 2 Week 4 Lecture 14 Lecture 15 Lecture 16 Week 5 Lecture 17 Lecture 18 Lecture 19 Lecture 20 Week 6 Lecture 21 Lecture 22 Lecture 23 Lecture 24 Week 7 3 Lecture 25 Knowledge Representation: General concepts of knowledge Approaches of knowledge representation Issues in knowledge representation Overview of weak slot and filler structures Overview of weak slot and filler structures Strong slot and filler structures Test 1 Propositional and Predicate logic to represent knowledge Propositional and predicate logic to represent knowledge Resolution Resolution .20 NA CA/REGULAR/CAP610/ Lecture21 CA/REGULAR/CAP610/ Lecture22 CA/REGULAR/CAP610/ Lecture23 CA/REGULAR/CAP610/ Lecture24 CA/REGULAR/CAP610/ Lecture25 Approved for Spring Session 2011-12 .Ch-9 Pg 188-206 ->Reference :1.Ch-5 Pg 108-114 ->Reference :1.Ch-3 Pg 45-46 ->Reference :1.Ch-4 Pg 82-97 ->Reference :1. DFS DFS with iterative deepening.Ch-3 Pg 57-59 ->Reference :1.Generate & Test ->Reference :1.Ch-3 Pg 52-55 ->Reference :1.Ch-5 Pg 99-108 ->Reference :1.Ch-3 Pg 72-76 CA/REGULAR/CAP610/ Lecture7 CA/REGULAR/CAP610/ Lecture8 CA/REGULAR/CAP610/ Lecture9 CA/REGULAR/CAP610/ Lecture10 CA/REGULAR/CAP610/ Lecture11 CA/REGULAR/CAP610/ Lecture12 CA/REGULAR/CAP610/ Lecture13 Week 3 Lecture 9 Lecture 10 Lecture 11 Lecture 12 Week 4 Lecture 13 A* Properties of A* Hill Climbing Best First Search.Ch-2 Pg 33-36 Ch-3 Pg 5051 ->Reference :1.Ch-2 Pg 31-33 ->Reference :1. Design of Search Programs. Problem reduction Constraint Satisfaction.Ch-9 Pg 188-206 ->Reference :1. Forward vs backward Reasoning ->Reference :1.Ch-5 Pg 99-108 ->Reference :1.

Probability & Bayes Theorem ->Reference :1.Ch-15 Pg 300-320 ->Reference :1.Ch-7 Pg 147-158 ->Reference :1.Ch-8 Pg 184-185 ->Reference :1. Rote Learning Various Type of Learning ->Reference :1.Ch-8 Pg 181-184 ->Reference :1.Ch-17 Pg 347-349 ->Reference :1.Ch-15 Pg 285-300 ->Reference :1. Bayesian N/W Dampster Shafer Theory Fuzzy Logic Natural Language Processing.Ch-6 Pg 135-137 ->Reference :1.Ch-17 Pg 349-367 CA/REGULAR/CAP610/ Lecture40 CA/REGULAR/CAP610/ Lecture41 CA/REGULAR/CAP610/ Lecture42 4 Approved for Spring Session 2011-12 . PROLOG ->Reference :1.Ch-6 Pg 131-137 CA/REGULAR/CAP610/ Lecture26 CA/REGULAR/CAP610/ Lecture27 CA/REGULAR/CAP610/ Lecture28 MID-TERM Part 3 Week 8 Lecture 29 Lecture 30 Lecture 31 Lecture 32 Week 9 Lecture 33 Lecture 34 Lecture 35 Lecture 36 Week 10 Lecture 37 Lecture 38 Lecture 39 Symbolic Reasoning Under uncertainty Nonmonotonic reasoning Symbolic Reasoning Under uncertainty Nonmonotonic reasoning ->Reference :1.Ch-8 Pg 172-174 Statistical Reasoning.Ch-7 Pg 147-158 CA/REGULAR/CAP610/ Lecture29 CA/REGULAR/CAP610/ Lecture30 CA/REGULAR/CAP610/ Lecture31 CA/REGULAR/CAP610/ Lecture32 CA/REGULAR/CAP610/ Lecture33 CA/REGULAR/CAP610/ Lecture34 CA/REGULAR/CAP610/ Lecture35 CA/REGULAR/CAP610/ Lecture36 CA/REGULAR/CAP610/ Lecture37 CA/REGULAR/CAP610/ Lecture38 CA/REGULAR/CAP610/ Lecture39 Statistical Reasoning.Ch-8 Pg 174-181 ->Reference :1.Probability & Bayes Theorem ->Reference :1. Syntactic Processing and Semantic Analysis Discourse & Pragmatic processing ->Reference :1.Ch-8 Pg 184-185 ->Reference :1.Ch-15 Pg 300-320 Part 4 Week 10 Week 11 Lecture 40 Lecture 41 Lecture 42 NLP Learning: Meaning.Meaning.Ch-15 Pg 300-320 ->Reference :1.Ch-8 Pg 172-174 Rule Based Systems.Week 7 Lecture 26 Lecture 27 Lecture 28 Logic Programming-Intro to PROLOG Matching & Control Knowledge.

Ch-20 Pg 422-430 ->Reference :1.Ch-20 Pg 422-430 ->Reference :1.Ch-6 Pg 131-137 ->Reference :1. Individual 3/5 5 Approved for Spring Session 2011-12 .Week 11 Lecture 43 Lecture 44 Discovery. Objective Topic of the Homework Nature of homework (group/individuals/field work Individual Evaluation Mode Allottment / submission Week 2 / 10 Term Paper 1 To check the analytical skills of the students To check the knowledge and understanding of the student.Ch-6 Pg 131-137 ->Reference :1. Neural Net and Genetic learning Other advanced Topics in AI: Game Playing Other advanced Topics in AI: Game Playing Expert Systems Expert Systems & its architecture Expert Systems & its architecture PROLOG PROLOG PROLOG ->Reference :1.Ch-12 Pg 231-244 ->Reference :1.Ch-17 Pg 367-373 ->Reference :1. Formal Learning Theory.Ch-12 Pg 231-244 ->Reference :1.Ch-6 Pg 131-137 CA/REGULAR/CAP610/ Lecture43 CA/REGULAR/CAP610/ Lecture44 CA/REGULAR/CAP610/ Lecture45 CA/REGULAR/CAP610/ Lecture46 CA/REGULAR/CAP610/ Lecture47 CA/REGULAR/CAP610/ Lecture48 CA/REGULAR/CAP610/ Lecture49 CA/REGULAR/CAP610/ Lecture50 CA/REGULAR/CAP610/ Lecture51 CA/REGULAR/CAP610/ Lecture52 Week 12 Lecture 45 Lecture 46 Lecture 47 Lecture 48 Week 13 Lecture 49 Lecture 50 Lecture 51 Lecture 52 Spill Over Week 14 Lecture 53 Lecture 54 Pattern recognition Robotics CA/REGULAR/CAP610/ Lecture53 CA/REGULAR/CAP610/ Lecture54 Details of homework and case studies Homework No. Unique topic To be given to the students Based on writing and presentation skills and quality of content Writing skills and concept clearity Test 1 Test to be taken from the syllabus covered till date.Ch-20 Pg 422-430 ->Reference :1.

consider x best out of y components of CA. No. NLP and expert system with expectations expected to be given to the students. Topic 1 Common sense ontology 2 Genetic algorithm 3 Biological robot 4 How intelligent machines can be harmful to human kind.Design problem 1 To check the logical reasoning of the students Atleast 4 design problems from game playing.Test. 5 Machine learning 6 Combining artificial intelligence and databases for data integration 7 Voice recognition 8 Facial expression recognition 9 Chomsky’s classification of languages 10 Neural networks 11 AI used in diagnosing diseases 12 Image recognition 13 AI in web search engines 14 Computer vision 15 NLP 6 Approved for Spring Session 2011-12 .Design problem Frequency 2 Total :Out Of 3 Each Marks Total Marks 10 10 20 20 * In ENG courses wherever the total exceeds 100. Individual Original work 9 / 12 Scheme for CA:out of 100* Component Term Paper. as explained in teacher's guide available on the UMS List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper) Sr.

7 Approved for Spring Session 2011-12 .

Sign up to vote on this title
UsefulNot useful