FI:IA008 Computational Logic - Course Information
IA008 Computational LogicFaculty of Informatics
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
- doc. RNDr. Lubomír Popelínský, Ph.D. (lecturer)
doc. Dr. rer. nat. RNDr. Mgr. Bc. Jan Křetínský, Ph.D. (seminar tutor)
doc. RNDr. Jan Strejček, Ph.D. (seminar tutor)
Mgr. Jan Doleček (assistant)
Mgr. Tomáš Laurinčík (assistant)
Mgr. Eva Mráková, Ph.D. (assistant)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: doc. RNDr. Lubomír Popelínský, Ph.D.
- Tue 10:00–11:50 A107
- Timetable of Seminar Groups:
IA008/02: Wed 14:00–15:50 B204, J. Strejček
IA008/03: Mon 10:00–11:50 A107, J. Křetínský
IA008/04: Mon 12:00–13:50 B011, J. Křetínský
- Prerequisites (in Czech)
- ! I008 Computational Logic
- 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 104 student(s).
Current registration and enrolment status: enrolled: 0/104, only registered: 0/104, only registered with preference (fields directly associated with the programme): 0/104
- Fields of study the course is directly associated with
- there are 15 fields of study the course is directly associated with, display
- Course objectives
- Logic as a computational tool.
- Introduction to propositional and predicate logic.
- Deduction: Resolution; Logic programming; Prolog, extralogical features, metainterpreters; Definite clause grammars; Deductive databases; Tableau proofs. 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
- Assessment methods
- A midterm written exam and a written final exam.
- Language of instruction
- Further Comments
- Study Materials
The course is taught annually.
- Listed among pre-requisites of other courses
- Teacher's information