Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No CSE452T

Cours Title AI AND LOGIC PROGRAMMING

Course Planner 14666 :: Chandra Prakash

Lectures Tutorial Practical Credits 4 0 0 4

Text Book:

1 Rich, Knight, Title: Artificial Intelligence, Publishers: Tata McGraw Hill, Year of Publication:2006

Other Specific Book:

2 Amit Konar, Artificial Intelligence and Soft Computing, CRC , 2000 3 D.W.Patterson, Introduction to AI & Expert Systems, Prentice Hall. 4 N.J.Nilsson, Principles of Artificial Intelligence, Kaufmann, 1980 5 Charnmiak & M. Dermalt, Introduction to AI , Addison Wesley, 1985. 6 Anupam Shukla , Ritu Tiwari and Rahul Kala, Real Life Applications of Soft Computing, CRC Press 2010 7 A.J. Gongalez & D.D. Dankel, The Engineering of Knowledge based systems theory & practice, Prentice Hall, 1993. 8 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) 9 http://www.pcai.com/web/ai_info/logic_programming.html 10 http://www.rpi.edu/~brings/ilogprog.html Relevant Websites

Approved for Spring Session 2011-12

Sr. No. (Web adress) (only if relevant to the courses) 11 http://en.wikipedia.org/wiki/Logic_programming 12 http://en.wikipedia.org/wiki/Artificial_intelligence 13 http://wiki.aigamedev.com/

Salient Features Basics of logic programming Basic of AI AI games illustrated

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 Lecture 4 Week 2 Lecture 5 Lecture 6 Lecture 7 Introduction and Overview of Artificial Intelligence Meaning of AI , Historical foundations,Turing test Various AI techniques Applications of AI & related fields Production System 8 puzzle problem, TSP , DFS, TOH, M&C Problem Characteristics Heuristic Search Techniques- Generate and Test, Hill Climbing ALLOTMENT OF Home work BFS AND-OR graph and algorithm Constrain Satisfaction Knowledge Representation Introduction, Representation and Mapping Approaches of Knowledge Representation Approaches of Knowledge Representation ALLOTMENT OF DESIGN PROBLEM ->Reference :1,1.1 ->Reference :1,1.2 1.5 ->Reference :1,1.3 ->Reference :4,1.4 ->Reference :1,2.2 ->Reference :1,2.3 ->Reference :1,3.1 3.2

Lecture 8 Week 3 Lecture 9 Lecture 10 Lecture 11 Lecture 12 Week 4 Lecture 13

->Reference :1,3.3 ->Reference :1,3.4 ->Reference :1,3.5 ->Reference :1,4.1 ->Reference :1,4.2 ->Reference :1,4.2

Part 2
Week 4 2 Lecture 14 Various issues in KR ->Reference :1,4.3 Approved for Spring Session 2011-12

Week 4

Lecture 15 Lecture 16

Various issues in KR , Submission of home work Predicate Logic -Facts in logic

->Reference :1,4.3 ->Reference :1,5.1 http://www.kddresearch. org/Courses/Fall2004/CIS730/Lectures/L ecture-11-20040915.pdf

Week 5

Lecture 17

Computable functions and predicate , Resolution

->Reference :1,5.3 5.4

Lecture 18 Lecture 19 Lecture 20 Week 6 Lecture 21 Lecture 22 Lecture 23 Lecture 24 Week 7 Lecture 25 Lecture 26 Lecture 27 Lecture 28

Resolution Algorithms Representing knowledge using Rules: Procedural v/s declarative knowledge , Logic Programming Forward and backward reasoning Matching and Indexing Symbolic reasoning Under Uncertainty-Non monotonic reasoning, Logics for NMR Implementation issues and augmenting problem solver DFS and BSF Statistical Reasoning: Probability and bayes problem Certainty factors and rules based systems Bayesian Network Dempster Shafer Theory,fuzzy logic

->Reference :1,5.4 ->Reference :1,6.1 6.2 ->Reference :1,6.3 ->Reference :1,6.3 ->Reference :1,7.1 7.2 ->Reference :1,7.3 7.4 ->Reference :1,7.5 7.6 www.cs.sunysb.edu/~ski ena/392/programs ->Reference :1,8.1 ->Reference :1,8.2 ->Reference :1,8.3 ->Reference :1,8.4 8.5

MID-TERM Part 3
Week 8 Lecture 29 Lecture 30 Lecture 31 Lecture 32 Week 9 Lecture 33 Weak Slot and Filter structure: Semantic nets Frames set and instance Frames Slots as full fledged object overview of strong slot Natural Language Processing: Introduction ->Reference :1,9.1 ->Reference :1,9.2 ->Reference :1,9.2.3 ->Reference :1,10.1 10.2 ->Reference :1,15.1 http://www.copywriting.c om/blog/copywriting/hid den-commands-andnlplivedemo/ Approved for Spring Session 2011-12

Week 9

Lecture 34 Lecture 35 Lecture 36

Syntactic Processing Grammars and Parsers Syntactic Processing Augmented transition networks Semantic Analysis Conceptual Parsing Discourse and Pragmatic processing Statistical NLP

->Reference :1,15.2.1 ->Reference :1,15.2.2 ->Reference :1,15.3 ->Reference :1,15.3.3 ->Reference :1,15.4 ->Reference :1,15.5

Week 10

Lecture 37 Lecture 38 Lecture 39

Part 4
Week 10 Week 11 Lecture 40 Lecture 41 Lecture 42 Spell Checking CLASSTEST Learning: Introduction , Rote learning,Learning by taking devices Learning in Problem Solving SUBMISSION OF DESIGN PROBLEM Learning by chunking Utility Problem Learning from induction Explanation bases learning Discovery Clustering, Analogy Overview of Game playing Machine Learning Techniques- Supervised , unsupervised Machine Learning Techniques- Reinforcement Learning Learning in Expert system Overview of Neural networks ->Reference :1,17.3 ->Reference :1,11 7.1 1 7.2 ->Reference :1,17.4 ->Reference :1,17.4.34 ->Reference :1,17.5 ->Reference :1,17.6 ->Reference :1,17.7 ->Reference :1,12 ->Reference :2,13.113.3 ->Reference :2,13.4 ->Reference :1,20 ->Reference :1,18.2 ->Reference :1,15.6 http://www.aspspellchec k.com/

Lecture 43 Lecture 44 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 4 Overview of genetic algo fuzzy logic ->Reference :1,23 ->Reference :1,22 Approved for Spring Session 2011-12

Details of homework and case studies

Homework No. Objective Topic of the Homework Nature of homework (group/individuals/field work Individual Evaluation Mode Allottment / submission Week 2/4

Homework 1

To check the analytic skill of students To evaluate student

week 1 to week 3

submission of the homework class test presentation /viva

Test 1

week 8 to week 10

Individual

11 / 11 4 / 11

Design problem 1 To check the analytical and logical skills of students

1.Simulate tower of hanoi using AI concepts Individual 2. Develop an expert system using concept of NLP that can solve the Student problems.

Scheme for CA:out of 100*

Component Homework,Test,Design problem Frequency 2 Total :Out Of 3 Each Marks Total Marks 10 10 20 20

* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, 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. No. Topic 1 1.Simulate tower of hanoi using AI concepts 2. Develop an expert system using concept of NLP that can solve the Student problems.

Approved for Spring Session 2011-12