PB016 Artificial Intelligence I

Faculty of Informatics
Autumn 2020
Extent and Intensity
2/2/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. RNDr. Aleš Horák, Ph.D. (lecturer)
doc. RNDr. Lubomír Popelínský, Ph.D. (lecturer)
doc. Mgr. Bc. Vít Nováček, PhD (seminar tutor)
Bc. Matěj Pavlík (seminar tutor)
Mgr. Bc. Roman Solař (seminar tutor)
Mgr. et Mgr. Matúš Šikyňa (seminar tutor)
Guaranteed by
doc. RNDr. Aleš Horák, Ph.D.
Department of Machine Learning and Data Processing – Faculty of Informatics
Supplier department: Department of Machine Learning and Data Processing – Faculty of Informatics
Timetable
Wed 10:00–11:50 A318
  • Timetable of Seminar Groups:
PB016/01: Mon 10:00–11:50 A215, V. Nováček
PB016/02: Mon 12:00–13:50 A215, V. Nováček
PB016/03: Thu 10:00–11:50 B311, M. Pavlík
PB016/04: Tue 12:00–13:50 A215, M. Šikyňa
PB016/05: Thu 14:00–15:50 B130, R. Solař
PB016/06: Tue 14:00–15:50 Virtuální místnost, V. Nováček
PB016/07: Wed 14:00–15:50 Virtuální místnost, V. Nováček
PB016/08: Thu 12:00–13:50 Virtuální místnost, R. Solař
PB016/09: Tue 10:00–11:50 Virtuální místnost, M. Pavlík
Prerequisites
Basic knowledge of the Python programming language is expected, Python is used in the exercises.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 64 fields of study the course is directly associated with, display
Course objectives
Introduction to problem solving in the area of artificial intelligence. The main aim of the course is to provide information about fundamental algorithms used in AI.
Learning outcomes
After studying the course, the students will be able to:
- identify and summarize tasks related to the field of artificial intelligence;
- compare and describe basic search space algorithms;
- compare and describe main aspects of logical systems;
- understand different approaches to machine learning;
- compare and describe different ways of knowledge representation and reasoning;
- present basic approaches to computer processing of natural languages.
Syllabus
  • Artificial intelligence, Turing test, problem solving
  • Solving problems by searching.
  • Problem decomposition, AND/OR graphs, Constraint Satisfaction Problems.
  • Games and basic game strategies.
  • Logic agents, propositional logic, satisfiability.
  • Truth and provability. Axiomatic systems.
  • First order predicate logic, intensional logic.
  • Resolution in propositional and predicate logic. Introduction to logic programming.
  • Modal logic. Multivalued logic.
  • Knowledge representation and reasoning, reasoning with uncertainty.
  • Learning, decision trees, neural networks.
  • Natural language processing.
Literature
  • Stuart Russel & Peter Norvig: Artificial intelligence : a modern approach, 3rd.ed., Prentice Hall, 2010
  • Sylaby přednášek.
Teaching methods
Lectures and exercises.
Assessment methods
The final grade consists of tests during the exercises, a written midterm exam and a written final exam.
Language of instruction
Czech
Follow-Up Courses
Further comments (probably available only in Czech)
Study Materials
The course is taught annually.
Listed among pre-requisites of other courses
Teacher's information
http://nlp.fi.muni.cz/uui/
New seminar groups will be added, and each enrolled student will be able to join the exercises. If you need an English group, join/ask for joining to PB016/01.
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2021, Autumn 2022, Autumn 2023, Autumn 2024.
  • Enrolment Statistics (Autumn 2020, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2020/PB016