Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2021/2022

Artificial intelligence

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
NI-UMI Z,ZK 5 2P+1C Czech
Lecturer:
Pavel Surynek (guarantor)
Tutor:
Pavel Surynek (guarantor)
Supervisor:
Department of Applied Mathematics
Synopsis:

The course covers search and inference algorithms in major formal paradigms used in artificial intelligence such as logic theories, constraint programming and automated planning. The main principles and practical applications of discussed techniques will be illustrated.

Requirements:

Background from BI-ZUM: Fundamentals of Artificial Intelligence is assumed.

Syllabus of lectures:

1. Solving problems by searching

2. Constraint satisfaction [2]

3. Consistency techniques in constraint satisfaction [2]

4. Propositional satisfiability (SAT) [4]

5. Decision making in logical theories [4]

6. Automated planning [3]

7. Problem modeling

8. Reasoning in first order logic

9. Knowledge representation

10. Reasoning under uncertainty

11. Decision making in games

12. Robotics [6]

Syllabus of tutorials:

1. Search

2. Constraint programming

3. Satisfiability

4. Planning

5. Problem modeling

6. Games

Study Objective:

The aim of the course is to provide students with a deeper insight into modern areas of artificial intelligence related to problem solving. To show in detail selected important algorithms and methods. Lead the students to further independent study of problems in artificial intelligence.

Study materials:

[1] Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach (3rd Edition), Prentice Hall, 2009.

[2] Decher, R.: Constraint Processing, Morgan Kaufmann, 2003.

[3] Ghallab, M., Nau, D., Traverso, P.: Automated Planning and Acting, Cambridge University Press, 2016.

[4] Biere, A., Heule, M., Van Maaren, H., Walsh, T.: Handbook of Satisfiability, IOS Press, 2009.

[5] Lažanský, J., Mařík, V., Štěpánková, O., a kolektiv: Umělá inteligence (1) - (6), Academia, 2000 - 2013.

[6] LaValle, S.: Planning Algorithms / Motion Planning. Cambridge University Press, 2006.

Note:
Further information:
https://courses.fit.cvut.cz/MI-UMI/
Time-table for winter semester 2021/2022:
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
roomTK:BS
Surynek P.
18:00–19:30
(lecture parallel1)
Dejvice
NTK Ballingův sál
Wed
roomT9:303
Surynek P.
14:30–16:00
ODD WEEK

(lecture parallel1
parallel nr.103)

Dejvice
NBFIT PC ucebna
roomT9:303
Surynek P.
16:15–17:45
EVEN WEEK

(lecture parallel1
parallel nr.101)

Dejvice
NBFIT PC ucebna
roomT9:303
Surynek P.
18:00–19:30
EVEN WEEK

(lecture parallel1
parallel nr.102)

Dejvice
NBFIT PC ucebna
roomT9:303
Surynek P.
16:15–17:45
ODD WEEK

(lecture parallel1
parallel nr.104)

Dejvice
NBFIT PC ucebna
Thu
Fri
Time-table for summer semester 2021/2022:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2022-08-16
For updated information see http://bilakniha.cvut.cz/en/predmet6115806.html