Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No Cours Title Course Planner Lectures Tutorial Practical Credits

CSE452 ARTIFICIAL INTELLIGENCE AND LOGIC PROGRAMMING 14666 :: Chandra Prakash 4 0 2 5

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

1 Approved for Spring Session 2010-11

Sr. No. (Web adress) (only if relevant to the courses) Salient Features
11 http://en.wikipedia.org/wiki/Logic_programming Basics of logic programming
12 http://en.wikipedia.org/wiki/Artificial_intelligence Basic of AI
13 http://wiki.aigamedev.com/ AI games illustrated

Detailed Plan For Lectures

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

Part 1
Week 1 Lecture 1 Introduction to AI, AI problems ->Reference :1,Ch 1
sec 1.1
Lecture 2 Various AI techniques ->Reference :1,Ch 1
sec1.3
Lecture 3 Various AI techniques

Lecture 4 Real world problems related to AI ->Reference :1,Ch2

sec2.1
Week 2 Lecture 5 Production System 8 puzzle problem, TSP , DFS, ->Reference :1,Ch2 http://www.8puzzle.com/
TOH, M&C sec2.2
Lecture 6 Problem Characteristics ->Reference :1,Ch2 http://www.vclcomponen
sec2.3 ts.com/s/0__/source_co
de_for_hill_climbing
Lecture 7 Heuristic Search Techniques- Generate and Test, ->Reference :1,Ch3
Hill Climbing sec3.13.2
Lecture 8 BFS ->Reference :1,Ch3 HomeWork 1 Allocation http://www.cs.princeton.
sec3.3 edu/courses/archive/fall
06/cos226/demo/51dem
o-bfs.ppt
Week 3 Lecture 9 AND-OR graph and algorithm ->Reference :1, Ch3 Design problem1
sec3.4
Lecture 10 Constrain Satisfaction ->Reference :1,Ch3
sec3.5
Lecture 11 Knowledge Representation Introduction, ->Reference :1,Ch4 http://groups.csail.mit.ed
Representation and Mapping sec4.1 u/medg/people/psz/ftp/k-
rep.html

2 Approved for Spring Session 2010-11

Week 3 Lecture 12 Approaches of Knowledge Representation ->Reference :1,Ch4
sec4.2
Week 4 Lecture 13 Approaches of Knowledge Representation ->Reference :1,Ch4
sec4.2
Lecture 14 Various issues in KR ->Reference :1,Ch4 HomeWork 1 Submission
sec4.3

Part 2
Week 4 Lecture 15 Various issues in KR ->Reference :1,Ch4
sec4.2
Lecture 16 Predicate Logic -Facts in logic ->Reference :1,Ch5 HomeWork 2 Allocation http://www.kddresearch.
sec5.1 org/Courses/Fall-
2004/CIS730/Lectures/L
ecture-11-20040915.pdf
Week 5 Lecture 17 Computable functions and predicate , Resolution ->Reference :1,Ch5
sec5.35.4
Lecture 18 Resolution Algorithms ->Reference :1, Ch5
sec5.4
Lecture 19 Representing knowledge using Rules: Procedural ->Reference :1,Ch6 http://www.springerlink.c
v/s declarative knowledge , Logic Programming sec6.16.2 om/index/72u97m4u637
09558.pdf
Lecture 20 Forward and backward reasoning ->Reference :1,Ch6
sec6.3
Week 6 Lecture 21 Matching and Indexing ->Reference :1,Ch6 HomeWork 2 Submission
sec6.4
Lecture 22 Symbolic reasoning Under Uncertainty-Non ->Reference :1,Ch7
monotonic reasoning, Logics for NMR sec7.17.2
Lecture 23 Implementation issues and augmenting problem ->Reference :1,Ch7
solver sec7.37.4
Lecture 24 DFS and BSF ->Reference :1,Ch7 www.cs.sunysb.edu/~ski
sec7.57.6 ena/392/programs
Week 7 Lecture 25 Statistical Reasoning: Probability and bayes ->Reference :1,Ch:8
problem sec:8.1
Lecture 26 Certainty factors and rules based systems ->Reference :1,Ch:8
sec:8.2
Lecture 27 Bayesian Network ->Reference :1, Ch:8
sec:8.3
Lecture 28 Dempster Shafer Theory,fuzzy logic ->Reference :1,Ch:8
sec 8.48.5

3 Approved for Spring Session 2010-11

 MID-TERM
Part 3
Week 8 Lecture 29 Weak Slot and Filter structure: Semantic nets ->Reference :1,Ch:9
sec:9.1
Lecture 30 Frames set and instance ->Reference :1,Ch:9 HomeWork 3 Allocation
sec:9.2
Lecture 31 Frames Slots as full fledged object ->Reference :1, Ch:9
sec:9.2.3
Lecture 32 Slot values as objects, inheritance revisited ->Reference :1,Ch:9 Design problem2
sec:9.2.49.2.5
Week 9 Lecture 33 Natural Language Processing: Introduction ->Reference :1,Ch:15 http://www.copywriting.c
sec:15.1 om/blog/copywriting/hid
den-commands-and-nlp-
live-demo/
Lecture 34 Syntactic Processing Grammars and Parsers ->Reference :1,Ch:15
sec:15.2.1
Lecture 35 Syntactic Processing Augmented transition ->Reference :1,Ch:15
networks sec:15.2.2
Lecture 36 Semantic Analysis ->Reference :1,Ch:15
sec:15.3
Week 10 Lecture 37 Conceptual Parsing ->Reference :1,Ch:15
sec:15.3.3
Lecture 38 Discourse and Pragmatic processing ->Reference :1,Ch:15 HomeWork 3 Submission
sec:15.4
Lecture 39 Statistical NLP ->Reference :1,Ch:15
sec:15.5
Lecture 40 Spell Checking ->Reference :1,Ch:15 HomeWork 4 Allocation http://www.aspspellchec
sec:15.6 k.com/

Part 4
Week 11 Lecture 41 Learning: Introduction , Rote learning ->Reference :1,Ch:17
sec:17.117.2
Lecture 42 Learning by taking devices ->Reference :1,Ch:17
sec:17.3
Lecture 43 Learning in Problem Solving ->Reference :1,Ch:17
sec:17.4
Lecture 44 Learning by chunking Utility Problem ->Reference :1,Ch:17
sec:17.4.3-4

4 Approved for Spring Session 2010-11

 Week 12 Lecture 45 Learning from induction ->Reference :1,Ch:17
sec:17.5
Lecture 46 Explanation bases learning ->Reference :1,Ch:17
sec:17.6
Lecture 47 Discovery Clustering, Analogy ->Reference :1,Ch:17
sec:17.7
Lecture 48 Overview of Game playing ->Reference :1,Ch:17 HomeWork 4 Submission http://internetgames.abo
ut.com/od/demos/Game
_Demos_and_Trials.htm
Week 13 Lecture 49 Machine Learning Techniques- Supervised , ->Reference :2,ch 12
unsupervised sec : 13.1- 13.3
Lecture 50 Machine Learning Techniques- Reinforcement ->Reference :2,ch 13
Learning sec 13.4
Lecture 51 Learning in Expert system ->Reference :1,ch 12
sec : 20
Lecture 52 Overview of Neural networks ->Reference :1,ch 18
sec 18.2

Spill Over
Week 14 Lecture 53 Overview of Neural networks ->Reference :1,CH:18
Lecture 54 Overview of Neural networks

Details of homework and case studies

Homework No. Topic of the Homework Nature of homework
(group/individuals/field work
Homework 1 Introduction and Overview Individual
Homework 2 Problem Spaces & Search; Heuristic search and Knowledge Representation: Individual
Homework 3 Statistical reasoning Individual
Homework 4 NLP and Learning Individual

Scheme for CA:out of 100*

5 Approved for Spring Session 2010-11

 Component Frequency Out Of Each Marks Total Marks
Class test based on homework 3 4 7 21
Homework 3 4 3 9
Lab Assesment 30 30
Design problem 2 20 40

Total :- 60 100

* 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

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

List of experiments :-
Lecture Lecture Topic Pedagogical Tools Or Equipment Planned lab Manual
Number
Programming Generating Prolog based representation PC
1
Programming Implement Chain rule PC
2
Programming Calculate factorial of a given no using Prolog PC
3
Programming generate a family tree using Prolog PC
4
Programming generate a predicate to find sum of fist 10 no from the PC
5 list
Programming develop a predicate to print the no in ascending and PC
6 descending order
Programming Write a Prolog program to extract information PC
7

6 Approved for Spring Session 2010-11

 Mid Term
Programming find out max. and min no from given list PC
8
Programming find our prefix-suffix of given sequence PC
9
Programming extract element from given list PC
10
Programming find all possible permutation of a given sequence PC
11
Programming Chess queen puzzle problem PC
12
Programming implement script arthritic puzzle PC
13
Programming develop an expert system PC
14

Spill Over
Programming knowledge base system PC
15

7 Approved for Spring Session 2010-11