This action might not be possible to undo. Are you sure you want to continue?

02

LESSON PLAN

Sub Code & Name : CS2351–ARTIFICIAL INTELLIGENCE

LP-CS2351 LP: Rev. No: 00 Date: 03/12/2010 Page 1 of 6

Unit : I

Branch : CS

Semester : VI

UNIT I PROBLEM SOLVING 9 Introduction – Agents – Problem formulation – uninformed search strategies – heuristics – informed search strategies – constraint satisfaction Objective: To introduce Artificial intelligence, to learn the basics of designing intelligent agents that can solve general purpose problems and to explore the idea of problem solving by several search strategies

Session No 1 2 Topics to be covered Introduction 3 4 5 6 7 8 9 10 LESSON PLAN to Artificial Intelligence. Review Time in min 50 Ref Teaching Method LP-CS2351 T1 BB/LCD T1 LP: Rev. Nature Branch : CS Semester : VI of environments and Structure of agents Problem solving agents . Uniform-cost search.Problem formulation 50 with suitable examples. Bidirectional search. Local search in continuous spaces Constraint satisfaction problems – Backtracking 50 and local search. Local search for CSP. avoiding repeated states Informed search strategies – Greedy best first 50 search. Foundations and History of Artificial Intelligence Sub Code & Name : CS2351–ARTIFICIAL INTELLIGENCE Intelligent Agents – Agents and environment. Depth-limited search Uninformed search strategies – Iterative 50 deepening depth-first search.02 UNIT II LOGICAL REASONING 9 Logical agents – propositional logic – inferences – first-order logic – inferences in firstorder logic – forward chaining – backward chaining – unification – resolution Objective: To illustrate the basic concepts of logic and knowledge-based agents and to discuss the representation of knowledge and the reasoning process. Simulated Annealing and Local beam search Local search algorithms and optimization 50 problems – Genetic algorithms.02. Searching for solutions Uninformed search strategies – Breadth-first 50 search. No: 00 Date: 03/12/2010 Page: 2 of 6 BB/ LCD T1 T1 BB BB T1 BB T1 T1 T1 BB BB/ LCD BB T1 BB T1 BB/LCD DOC/LP/01/28. depth-first search. A* search Informed search strategies – Memory-bounded 50 heuristic search. 50 Unit : II Concept of Rationality. Heuristic Functions Local search algorithms and optimization 50 problems – Hill climbing. Also to define effective procedures for answering questions by making inferences in first-order logic .

25 Time LESSON Topics to be covered PLAN In min Logical agents – Knowledge based agents. Numbers. To understand the design of agent architectures to deal with uncertain environments . No: 00BB T1 T1 BB Page 3 of 6 T1 BB T1 T1 T1 T1 T1 T1 T1 T1 T1 T1 BB BB BB BB BB BB BB BB BB BB/LCD Date: 03/12/2010 DOC/LP/01/28.Forward 50 chaining Inference in First-order logic . Syntax and 50 Semantics of FOL.02. sets and lists First-order logic representation for Wumpus 50 world Inference in First-order logic .Assertions and queries. Inference Reasoning patterns in propositional logic 50 Agents based on propositional logic 50 First-order logic – Representation.Session No 11 12 13 14 15 16 17 18 19 20 21 22 23 24. to explain the method of achieving goals from a sequence of actions (planning) and how better heuristic estimates can be achieved by a special data structure called planning graph.02 UNIT III PLANNING 9 Planning with state-space search – partial-order planning – planning graphs – planning and acting in the real world . First –Order logic. representations and algorithms for planning.Resolution 50 Review 50 CAT I 75 Teaching LP-CS2351 Ref Method LP: Rev. 50 knowledge base. 50 Wumpus world Sub Code & Name : CS2351–ARTIFICIAL INTELLIGENCE Logic 50 Unit : III Branch : CS Semester : VI Propositional logic – Syntax. Semantics. Objective: To introduce the most basic concepts.Backward 50 Chaining Inference in First-order logic . 50 Kinship domain. Unification and lifting Inference in First-order logic .Propositional 50 Vs First order inference.

50 schedules and resources Planning and acing in the real world – 50 Hierarchical Task network planning Planning and acing in the real world – 50 Planning and acting in nondeterministic domains Planning and acing in the real world – 50 Conditional Planning in fully and partially observable environments Planning and acing in the real world – 50 Continuous Planning Planning and acing in the real world – 50 Multiagent Planning Review 50 Time In min 50 Ref Teaching Method LP-CS2351 T1 BB T1 T1 T1 T1 T1 T1 T1 T1 T1 BB BB BB BB BB BB BB BB BB/LCD LP: Rev.02 UNIT IV UNCERTAIN KNOWLEDGE AND REASONING 9 Uncertainty – review of probability .02. No: 00 Date: 03/12/2010 Page 4 of 6 DOC/LP/01/28. Backward state-space search Sub Code & Name : CS2351–ARTIFICIAL INTELLIGENCE Partial-order planning – Concept with an 50 Unit : IV CS Semester : VI example and heuristics Branch : Partial-order for planning Planning graphs Planning graphs for 50 heuristic estimation.probabilistic Reasoning – Bayesian networks – inferences in Bayesian networks – Temporal models – Hidden Markov models Objective: To understand the concept of uncertainty and to learn the syntax and semantics of probability theory and Bayesian networks and other approaches to uncertain reasoning .Session No 26 27 28 29 30 31 32 33 34 35 Topics to be covered Planning with state-space LESSON PLAN search – Forward state-space search. Graphplan algorithm Planning and acing in the real world – Time.

Independence. Dempster-Shafe theory. Prior probability.handling uncertain knowledge. Uncertainty and rational decisions : CS2351–ARTIFICIAL INTELLIGENCE Sub Code & Name Uncertainty – Basic Probability Notation – 50 Unit : V Branch : CS Semester : VI Propositions.02.Semantics of 50 Bayesian Networks Probabilistic Reasoning – Exact Inference in 50 Bayesian networks Probabilistic Reasoning – Approximate 50 Inference in Bayesian networks Probabilistic Reasoning – Other approaches to 50 Uncertain reasoning (Rule-based methods for uncertain reasoning. Objective: To understand the basic concepts of several learning techniques .48 LESSON PLAN Uncertainty – Acting under Uncertainty .02 UNIT V LEARNING 9 Learning from observation .Inductive learning – Decision trees – Explanation based learning – Statistical Learning methods . and The Axioms of probability Uncertainty – Inference using full joint 50 distribution. Fuzzy sets and fuzzy logic) Probabilistic Reasoning over time – Inference 50 in temporal models Hidden Markov models 50 Review 50 CAT II 75 Time in min 50 Ref Teaching Method LP-CS2351 T1 BB T1 T1 T1 T1 T1 T1 T1 BB BB BB BB/OHP BB BB BB LP: Rev. Atomic events. Bayes’ rule and its use Probabilistic Reasoning – Representing 50 knowledge in an Uncertain domain Probabilistic Reasoning .Session No 36 37 38 39 40 41 42 43 Topics to be covered 44 45 46 47. No: 00 Date: 03/12/2010 Page 5 of 6 T1 T1 T1 BB BB/OHP BB/OHP DOC/LP/01/28.Reinforcement Learning.

02.Explanation based learning Statistical Learning methods – Statistical 50 learning. Inductive learning Learning from observation .Active Reinforcement 50 Learning.Session No 49 50 51 52 53 54 55 Topics to be covered 56 57 58 59. Policy search. Learning with complete data Statistical Learning methods – Learning with 50 hidden variables (EM algorithm) Statistical Learning methods – Instance based 50 learning Statistical Learning methods – Neural Networks 50 (Network structures.02 Course Delivery Plan Week 1 I II 2 I II 3 I II 4 I II 5 I II 6 I II 7 I II 8 I II 9 I II 10 I II 11 I II 12 I II 13 I II 14 I II 15 I II Units 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 4 5 5 5 5 5 5 3 4 BOOKS FOR STUDY: .Learning Decision 50 Sub Code & Name : CS2351–ARTIFICIAL INTELLIGENCE trees Semester50 : VI Knowledge in learning Branch : CS . Multilayer feed-forward neural network) Statistical Learning methods – Kernel Machines 50 Reinforcement Learning – Introduction.60 Learning from observation LESSON PLAN – Forms of learning. Passive 50 Reinforcement Learning Reinforcement Learning. No: 00 Page 6 of 6 T1 Date: BB/OHP 03/12/2010 T1 T1 T1 T1 T1 BB BB BB BB BB T1 T1 T1 BB BB BB DOC/LP/01/28. Review CAT III 75 Time In min 50 Ref Teaching Method LP-CS2351 T1 BB/OHP LP: Rev. Single layer feed-forward neural network. Generalization in Reinforcement Learning.

“Artificial Intelligence: Structures and Strategies for complex problem solving”.Jayabhaduri Assistant Professor/CS 03/12/2010 Dr. “Artificial Intelligence: A new Synthesis”. Luger. 2. 2002. 2003. Pearson Education.TEXT BOOK: 1. Second Edition. J. Department of CS 03/12/2010 Approved by . Norvig. Nilsson. Alan Mackworth. Russel and P. Oxford University Press. 1998.R.M. “Artificial Intelligence – A Modern Approach”. Randy Goebel.Gopalakrishnan HOD. Fourth Edition. REFERENCES: 1. Prepared by Signature Name Designation Date Ms. ”Computational Intelligence : a logical approach”. Elsevier Publishers. 3. G. Pearson Education. S. David Poole. 2004.

- Introduction to Statistical Relational Learning
- Logical and Relational Learning
- D.Barber020310
- Bayesian Inference - Algo for Udating Belifes
- Barber.bayesian.learning
- Rst a 20120222
- szhengboxie_ICONIP2011
- Semi Supervised Learning Adaptive Computation and Machine Learning
- Presentation Asrul
- Bayesian_Reasoning_and_Machine_Learning.epub
- soiaML
- Research papers
- Lecture1.pptx
- Recommending Learning Algorithms and Their Associated Hyperparameters
- A Hybrid Prognostics and Health-VImp
- 1 - 2 - What is Machine Learning- (7 Min)
- 5
- Machine Learning Introduction
- An Intelligent Agent
- Analyst Skills
- L21 Intro ML
- Machine Learning and Big Data at Foursquare
- CapStone Project
- A Machine Learning Analysis of Expressive Timing in Pianists' Performances of Schumann's 'Träumerei' (Gerhard Widmer)
- Evolution
- Towards Machine Learning on the Semantic10.1.1.139.528
- 15-237
- The Character of Logic in India.(B.matilal)(SUNY,1998)(600dpi,Lossy)
- Discovering Expressive Transformation Rules From Saxophone Jazz Performances
- Arguments in Normal English
- CS2351

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd