Course detail
Fundamentals of Artificial Intelligence
FIT-IZUAcad. year: 2018/2019
Problem solving: State space search (BFS, DFS, DLS, IDS, BS, UCS, Backtracking, Forward checking, Min-conflict, BestFS, GS, A*, Hill Climbing, Simulated Annealing methods). Problem decomposition (AND/OR graphs). Solving optimization problems by nature-inspired algorithms (GA, ACO and PSO). Games playing (Mini-Max and Alfa-Beta algorithms). Logic and artificial intelligence (method of resolution and its utilization for task solving and planning). PROLOG language and implementations of basic search algorithms in this language. Machine learning principles. Classification and patterns recognition. Basic principles of expert systems. Fundamentals of computer vision. Principles of natural language processing. Introduction into agent systems.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
- Students will learn terminology in Artificial Intelligence field both in Czech and in English language.
- Students will learn read and so partly write programs in PROLOG language.
- 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.
- Students will learn to solve optimization problems.
- Students will acquaint with fundamentals of propositional and predicate logics and with their applications.
- Students will learn how to use basic methods of machine learning, classification and recognition.
- Students will acquaint with fundamentals of expert systems, machine vision and natural language processing.
- Students will acquaint with fundamentals of multiagent systems.
Prerequisites
- Basic knowledge of the programming.
- Knowledge of secondary school level mathematics.
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
- Mid-term written examination - 20 points.
- Programs in computer exercises - 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.
Exam prerequisites:
At least 15 points earned during semester (mid-term test + tasks in computer exercises).
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading
Russel,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
Classification of course in study plans
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
- 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.
- Basic methods of game playing.
- Logic and AI, resolution and it's application in problem solving and planning.
- PROLOG language and its use in AI.
- Machine learning.
- Classification and pattern recognition.
- Principles of expert systems.
- Principles of computer vision.
- Principles of natural language processing.
- Introduction into agent systems.
Exercise in computer lab
Teacher / Lecturer
Syllabus
- Problem solving - State Space Search.
- Problem solving - CSP.
- Problem solving - game playing.
- Predicate logic - method of resolution.
- PROLOG language - basic information.
- PROLOG language - simple individual programs.
- Simple programs for pattern recognition.