Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures,Tutorials and Labs

Course No CAP653

Cours Title ARTIFICIAL INTELLIGENCE AND LOGIC PROGRAMMING

Course Planner 12279 :: Avneet Kaur Dhawan

Lectures Tutorial Practical Credits 3 1 3 5

Text Book:

1 Artificial Intelligence ,Author Rich,Knight , Tata McGraw publication

Other Specific Book:

2 Introduction of AI and Expert System, Author D.W Patterson ,Prentice Hall 3 P.H. Winston, Artificial Intelligence 4 N.J. Nilsson, Principles of Artificial Intelligence , Kaufmann,1980 5 Charnmiak & M. Dermalt , Introduction of AI, Addison Wesley ,1985 6 A.J. Gongalez & D.D. Dankel, The Engineering of Knowledge based systems theory & practice, Prentice Hall, 1993 7 G.F.Lager & W.A. Stubblefield, Artificial Intelligence and the design of Expert System , Benjamin Kummings, 1989

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 8 http://www.journals.wspc.com.sg/ijait/ijait.shtml 9 http://www-lsi.upc.es/~miquel/aijournals.html Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) 10 www.wikipedia.com Salient Features Introduction to AI in PPTs

Approved for Autumn Session 2011-12

11 http://www.csc.liv.ac.uk/_konev/COPM210 12 http://inst.cs.berkeley.edu/~cs188/archives.html

AI basic concepts AI descriptive conceepts-pdf

Detailed Plan For Lectures

Week Number Lecture Number Lecture Topic Chapters/Sections of Pedagogical tool Textbook/other Demonstration/case reference study/images/anmatio n ctc. planned

Part 1
Week 1 Lecture 1 Lecture 2 Lecture 3 Week 2 Lecture 4 Lecture 5 Lecture 6 Week 3 Lecture 7 Lecture 8 Lecture 9 Week 4 Lecture 10 Introduction and Overview: Meaning of AI, Historical foundations Development of logic, Turing test Applications of AI ,AI & related fields Problems, Problem Spaces, and Search: Problems & state Space Search Production Systems - BFS, DFS, DFS with iterative deepening Problem & Production System characteristics Design on Search Programs Heuristic Search: Generate & Test, Hill Climbing Best First Search, Problem reduction Constraint Satisfaction, Means-End Analysis ->Reference :1,Ch-1 (Pg 3-4) ->Reference :1,Ch-1 (Pg4-6) ->Reference :1,Ch-1 (Pg 7-18) ->Reference :1,Ch-2 (Pg 25-30) ->Reference :1,Ch-2 (30-33) ->Reference :1,Ch-2 (36-45) ->Reference :1,Ch-2 (45-46) ->Reference :1,Ch-3 (50-53) ->Reference :1,Ch-3 (57-59) ->Reference :1,Ch-3 (68-71) CA/Honours/CAP653/Sr No01 CA/Honours/CAP653/Sr No02 CA/Honours/CAP653/Sr No03 CA/Honours/CAP653/Sr No04 CA/Honours/CAP653/Sr No05 CA/Honours/CAP653/Sr No06 CA/Honours/CAP653/Sr No07 CA/Honours/CAP653/Sr No08 CA/Honours/CAP653/Sr No09 CA/Honours/CAP653/Sr No10

Part 2
Week 4 Lecture 11 Lecture 12 Knowledge Representation: General concepts of knowledge Approaches & issues in knowledge representation ->Reference :1,Ch-3 (72-74) ->Reference :1,Ch-4 (79-81) CA/Honours/CAP653/Sr No11 CA/Honours/CAP653/Sr No12

Approved for Autumn Session 2011-12

Week 5

Lecture 13 Lecture 14 Lecture 15

Propositional and predicate logic to represent knowledge Resolution, Natural Deduction Procedural vs Declarative Knowledge, Logic Programming Forward vs backward Reasoning Matching & Control Knowledge Symbolic Reasoning Under uncertainty: Nonmonotonic reasoning Augmenting a Problem solver Statistical reasoning:Probability Bayes Theorem

->Reference :1,Ch-4 (82-95) ->Reference :1,Ch-5 (98-108) ->Reference :1,Ch-5 (108-125) ->Reference :1,Ch-6 (129-133) ->Reference :1,Ch-6 (134-137) ->Reference :1,Ch-6 (138-145) ->Reference :1,Ch-7 (147-157) ->Reference :1,Ch-7 (158-160) ->Reference :1,Ch-8 (172-179)

CA/Honours/CAP653/Sr No13 CA/Honours/CAP653/Sr No14 CA/Honours/CAP653/Sr No15 CA/Honours/CAP653/Sr No16 CA/Honours/CAP653/Sr No17 CA/Honours/CAP653/Sr No18 CA/Honours/CAP653/Sr No19 CA/Honours/CAP653/Sr No20 CA/Honours/CAP653/Sr No21

Week 6

Lecture 16 Lecture 17 Lecture 18

Week 7

Lecture 19 Lecture 20 Lecture 21

MID-TERM Part 3
Week 8 Lecture 22 Lecture 23 Lecture 24 Week 9 Lecture 25 Lecture 26 Lecture 27 Week 10 Lecture 28 Rule based Systems Bayesian N/W Dampster Shafer theory Fuzzy logic Overview of weak slot and filler structures & strong slot and filler structures Natural Language Processing-Meaning, Syntactic Processing Semantic Analysis, Discourse & Pragmatic processing ->Reference :1,Ch-8 (172-179) ->Reference :1,Ch-8 (179-180) ->Reference :1,Ch-8 (181-184) ->Reference :1,Ch-8 (184-185) ->Reference :1,Ch-9 (188-192) ->Reference :1,Ch-15 (285-300) ->Reference :1,Ch-15 (300-321) CA/Honours/CAP653/Sr No22 CA/Honours/CAP653/Sr No23 CA/Honours/CAP653/Sr No24 CA/Honours/CAP653/Sr No25 CA/Honours/CAP653/Sr No26 CA/Honours/CAP653/Sr No27 CA/Honours/CAP653/Sr No28

Part 4
Week 10 Lecture 29 Learning: Meaning, Rote Learning ->Reference :1,Ch-15 (300-321) CA/Honours/CAP653/Sr No29

Approved for Autumn Session 2011-12

Week 10 Week 11

Lecture 30 Lecture 31 Lecture 32 Lecture 33

Various Type of Learning, discovery Formal learning Theory, Neural Net & Genetic Learning Other Advance Topics of AI: Game Playing Expert Systems & its architecture Expert Systems & its architecture Understanding & Common Sense Pattern recognition

->Reference :1,Ch-17 (347-349) ->Reference :1,Ch-17 (349-364) ->Reference :1,Ch-17 (372-373) ->Reference :1,Ch-12 (231-234) ->Reference :1,Ch-20 (422-427) ->Reference :1,Ch-14 (272-278) ->Reference :1,Ch-14 (300-314)

CA/Honours/CAP653/Sr No30 CA/Honours/CAP653/Sr No31 CA/Honours/CAP653/Sr No32 CA/Honours/CAP653/Sr No33 CA/Honours/CAP653/Sr No34 CA/Honours/CAP653/Sr No35 CA/Honours/CAP653/Sr No36

Week 12

Lecture 34 Lecture 35 Lecture 36

Spill Over
Week 13 Lecture 37 Lecture 38 Fuzzy Logic System Genetic Algorithm CA/Honours/CAP653/Sr No37 CA/Honours/CAP653/Sr No38

Details of homework and case studies

Homework No. Objective Topic of the Homework Nature of homework (group/individuals/field work Individual Individual Individual Evaluation Mode Allottment / submission Week 3/5 8 / 10 2 / 11

Class test based To prepare the on homework 1 student for MTE Class test based To prepare the on homework 2 student for ETE Speaking PPT 1 To develop the confidence and communication skills of students and improve their conceptual knowledge.

Syllabus covered till the date scheduled for test. Syllabus covered till the scheduled date. Different topics as mentioned in the list below.

Quality of content Offline Offline

Approved for Autumn Session 2011-12

Plan for Tutorial: (Please do not use these time slots for syllabus coverage)
Tutorial No. Lecture Topic Type of pedagogical tool(s) planned (case analysis,problem solving test,role play,business game etc)

Tutorial 1 Tutorial 2 Tutorial 3 Tutorial 4 Tutorial 5 Tutorial 6 Tutorial 7

COGITO EXPERT SYSTEM PATTERN MATCHING FUZZIFICATION DEFUZZIFICATION GAME PLAYING KNOWLEDGE REPRESENTATION SEARCHING TECHNIQUES

Case analysis Problem solving Problem solving Problem solving Business game Case analysis Problem solving

After Mid-Term
Tutorial 8 Tutorial 9 Tutorial 10 Tutorial 11 Tutorial 12 ROBOTICS NEURAL NETWORKS METLAB AND FUZZY PRACTICAL QUESTIONS ON PROLOG LATEST TECHNOLOGY Case analysis Case analysis Case analysis Problem solving Problem solving

*Each experiment of the lab will be evaluated using following relative scheme:
Component VIVA WR J/E % of Marks 30 20 50

List of experiments :Lecture Number Programming 1 Lecture Topic Prolog-Converting English to prolog Facts and Rules Pedagogical Tools Or Equipment Planned PROLOG,PC lab Manual Not Applicable

Approved for Autumn Session 2011-12

Programming 2 Programming 3 Programming 4 Programming 5 Programming 6 Programming 7 Programming 8 Programming 9 Programming 10 Programming 11 Programming 12 Programming 13 Programming 14 Programming 15 Programming 16 Programming 17 Programming 18

Prolog-Converting English to prolog Facts and Rules Prolog-Converting English to prolog Facts and Rules USE of Prolog Terminology USE of Prolog Terminology USE of Prolog Terminology Implementing and using Prolog Variables Implementing and using Prolog Variables Prolog Control Structure Prolog Control Structure Prolog Control Structure Implementing Prolog Arithmetic Operators Implementing Prolog Arithmetic Operators Implementing Prolog Arithmetic Operators Progrms of Matching in Prolog Progrms of Matching in Prolog Prolog Backtracking & cuts Prolog Backtracking & cuts

PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC

Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable

Mid Term
Programming 19 Programming 20 Recursion in prolog Recursion in prolog PROLOG,PC PROLOG,PC Not Applicable Not Applicable

Approved for Autumn Session 2011-12

Programming 21 Programming 22 Programming 23 Programming 24 Programming 25 Programming 26 Programming 27 Programming 28 Programming 29 Programming 30

Lists Lists Dynamic Databases Dynamic Databases Input/Output and Streams Input/Output and Streams Input/Output and Streams Dynamic Databases Dynamic Databases Dynamic Databases

PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC PROLOG,PC

Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable Not Applicable

Spill Over
Programming 31 Programming 32 Dynamic Databases Dynamic Databases PROLOG,PC PROLOG,PC Not Applicable Not Applicable

Approved for Autumn Session 2011-12