Teaching



Introduction to Artificial Intelligence (IAI/ZUM)

Motivaní obrázek

Introductory course on artificial intelligens. The course covers essential concepts necessary for further study of artificial intelligence.

The course covers the following topics among others:

  • search space, uninformed/informed search, heuristic search
  • planning, satisfiability, constraint satisfaction
  • neural networks, evolutionary computing
  • multi-agent systems, games, data mining


The course is provided in Czech and English language and is accompanied by a seminar. Attandants can chose one of several seminars taught in Czech. One seminar is provided in English language.

References:
Peter Norvig, Stuart J. Russell: Artificial intelligence: a modern approach (3rd edition). Prentice Hall/Pearson, 2009.



Last update: 17th May 2018

Seminar Monday 16:15

NameAttendanceActivityProgramsSemester TaskSum/Credit
Lukáš Buňát4.00.517.5-22.0
Ján Gajdica0.5---0.5
Mehmet Gül0.5-3.5-4.0
silver Tomáš Hrdlovics6.012.520.0+2i+5.0P+D=20.058.5+2i=Yes
Emma Hurteaux0.5---0.5
Berker Katipoglu5.015.017.5+2iP+D+2i=20.0+2i57.5+4i=Yes
Victor Elizalde4.51.020.0+5.0P+D+i=20.0+i45.5+i=Yes
Yeoyong Na0.5---0.5
Deividas Nikliauza6.06.017.5+5.0-29.5
José Ramírez5.0-19.5+5.0P+D+i=20.0+i44.5+i=Yes
Idan Reed3.5-6.0-9.5
Julien Sanson0.5---0.5
Hanno Artur Sarg3.52.012.5+3i+5.0P+i=10.0+i28.0+4i=Yes
Michal Švec0.5---0.5
Nishany Yadav0.5---0.5

Seminar Tuesday 14:30

NameAttendanceActivityProgramsSemester TaskSum/Credit
Vitalii Belomoir6.0-16.5+5.0P+D=20.042.5=Ano
Tomáš Bohuslav1.51.510.0+2i-13.0+2i
Jiří Borský4.5-20.0-24.5
bronze Ivan Briantsev6.012.520.0+5.0P+D+i=20.0+i58.5+i=Ano
Martin Čapek5.01.014.5+i+5.0P+D+i=20.0+i40.5+2i=Ano
Martin Kostelanský2.0-15.0-17.0
Artem Kondaurov2.5-15.0-17.5
Martin Kučera5.52.520.0+2i+5.0P+D+2i=20.0+2i48+4i=Ano
Lukáš Langr5.51.020.0+2i+5.0P+D=20.046.5+2i=Ano
Jana Maříková5.51.015.0P+D+2i=20.0+2i41.5+2i=Ano
Stanislav Němec6.00.520.0+i+5.0P+D=20.046.5+i=Ano
Petr Nešpůrek6.05.015.0+5.0P+D+2i=20.0+2i46.0+2i=Ano
Adam Novák0.5---0.5
Martin Nykodem6.02.020.0+i+5.0P+D=20.048.0+i=Ano
Jakub Pečenka5.0-19.5+i+5.0P+D=20.044.5+i=Ano
Bich Phuong Phamová2.5-10.0-12.5
Jan Píro4.00.514.5+iP+D=20.039.0+i=Ano
Petr Polívka5.52.020.0+i+5.0P+D=20.047.5+i=Ano
Tomáš Přeučil6.01.519.0+4i+5.0P+D+2i=20.0+2i46.5+6i=Ano
Karolína Radovská0.51.0--1.5
Matěj Sedlák5.51.020.0+i+5.0P+D=20.046.5+i=Ano
Matyáš Skalický6.01.519.5+5.0P+D+2i=20.0+2i47.0+2i=Ano
Ivo Strejc5.51.520.0+iP+D+2i=20.0+2i47.0+3i=Ano
Minh Trieu2.0-10.0-12.0
Tomáš Vlk5.51.520.0+i+5.0P+D=20.047.0+i=Ano
Jiří Zdvomka6.01.520.0+5.0P+D+i=20.0+i47.5+i=Ano

Seminar Tuesday 16:15

NameAttendanceActivityProgramsSemester TaskSum/Credit
Ondřej Bartoška5.02.020.0+i+5.0-27.0=?
Tadeáš Bušek5.5-15.5+5.0P+D-2.0=18.039.0=Ano
Samuel Fabo6.02.018.5+3i+5.0P+D=20.046.5+3i=Ano
Jan Fajfer5.52.020.0+2i+5.0P+D=20.047.5+2i=Ano
Petr Hanzl5.02.520.0P+D=20.047.5=Ano
Martin Hron2.5-10.0-12.5
Ján Chudý5.0-15.0+3i+5.0P+D=20.040.0+3i=Ano
Dominik Kněžour5.50.520.0+2i+5.0P+D=20.046.0+2i=Ano
Filip Kojan5.0-15.0+5.0P+D=20.040.0=Ano
Jakub Kaloč5.02.020.0+i+5.0P+D-2.0=18.045.0+i=Ano
Matouš Kozák5.5-20.0+i+5.0P+D-2.0=18.043.5+i=Ano
Václav Lepič6.03.018.0+i+5.0P+D=20.047.0+i=Ano
Luděk Letáček6.01.019.0+i+5.0P+D=20.046.0+i=Ano
Luka Lukasević2.5-4.0-6.5
Dmytro Molokoiedov5.05.015.0P+D+i=20.0+i45.5+i=Ano
Artur Nasyrov2.50.510.0-13.0
Marek Papinčák4.5-20.0+i+5.0P+D=20.044.5+i=Ano
Vojtěch Paukner6.02.020.0+i+5.0P+D=20.048.0+i=Ano
Vít Pekárek0.5-5.0-5.5
Róbert Selvek5.56.020.0+2i+5.0P+D=20.051.5+2i=Ano
Tomáš Starý4.0-19.0P+D-2.0=18.041.0=Ano
gold Zdeněk Šimůnek5.522.520.0+4iP+D+i=20.0+i68.0+5i=Ano
Martin Vastl6.08.020.0+5.0P+D+i=20.0+i54.0+i=Ano


Decision Procedures and Verification

Motivaní obrázek

Výběrová přednáška o logických teoriích a procedurách rozhodující splnitelnost v těchto teoriích s důrazem na aplikaci při verifikaci programů (vyučována na MFF UK).


Na přednášce se bude probírat:

  • rozhodovací procedury pro výrokovou logiku (DPLL, BDD)
  • logické teorie pro rovnost, lineární aritmetiku, bitové vektory, pole a ukazatele
  • kombinování rozhodovacích procedur, SMT
  • ověřování korektnosti programů


Přednáška je doplněna cvičením. V rámci cvičení bude možné mimo klasických úloh na procvičení látky řešit také úlohy implementačního charakteru.


Teaching in English: The lecture will be taught in English if required (study materials in English will be provided).


Přednáška

Topic Slides
1.Propositional Logic, Normal Forms of Formulae, Tseitin Encoding [PDF]
2.SAT Solvers, DPLL, CDCL, 2-watched Literals [PDF]
3BDDs, GSAT, WalkSAT, Warning Propagation [PDF]
4Equality Theory and Uninterpreted Functions [PDF]
5.Decision Procedures for Equality Logic Formulae [PDF]
6.Small Domain Allocation [PDF]
7.Bit Vector Arithmetics [PDF]
8.Decision Procedures for Array and Pointer Logic Formulae [PDF]
9.Combination of Theories, Nelson-Oppen Procedure [PDF]
10.Satisfiability Modulo Theories (SMT) Problem [PDF]
11.Linear Arithmetics [PDF]

Cvičení

TopicTasks
1.Tseitin encoding, NNF properties, modeling[PDF]
2.Problem modeling, encoding of states, simulation of CDCL[PDF]
3.BDDs, MTBDDs, GSAT, WalkSAT, factor graphs[PDF]
4.Equality logic, Ackermann's reduction, circuit equivalence[PDF]
5.Equality graphs, adequate domains[PDF]
6.Small adequate domains[PDF]
7.Bit vectors and bit vector constraints[PDF]
8.Arrays and pointers[PDF]
9.Deciding in combined theories[PDF]
10.Satisfiability Modulo Theories (SMT) Problem[PDF]
11.Linear Arithmetics[PDF]


Automata and Grammars

Motivaní obrázek

Introductory course on theory of formal languages. The course covers essential concepts necessary for further study of computer science (taught at MFF CUNI).

The course covers the following topics among others:

  • formal languages, finite automata, non-determinism, regular expressions
  • enhanced automata - bi-directional, push-down
  • grammars, Chomsky hierarchy
  • Turing machines, algorithmically undecidable problems


The course is provided in Czech and English language and is accompanied by a seminar. Attandants can chose one of several seminars taught in Czech. One seminar is provided in English language.

References:
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.


Přednáška

TémaSlidy
1.Jazyky, konečné automaty, Myhill-Nerodova věta [PDF]
2.Redukce konečných automatů [PDF]
3.Ekvivalence automatů, nedeterminismus [PDF]
4.Uzávěrové vlastnosti a dvousměrný automat [PDF]
5.Regular expressions [PDF]
6.Úvod do Chomského hierarchie [PDF]
7.Regulární a bezkontextové gramatiky [PDF]
8.Bezkontextové gramatiky a zásobníkové automaty [PDF]
9.Zásobníkové automaty [PDF]
10.Vlastnosti bezkontextových jazyků [PDF]
11.Turingovy stroje [PDF]
12.Varianty Turingových strojů [PDF]
13.Rekurzivně spočetné jazyky [PDF]

Lecture

DateTopicSlides
1.Languages, deterministic finite automata, Myhill-Nerode theorem [PDF]
2.Reduction of DFAs [PDF]
3.Equivalence of automata, non-determinism [PDF]
4.Non-determinism and two-way automata [PDF]
5.Regular expressions [PDF]
6.Introduction to Chomsky hierarchy [PDF]
7.Regular and Context-free Grammars [PDF]
8.Context-free grammars and push-down automata [PDF]
9.Push-down automata [PDF]
10.Properties of context-free languages [PDF]
11.Turing machines [PDF]
12.Variants of Turing machines [PDF]

Cvičení

TémaÚlohy
1.Jazyky, konstrukce konečných automatů[PDF]
2.Regulární jazyky, ekvivalence automatů[PDF]
3.Ekvivalence automatů, nedeterminismus[PDF]
4.Nedeterministické automaty a převody[PDF]
5.Regular expressions[PDF]
6.Dvousměrné automaty a jejich převody[PDF]
7.Gramatiky - regulární a bezkontextové[PDF]
8.Více o bezkontextových gramatikách[PDF]
9.Zásobníkové automaty[PDF]
10.Kontextové gramatiky[PDF]
11.Turingovy stroje[PDF]

Seminar

TopicTasks
1.Languages, construction of finite automata[PDF]
2.Regular languages, automata equivalence[PDF]
3.Equivalence of automata, non-determinism[PDF]
4.Non-deterministic automata and reductions[PDF]
5.Regular expressions[PDF]
6.Two-way automata and their reductions[PDF]
7.Grammars - regular and context-free[PDF]
8.More on context-free grammars[PDF]
9.Push-down automata[PDF]
10.Context-sensitive grammars[PDF]
11.Turing machines[PDF]


Student Awards
  • SVOČ 2016 first place for a bachelor thesis by Jakub Střelský under my supervision
    Competing work: Automated Generation of Realistic Terrain Using Machine Learning Techniques
    Award given by: The Union of Czech Mathematicians and Physicists.
     
  • Dean's Award 2014 for a master thesis by Marika Ivanová under my supervision
    Competing work: Adversarial Cooperative Path-Finding
    Award given by: Faculty of Mathematics and Physics, Charles University.
     
  • SVOČ 2014 second place for a master thesis by Marika Ivanová under my supervision
    Competing work: Adversarial Cooperative Path-Finding
    Award given by: The Union of Czech Mathematicians and Physicists.