The course will enable the students to
Course Learning Outcomes (CLOs):
Learning Outcome (at course level) Students will be able to: | Learning and teaching strategies | Assessment Strategies |
| Interactive Lectures, Modeling, Discussions, Using research papers, student centered approach, Through Video Tutorials
Learning activities for the students: Experiential Learning, Presentations, case based learning, Discussions, Quizzes and Assignments
|
|
The AI problems: what is an AI technique, Characteristics of AI applications Problem Solving, Search and Control Strategies General Problem solving, Production systems, Control strategies, forward and backward chaining Exhaustive searches: Depth first Breadth first search.
Hill climbing, Branch and Bound technique, Best first search and A* algorithm, AND/OR Graphs, Problem reduction and AO* algorithm, Constraint Satisfaction problems Game Playing Min Max Search procedure, Alpha-Beta cutoff, Additional Refinements.
First Order Predicate Calculus, Resolution Principle and Unification, Inference Mechanisms Horn’s Clauses, Semantic Networks, Frame Systems and Value Inheritance, Scripts, Conceptual Dependency AI Programming Languages Introduction to LISP, Syntax and Numeric Function, List manipulation functions, Iteration and Recursion, Property list and Arrays, Introduction to PROLOG.
Context-Free Grammar, Recursive Transition Nets (RTN), Augmented Transition Nets (ATN), Semantic Analysis, Case and Logic Grammars, Planning Overview – An Example Domain: The Blocks Word, Component of Planning Systems, Goal Stack Planning (linear planning), Non-linear Planning using constraint posting, Probabilistic Reasoning and Uncertainty, Probability theory, Bayes Theorem and Bayesian networks, Certainty Factor.
Introduction to Expert Systems, Architecture of Expert Systems, Expert System Shells, Knowledge Acquisition, Case Studies, MYCIN, Learning, Rote Learning, Learning by Induction, explanation based learning.