INTERNATIONAL ISLAMIC UNIVERSITY MALAYSIA

COURSE OUTLINE

Kulliyyah Kulliyyah of Information and Communication Technology

Department Department of Computer Science

Programme Bachelor of Computer Science

Course Title Principles of Artificial Intelligence

Course Code CSC 3301

Status Required

Level 3 and 4

Credit Hours 3

Contact Hours 3

Pre-requisites CSC 2703 Calculus 2

(if any)

Co-requisites -
(if any)

Instructional Direct Instruction

Strategies Case
Cooperative Learning
Demonstration
Discussion
Problem Solving
Project Method
Drill and practise
Course
Assessment LO Method %
1,2 Quiz(s) 20%
2,3 Assignment(s) 10%
All Group Project 10%
1,2 Mid Term Exam 20%
1,2,3,4 Final Exam 40%
Total 100%

1
Instructor(s) Dr. Normaziah Abdul Aziz

Semester Semester 1 and 2

Offered
Course Synopsis In this course an attempt will be made to introduce students to the basic
concepts of Artificial Intelligence and the major areas of applications of
AI. To achieve further involvement in the field of AI, students will be
introduced to logic programming in PROLOG and will be given
assignments to develop small application of AI. At the end of the course
students will be able to identify the potential areas of application of AI in
the real world and confidently engage in developing a solution based on
AI.

Course The main objectives of this course are as follows:

Objectives
1. To introduce the general concept of AI techniques
2. To provide students with different knowledge based representation in
AI.
3. To present the usage of AI techniques in real world applications.
4. To provide the students with basic skills in AI programming languages
(e.g., Prolog).
5. To encourage communication skills through group project.

Learning After completing this course, students would be able to:

Outcomes
1. list and explain the main principles of AI.
2. evaluate the strengths and weaknesses of AI techniques for different AI
applications.
3. demonstrate the use of AI programming languages in problem solving.
4. develop small-scale AI applications using prolog.
5. participate effectively in group projects in building AI-based
applications.
Content Outlines

Weeks Topics Task/Reading

1 A Brief History of Artificial Intelligence Coppin
(Chapter 1 &
• What is Artificial Intelligence Chapter 2)
• Alan Turing and the 1950s
• The 1960s and 1990s
• Human psychology and biology
• Uses and limitations

2
2 Knowledge Representation
Coppin
• Semantic Net (Chapter 3)
• Inheritance
• Frames
• Object Oriented Programming
• Search spaces
• Semantic trees
• Search trees
• Goal trees

3 Search Methodologies Coppin

(Chapter 4)
• Problem solving as search
• Data-driven or goal-driven
• Depth-first search
• Breadth-first search
• Properties of search methods
• Heuristics search
• Hill Climbing
• Best-First search
• Identifying optimal path

4 Game Playing Coppin

• Game trees (Chapter 6)
• Minimax
• Alpha-Beta pruning
• Examples of games: checkers, chess

5 Propositional and Predicate Logic Coppin

(Chapter 7)
• Logical operators
• Translating between English and logic notation
• Truth tables
• Complex truth tables
• Propositional logic
• Deduction
• Predicate calculus
• First-Order predicate calculus

3
6 Languages and Programming Techniques Coppin
(PROLOG /LISP) (Chapter 1 &
Chapter 7)
• Introduction
• Syntax and predicate
• ADT in Prolog
• Defines relations by facts
• Defining relations by rules
• Data Objects
• Matching
• Declarative meaning of Prolog Programs
• Order of Clauses and Goals
• List

8 Inference and Resolution for Problem Solving Coppin

(Chapter 8)
• Resolution in propositional logic
• Applications of resolution
• Resolution in predicate logic
• Normal Forms for predicate logic

• Skolemization
9 Rules and Expert Systems Coppin
(Chapter 9)
• Rules for knowledge representation
• Rule-based systems
• Rule-based expert systems
• Backward chaining in rule-based expert system

10 Planning Coppin
• Planning as search (Chapter 15 &
• Strips 16)
• Propositional planning
• SAT planning
• Planning graph
• Planning and scheduling

4
 11 & 12 Introduction to Machine Learning Coppin
(Chapter 10)
• Training
• Learning concepts
• Version spaces
• Decision-tree induction
• The nearest neighbor algorithm
• Supervised learning
• Unsupervised learning

• Reinforcement learning
13 & 14 Neural Networks and Genetic Algorithm Coppin
(Chapter 11
• Neuron &14)
• Perceptrons
• Multilayer neural networks
• Recurrent Networks
• Unsupervised learning networks

Genetic Algorithms

• Representation
• The algorithm
• Crossover
• Mutation
• Optimization of a Mathematic function

References Required
Coppin, B., (2005). Artificial Intelligence Illuminated. Canada: Jones and
Bartlett Publishers.

Recommended

Luger, George F. (2005). Artificial intelligence: structures and

strategies for complex problem solving. New York: Adisson Wesley.

Russell and Norvig (2003). Artificial Intelligence – A Modern Approach. New

Jersey : Pearson Education, Inc.

Negnevitsky, M. (2005). Artificial intelligence, a guide to intelligent

systems. New York: Addison-Wesley.

Bratko, I. (1990). Programming in prolog for artificial intelligence. New

York: Addison-Wesley.

Rich, Elaine and Knight, Kevin (1991). Artificial Intelligence. New

5
 York: McGraw-Hill, Inc.

Proposed Semester 2 2007/2008

Start Date
(Semester)
Batch of Starts from Semester 2 2007/2008
Students to
be Affected

Prepared by: Checked by: Approved by:

__________________ __________________ ______________

(Dr. Normaziah A. Aziz) ( ) (Dean/ Director)