BACHELOR OF SCIENCE IN COMPUTER SCIENCE

UNIT CODE SCS B310

UNIT NAME FOUNDATION OF ARTIFICIAL INTELLIGENCE
STAGE/YEAR Y3S2
LECTURE HOURS 3 HOURS PER WEEK
PRE-REQUISITE SCS B106
LECTURER MS. PENINAH J. LIMO
AIM/OBJECTIVE GENERAL OBJECTIVE
By the end of this unit the student should be able to:
 Appreciate the concepts in propositional and predicate calculus.
 Select an appropriate heuristics search algorithm for a problem and implement it by
designing the necessary heuristic evaluation function.
 Use a logic programming language to implement logical reasoning systems.
 Formulate logical reasoning strategies and models.
COURSE CONTENT
WEEK DETAILS HOURS
1 Introduction to AI 3
 A Brief History of Artificial Intelligence
 Uses and Limitations
 Problem characteristics

2 Intelligent agents 3

 Agents and Environments

 Structure of Agents.

3 Problem Solving by Searching 3

 Uninformed Search Strategies: -Breadth-First Search, Depth-First Search, Depth-
limited Search, Iterative Deepening,Depth-first Search
 Informed Search and Exploration: -Informed (Heuristic) Search Strategies:
Greedy Best-first Search, A* Search, Heuristic Functions, Local Search Algorithms
and Optimization Problems.

4 CAT 1
5 Knowledge representation and logic 3
Propositional Logic, Propositional Inference(Forward chaining, Backward chaining),
First order Logic,
Semantic networks, Production rules, Frames
6 Reasoning 3

 Logical reasoning and methods-deduction,induction,Abduction, Analogy

 Reasoning with Uncertainty –Non-monotonic,statistical and fuzzy logic
 Probabilistic Reasoning -Probability, Bayes Rule Bayesian Networks,
 Bayesian Inference

7&8 Introduction to Prolog 3

 Application of prolog
 Introduction to Amzi prolog environment
 Basic concepts of prolog-terms,Atoms,Variables,Compound terms
 Clauses and queries-Facts and rules
 Unification
9  Arithmetic in prolog 3
 Built-in predicate -Predicate is/2
 Operators-Arithmetic operators,Relations operators,logical
operators,disjunction operator
 User defined operators.
10  Lists 3
 Structure and uses of lists
 Built-In predicates for list manipulation-Length/2, Member/2, Append/3,
Last/2, Reverse/3 and Select/2
11  Input and output 3
 Input predicate -write/1 ,nl/0 ,get/1 predicates
 output predicates-read/1,put/1 predicates.
12  Looping and Backtracking 3
 Predicates-Repeat, Fail, Cut
 Search and cut
13 CAT 2 3
14 REVISION
15 FINAL EXAM
Learning and Teaching Methodologies Lectures, Tutorials and assignments
Assessment Type weighing
Cats 30
Exam 70
Total 100%

Reference Title Author Publisher ISBN

Material
1. Artificial Intelligence: A Russell, S. and Pearson Prentice Hall
Modern Approach Norvig, P.
2. PROLOG Programming for Bratko, I. Addison wesley
Artificial Intelligence
Support Internet
material