Sie sind auf Seite 1von 2

CSE- 4715 : Artificial Intelligence Credit Hours: 3 No Type Date 1 Lecture-1 2 Lecture-2 3 Lecture-3 4 Lecture-4 5 Lecture-5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 Lecture-6 Lecture-7

Lecture-8 Lecture-9 Lecture-10 CT-1 Lecture-11 Lecture-12 Lecture-13 Lecture-14 Lecture-15 Lecture-16 Lecture-17 Lecture-18 Lecture-19 CT-2 Lecture-20 Lecture-21 Lecture-22 Lecture-23 Lecture-24 Lecture-25 Lecture-26 Lecture-27 Lecture-28 CT-3 Lecture-29 Lecture-30 Lecture-31 Lecture-32 Lecture-33 Lecture-34 Lecture-35 Lecture-36 Lecture-37 CT-4 Review

Contact Hours: 3 per week[Pre requisite: CSE-2409 Computer Algorithms] Seg Details Ref 1 Introduction, The Foundations of AI, The History of AI 1.1 1 AI technique, The State of the Art 1.1,2.1 Agent and Environment, Rationality, Nature of Environments 1.2 1 Structure of Agent, Types of Agent 1.2 1 Problems, Example of Problems, Problem Formulation, Breadth-First 1.2,1.3 search 1 Search Strategies, Uninformed (blind) search strategies like Uniform 1.3 cost search, Depth-First Search, Iterative Deepening search 2 Informed or Heuristic Search Strategies like Best-First Search, A*, 1.4 IDA*, RBFS, MA*, SMA* Search 2 Heuristic Search, Hill Climbing, Simulated Annealing 1.4,2.3 2 Constraint Satisfaction, Means-End Analysis 2.3 3 Knowledge based agent, Wumpus world, Logic 1.7 Seg1, Seg2 3 Propositional Logic: Syntax, Semantics, Validity and Inference 1.7,3.4 3 Rules of Inference for Propositional logic 1.7,3.4 3 First-Order Logic: Syntax and Semantics, Using first-order logic 1.8 3 Exercises 4 Inference Rules Involving Quantifiers, Example Proof, 3.4 4 Generalized Modus Ponens 3.4 4 Forward and Backward Chaining 1.9,4.6 4 Completeness, Resolution 3.4 4 Exercises on First order logic Seg3, Seg4 5 5 5 5 6 6 6 6 7 Introduction, Perfect Decisions, Imperfect Decisions Alpha-Beta Pruning; Natural language processing: Introduction, Syntactic Processing, Semantic Analysis Discourse and Pragmatic Processing. Plan-Generating Systems, Forward Production System, Representation for Plans Backward Production System STRIPS, Examples with problem domain Introduction to Learning, Inductive Learning, Learning Decision Trees Seg5, Seg6 Artificial Neural Network, Neural Net Learning Methods Delta Rule Back propagation Learning Associative Memory Probability and Bayes Theorem, , Certainty Factors and Rule-Based Systems, Bayesian Networks Fuzzy Logic Some Expert Systems: Representation and Using Domain Knowledge Expert System Shells, Explanation, Knowledge Acquisition Seg7, Seg8 1.6, sheet 1.6, sheet 2.15 2.15 Sheet 4.7 4.7 4.7 4.18,1.18, Sheet 1.18, Sheet Sheet 6.3 6.4 1.13 Sheet Sheet 4.15 2.20

7 7 7 7 8 8 8 8 8

Recommended Books: 1. Stuart Russell and Peter Norvig 2. Elaine Rich and Kevin Knight 3. Dan W. Patterson 4. Nils J. Nilsson 5. L. H. Tsoukalas and R. E. Uhrig 6. S Rajeskaran Total Marks Distribution Class Attendance Class Test+ Assignment Mid-term Exam (Answer 3 Q out of 4 (seg1-seg3)) Final Exam (Answer 2 Q from Group A (seg4&5) and 3 Q from Group B(seg6-seg8))

: Artificial Intelligence A Modern Approach, Pearson Education : Artificial Intelligence, Tata McGraw-Hill Publishing Company Ltd. : Introduction to Artificial Intelligence and Expert System : Principles of Artificial Intelligence, Narosa Publishing House. : Fuzzy and Neural Approaches in Engineering. :Neural Network, Fuzzy Logic and Genetic Algorithm Synthesis and Application Class Attendance Mark Distribution >=90% : 10 >=85% : 9 >=80% : 8 >=75% : 7 >=70% : 6 >=65% : 5 Dis-collegiate >=60% : 4 <60% : Non-collegiate Class Test System Count Best 2 Class test out of 3 Total Mark of each Class Test is 10 Total Time of each Class Test is 30 mins Answer any 2 of the given 3 Questions # Separate note book should be maintained # For Assignment: 5% one day late, 10% two days late, 15% three days late, 20% four days late, Not accepted after 4 days

: 10 : 10 : 30 : 50 100

Prepared by

(Md. Atikur Rahman) Lecturer

Dept of CSE, IIUC

Das könnte Ihnen auch gefallen