IA008/T01: Wed 20. 9. to Fri 22. 12. Wed 15:00–16:35 KOM 106, O. Nečas, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IA008/01: Fri 10:00–11:50 C525, A. Blumensath
IA008/02: Thu 12:00–13:50 C525, A. Blumensath
IA008/03: Mon 18:00–19:50 A218, M. Jonáš
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 111 student(s).
Current registration and enrolment status: enrolled: 67/111, only registered: 0/111, only registered with preference (fields directly associated with the programme): 0/111
Fields of study the course is directly associated with
there are 19 fields of study the course is directly associated with, display
At the end of the course students should be familiar with main research and applications in computational logic; They will be able to use automatic provers for propositional and predicate logic and also for its extensions;
They will be familiar with, and able to use, methods for inductive inference in those logics;
After successfully completing this course students should be familiar with several logics, including propositional logic, first-order logic, and modal logic. They should be familiar with various proof calculi for these logics and be able to use such calculi to test formulae for satisfiability and or validity. In addition, they should have basic knowledge about automatic theorem provers and they way these work.
Introduction to propositional and predicate logic.
Deduction: Resolution; Logic programming; Prolog, extralogical features, metainterpreters; Advanced parts from logic programming; Definite clause grammars; Deductive databases;
Tableau proofs in different logics. Theorem proving in modal logic.
Induction: Basics of inductive logic programming; Model inference problem; Assumption-based reasoning and learning; Learning frequent patterns.