Course Outline KRR

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 4

Knowledge Representation and Reasoning - Theory

Credit Hours: 3(3-2) Prerequisites: None


Teacher: Dr.Noureen Office: R-22 [email protected]
Zafar k

Course Introduction:
Knowledge Representation and Reasoning is at the core of Artificial Intelligence. It is
concerned with the representation of knowledge in symbolic form and the use of this
knowledge for reasoning. This course presents current trends and research issues in
Knowledge Representation and Reasoning. It enables students interested in Artificial
Intelligence to deepen their knowledge in this important area and gives them a solid
background for doing their own work/research in this area. The topics covered in more
detail are AI Logics, Probabilistic Reasoning, Constraints, and Stochastic models
Reference Materials:
 “Knowledge Representation and Reasoning” by Ron Brachman and Hector
Levesque.
 "Artificial Intelligence: A Guide to Intelligent Systems" by Michael Negnevitsky
 "Expert Systems: Principles and Programming" by Joseph C. Giarratano and Gary
D. Riley

Course Objectives:
On completion of this module, students should be able to:
 Demonstrate an understanding of the fundamental ideas of Knowledge
Representation and Reasoning.
 Demonstrate an understanding of the principles of a number of different
approaches in Machine Learning.
 Demonstrate the ability to apply AI and Computational Intelligence
techniques to a variety of research and application projects.

Week # Topics

Week 1  Knowledge Representation and Reasoning


 Modeling
 Propositional Logic
Week 2  Formal Logic and Reasoning, First-order Logic
 Different Kinds of Reasoning
 Model-Finding and Satisfiability
Week 3  Reasoning using Description Logic
 Formal Reasoning
 Commonsense Reasoning
 Expressing Knowledge
Week 4  Reasoning with Horn Clauses
 Horn Clauses and SLD Resolution
 Forward Chaining and Backward Chaining
 Advantages and uses
Week 5  Procedural Control of Reasoning
 Facts and Rules
 Rule Formation and Search Strategy
 Dynamic Databases
Week 6  Probability
 Objective Probability and Subjective Probability
 Basic Bayesian Approach
 Belief Networks
Week 7  Semantic networks, Components
 Mutualist networks
 Aggregate networks
 Empirical networks
 Hashtag network
Week 8  Ontologies
 Ontology Languages
 Ontology (case frames)

MIDTERMS

Week 9  Agents
 Rule based Agents
 Multi-agent Resource Allocation
 Rule-based system

Week 10  Rule-based Knowledge Representation


 Reasoning Under Uncertainty
 Bayesian Networks Representation
 Inference in Bayesian Networks
Week 11  Expert Systems and Decision Support Systems
 Expert Systems Components
 Expert System Rules and Working

Week 12  Fuzzy Logic


 Fuzzy Rules
 Inference using Fuzzy Rules
Week 13  Stochastic models
 Markov Models
 Hidden Markov model
 Markov chain

Week 14  Monte Carlo Simulation


 Regression Models
Week 15  Presentations/Term Projects

Week 16  Presentations/Term Projects

Final Term Exam

ProgrammingAssignments DoneintheCourse:
Students will be assigned a series of in-class and homework tasks designed to develop
and enhance their programming and problem-solving skills.

Teaching Methodology:
Lectures, Written Assignments, Practical labs, Semester Project, Presentations
Courses Assessment:
Mid Exam, Home Assignments, Quizzes, Project, Presentations, Final Exam
Grading for 3(3-0) A-48-above, B=39-47, C=30-38, D=24-29, F= less than 24

ClassTimeSpenton(incredithours):

Theory ProblemAnalysis Solution Designand SocialandEthicalIssue


PracticalDevelopment s
40% 15% 40% 5%

Course Learning Outcomes (CLOs)/PLOs Mapping


At the end of course the students will be able to: Bloom Taxonomy
1. Students should be able to describe the underlying C1 (Knowledge)
concepts of data mining. Understand the Data Mining
Process and implement data mining process based
solutions.

2. Application of data mining algorithms. C2 (Apply)

3. Analysis of valid patterns in test data using data C3 (Apply)


mining experiments with test data.

C=Cognitive domain

CLO – PLO Mapping

CLOs
CLO:1 CLO:2 CLO:3
PLOs
PLO-1 √ √
(Knowledge)
PLO-2 √
(ProblemAnalysis)
PLO-3 √
(System Design)

You might also like