FI:IA008 Computational Logic - Course Information
IA008 Computational LogicFaculty of Informatics
- Extent and Intensity
- 2/2/0. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
- Dr. rer. nat. Achim Blumensath (lecturer)
Mgr. Tomáš Rudolecký (seminar tutor)
RNDr. Martin Jonáš, Ph.D. (seminar tutor)
Mgr. Ondřej Nečas (assistant)
RNDr. Karel Vaculík, Ph.D. (assistant)
doc. RNDr. Lubomír Popelínský, Ph.D. (alternate examiner)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Supplier department: Department of Computer Science - Faculty of Informatics
- Fri 8:00–9:50 D3
- Timetable of Seminar Groups:
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: 0/111, only registered: 0/111, only registered with preference (fields directly associated with the programme): 0/111
- fields of study / plans the course is directly associated with
- there are 19 fields of study the course is directly associated with, display
- Course objectives
- 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;
- Learning outcomes
- 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.
- Logic for natural language processing.
- Knowledge representation and reasoning: Non-classical logic; Knowledge-based systems; Non-monotonic reasoning; Semantic web.
- NERODE, Anil and Richard A. SHORE. Logic for applications. New York: Springer-Verlag, 1993. xvii, 365. ISBN 0387941290. info
- FITTING, Melvin. First order logic and automated theorem proving. 2nd ed. New York: Springer, 1996. xvi, 326. ISBN 0387945938. info
- NIENHUYS-CHENG, Shan-Hwei and Ronald de WOLF. Foundations of inductive logic programming. Berlin: Springer, 1997. xvii, 404. ISBN 3540629270. info
- PRIEST, Graham. An introduction to non-classical logic : from if to is. 2nd ed. Cambridge: Cambridge University Press, 2008. xxxii, 613. ISBN 9780521854337. info
- Teaching methods
- lectures, exercises.
- Assessment methods
- A midterm written exam and a written final exam.
- Language of instruction
- Further Comments
- Study Materials
The course is taught annually.