Fundamentals of Artificial Intelligence
IZU Acad. year 2023/2024 Summer semester 4 credits
Problem-solving: State space search (BFS, DFS, DLS, IDS, BS, UCS, Backtracking, Forward checking, Min-conflict, BestFS, GS, A*, Hill Climbing, Simulated annealing methods). Solving optimization problems by nature-inspired algorithms (GA, ACO and PSO). Problem decomposition (And Or graphs), games playing (Mini-Max and Alfa-Beta algorithms). AI language PROLOG and implementations of basic search algorithms in this language. Machine learning principles. Statistical and structural pattern recognition. Basic principles of expert systems. Fundamentals of computer vision. Base principles of natural language processing. Application fields of artificial intelligence.
Language of instruction
- 26 hrs lectures
- 13 hrs projects
- 60 pts final exam (written part)
- 20 pts mid-term test (written part)
- 20 pts projects
Course Web Pages
To give the students the knowledge of fundamentals of artificial intelligence, namely knowledge of problem-solving approaches, machine learning principles and general theory of recognition. Students acquire base information about expert systems, computer vision and natural language processing.
- Students will acquaint with problem-solving methods based on state space search and on decomposition problem into sub-problems.
- Students will acquaint with basic game playing methods of two players.
- Students will learn to solve optimization problems.
- Students will acquaint with fundamentals of propositional and predicate logic and with their applications.
- Students will learn how to use basic methods of machine learning.
- Students will acquaint with fundamentals of expert systems, machine vision and natural language processing.
- Students will acquaint with fundamentals of multiagent systems.
Why is the course taught
In the IZU course, students should gain knowledge what artificial intelligence is, realize that the artificial intelligence does not mean artificial being, but that it is a serious and very useful branch of computer science. Furthermore, students will learn basic techniques and approaches to solving problems that they can use them for the creation of artificially intelligent systems.
Prerequisite knowledge and skills
- Basic knowledge of programming in any procedural programming language. - Knowledge of secondary school level mathematics.
- Russell,S., Norvig,P.: Artificial Intelligence, Prentice-Hall, Inc., 1995, ISBN 0-13-360124-2, second edition 2003, ISBN 0-13-080302-2, third edition 2010, ISBN 0-13-604259-7
- Ertel, W.: Introduction to Artificial Intelligence, Springer, second edition 2017, ISSN 1863-7310
- Pool, D. L., Mackworth, A. K.: Artificial Intelligence, Cambridge University Press, 2010, ISBN-13 978-0-521-51900-7
Syllabus of lectures
- Introduction, Artificial Intelligence (AI) definition, types of AI problems, solving problem methods.
- State space search methods.
- Solving methods using decomposition problems into sub-problems.
- Solving optimization problems using algorithms inspired by nature.
- Methods of game playing (two players).
- Logic and AI, resolution and it's application in problem-solving and planning.
- PROLOG language and its use in AI.
- Machine learning.
- Pattern recognition.
- Principles of expert systems.
- Principles of computer vision.
- Principles of natural language processing.
- Introduction to agent systems.
Syllabus - others, projects and individual work of students
- Project dealing with state space search and game playing
- Project dealing with logic and PROLOG language
- Two projects dealing with machine learning and classifiers
- Mid-term written examination - 20 points.
- Projects (homeworks) - 20 points.
- Final written examination - 60 points; The minimal number of points which can be obtained from the final written examination is 25. Otherwise, no points will be assigned to a student.
Missed lessons (exercises and tests) can be substituted only exceptionally, after proving that the absences had legitimate reasons.
At least 10 points earned during semester.
|Mon||lecture||1., 2., 3., 4., 5., 6., 7., 8., 10., 11., 12., 13. of lectures||E104 E105 E112||11:00||12:50||294||2BIB 3BIT||xx 20 - 29||Kočí|
|Tue||lecture||lectures||E104 E105 E112||13:00||14:50||294||2BIA 3BIT||xx 10 - 19||Zbořil|
Course inclusion in study plans