VNUHCM-UNIVERSITY OF SCIENCE

FACULTY OF INFORMATION TECHNOLOGY

COURSE SYLLABUS
CSC14003 – Introduction to Artificial Intelligence

1. GENERAL INFORMATION

Course name: Introduction to Artificial Intelligence

Course name (in Vietnamese): Cơ sở trí tuệ nhân tạo
Course ID: CSC14003
Knowledge block: Pre-major requirements (Compulsory)
Number of credits: 4
Credit hours for theory: 45
Credit hours for practice: 30
Credit hours for self-study: 90
Prerequisite: None
Prior-course: Data Structures and Algorithms
Instructors: Dr. Bùi Tiến Lên – Dr. Nguyễn Ngọc Thảo
Dr. Nguyễn Tiến Huy – Dr. Bùi Duy Đăng

2. COURSE DESCRIPTION
The course is designed to provide students with core knowledge of Artificial Intelligence (AI) through
the unified view of a rational agent. We organize the course content into three parts, following the
evolution of agents' perception. In Part I - Searching, the agent effectively completes tasks by fitting
searching strategies to diverse environments, where multiple agents and complex state spaces matter.
In Part II - Knowledge representation, the agent implements algorithms, including forward/backward
chaining and resolution, to reason on a knowledge base written in logic; the separation of knowledge
from inference helps the agent be more adaptive to changes. In Part III – Machine learning, the agent
is fully automated by basic techniques such as decision trees, regressions, and neural networks.
Through lectures and practical exercises aiming to develop personal aptitudes of AI, students are
exposed to relevant methods, processes, and techniques to get insights into AI agents.

Course Syllabus | Artificial Intelligence Page 1

 VNUHCM-UNIVERSITY OF SCIENCE
FACULTY OF INFORMATION TECHNOLOGY

3. COURSE GOALS
At the end of the course, students are able to
ID Description Program LOs
G1 Interpret AI from different aspects 1.4.1, 2.4.5
1.4.1, 4.1.1,
G2 Decide a search strategy that best fits the formulation of a search problem 4.1.2, 4.1.3,
5.1.1, 5.1.2
1.4.1, 4.1.1,
Apply an inference mechanism on the knowledge base (KB) represented
G3 4.1.2, 4.1.3,
in logic or probabilistic network
5.1.1, 5.1.2
1.4.1, 4.1.1,
G4 Demonstrate a simple agent that automatically learns from observations 4.1.2, 4.1.3,
5.1.1, 5.1.2
1.4.1, 4.1.1,
4.1.2, 4.1.3,
G5 Manipulate tools and libraries for developing AI agent programs
4.1.4, 4.2.1,
4.2.2, 4.2.3
2.1.7, 2.1.9,
G6 Promote personal aptitudes of logical thinking and communication
2.2.2

4. COURSE OUTCOMES

CO Description I/T/U
G1.1 Interpret fundamental AI concepts, and apply them in the right context T
Identify the relationship between AI and other science research fields, especially
G1.2 I
core fields like mathematics and cognitive science
Characterize the environment in which the agent is operating using PEAS
G2.1 T
description and environment dimensions
G2.2 Formulate a given AI search problem T
Appraise search strategies according to the problem formulation (i.e., the search
G2.3 T
space landscape, the number of agents, the availability of prior knowledge, etc.)
G3.1 Represent a complex world using logic and/or probabilistic notions T/U
G3.2 Apply backward/forward chaining and resolution on a KB written in logic T/U
G4.1 Explain the concept of machine learning and classify types of learning T

Course Syllabus | Artificial Intelligence Page 2

 VNUHCM-UNIVERSITY OF SCIENCE
FACULTY OF INFORMATION TECHNOLOGY

Illustrate basic machine learning algorithms (e.g., ID3 decision tree, naïve Bayes,
G4.2 T
and regression algorithms) on well-prepared datasets
G5.1 Develop Python programming skills to set up simple AI agent programs T/U
G5.2 Use SWI-Prolog for backward chaining inference on first-order knowledge bases T/U
G5.3 Manipulate open-source libraries and tools available for machine learning T/U
G6.1 Develop practical personal communication skills, both oral and writing U
G6.2 Develop the personal aptitudes of logical thinking U

5. TEACHING PLAN

Week Topic Course Teaching/Learning Activities

outcomes
Introduction to AI G1.1-2
1 Lecturing and Discussion
Intelligent agents G2.1

Solving Problem by Searching: Basic Lecturing and Practicing case studies

2 G2.1-3
concepts and Uninformed search Q1: PEAS – Problem formulation

Solving Problem by Searching: Lecturing and Practicing case studies

3 G2.1-3
Informed search H1: PEAS – Basic search strategies
Lecturing and Practicing case studies
4 Local search G2.1-3
Q2: Search strategies

5 Adversarial search G2.1-3 Lecturing and Practicing case studies

Lecturing and Practicing case studies

6 Constraint satisfaction problem G2.2-3
H2: Advanced search – CSP
Midterm Examination
7 G3.1-2 Lecturing and Practicing case studies
Inference with Propositional logic

Lecturing and Practicing case studies

8 Inference with First-order logic G3.1-2
Q3: PL inference H3: PL-FOL inferences
Machine learning: Basic concepts Lecturing
9 G4.1-2
and ID3 Decision tree Q4: FOL inference

Neural networks: Perceptron and Lecturing and Practicing case studies

10 G4.1-2
MLP H4: Machine learning
11 Review Q5: ID3 decision trees

Course Syllabus | Artificial Intelligence Page 3

 VNUHCM-UNIVERSITY OF SCIENCE
FACULTY OF INFORMATION TECHNOLOGY

6. LABORATORY WORK PLAN

The teaching assistants are responsible for
• Consolidating students’ comprehension by giving tutorials in office hours (on demand),
• Organizing review sessions for midterm and/or final examinations, and
• Giving, correcting, and grading in-class quizzes, and homework.
The lab instructors are responsible for
• Consolidating students’ problem-solving and programming skills on typical AI toy/practical
problems, and
• Organizing one Q&A session (or more) for each project announcement, and
• Giving, correcting, and grading lab works and projects.
Students will not have weekly classes for laboratory work. Instead, they will contact TA or lab
instructors when necessary.

Week Topic Course Teaching/Learning Activities

outcomes
Introduction to AI G1.1-2
1 Self-study activities
Intelligent agents G2.1, G5.1
Solving Problem by Searching: Basic
2 G2.1-3, G5.1 Self-study activities
concepts and Uninformed search
Solving Problem by Searching:
3 G2.1-3, G5.1 Self-study activities
Informed search
G2.1-3, G5.1,
4 Local search L1: Search strategies
G6.1-2
G2.1-3, G5.1,
5 Adversarial search Self-study activities
G6.1-2
6 Constraint satisfaction problem G2.2-3, G5.2 P1: Solving problem by searching

7 Inference with Propositional logic G3.1-2, G5.2 Self-study activities

8 Inference with First-order logic G3.1-2, G5.2

Machine learning: Basic concepts and G4.1-2 P2: Knowledge representation and
9
ID3 Decision tree G5.3, G6.1-2 inference
Self-study activities
10 Neural networks: Perceptron and MLP G4.1-2, G5.3
L3: Basic machine learning algorithms

Course Syllabus | Artificial Intelligence Page 4

 VNUHCM-UNIVERSITY OF SCIENCE
FACULTY OF INFORMATION TECHNOLOGY

7. ASSESSMENTS
ID Topic Description Course outcomes Ratio (%)
A Coursework (including but not limited to) 55 – 60
A1 Personal assignments 25
A11 In-class 15-20 minutes, closed-book, in-class written G1.1, G2.1-3 15
Quizzes assignments. G3.1-3, G4.1-2
(Q1 → Q5) They are on any topics in any lecture covered G6.2
and any reading material assigned up to the
time the quiz is administered.
A12 Lab work 2 weeks, take-home coding assignments G2.1-3, G4.1-2 10
(L1 → L2) They are tiny programs aiming to solve AI G5.1, G5.3
toy problems. G6.1-2
A2 Group assignments 30
A21 Projects 3-4 weeks, take-home coding assignments, 4 G1.1 30
(P1 → P2) members per group G2.1-3, G3.1-3
Each project includes a Python program G5.1-2, G6.1-2
sufficient for solving practical AI problems
and a written report.
B Examinations 40 – 45
B1 Midterm 70 minutes, closed-book, in-class written G1.1 15
exam exam. G2.1-3, G6.1-2
They are on any topics in any lecture covered
and any reading material assigned up to the
time the exam is administered
B2 Final exam 90-120 minutes, closed-book, in-class written G1.1 30
exam. G2.1-3, G3.1-3
They are on any topics in any lecture covered G4.1-2, G6.1-2
and any reading material assigned up to the
time the exam is administered
C Extra points (including but not limited to) 10%
C1 Homework 2 weeks, take-home assignments, exactly 2 G1.1 10
(H1 → H4) members per group. OPTIONAL. G2.1-3, G3.1-3
They are on any fundamental topics in any G4.1-2
lecture covered and any advanced topics
found in other reading materials.

Course Syllabus | Artificial Intelligence Page 5

 VNUHCM-UNIVERSITY OF SCIENCE
FACULTY OF INFORMATION TECHNOLOGY

8. RESOURCES

Textbooks
• Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach (4th ed.).
Pearson, 2020.
• Lê Hoài Bắc and Tô Hoài Việt. Giáo trình Cơ sở Trí tuệ nhân tạo. Khoa Công nghệ Thông
tin, Nhà xuất bản Khoa học kỹ thuật, 2014.

Others
• Negnevitsky, Michael. Artificial intelligence: A guide to intelligent systems. Pearson, 2005.

Tools, libraries, software

• IDE for Python 3 programming
• SWI-Prolog for logic programming
• Weka software and scikit-learn library for machine learning algorithms

9. GENERAL REGULATIONS & POLICIES

• All students are responsible for reading and following strictly the regulations and policies of
the school and university.
• Students who are absent for more than three theory sessions are not allowed to take the exams.
• For any kind of cheating and plagiarism, students will be graded 0 for the course. The incident
is then submitted to the school and university for further review.
• Students are encouraged to form study groups to discuss the topics. However, individual work
must be done and submitted on your own.
• Students who are absent for mid-term exam or final exam and students who have less than
10% project scores are considered unqualified for course completion.

Course Syllabus | Artificial Intelligence Page 6