FI:IB101 Intro to Logic Programming - Course Information
IB101 Introduction to Logic and Logic Programming
Faculty of InformaticsSpring 2007
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- RNDr. Petr Kuba, Ph.D. (lecturer)
doc. RNDr. Lubomír Popelínský, Ph.D. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Ondřej Výborný (seminar tutor)
Mgr. Mária Briatková (assistant)
Mgr. Jan Doleček (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. - Timetable
- Wed 10:00–11:50 D3, Wed 10:00–11:50 D1
- Timetable of Seminar Groups:
IB101/02: Thu 10:00–11:50 D3, J. Bouda
IB101/03: Tue 16:00–17:50 D2, O. Výborný
IB101/04: Thu 8:00–9:50 B410, J. Bouda, L. Popelínský, O. Výborný - Prerequisites (in Czech)
- ! IA008 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.
- fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, B-AP)
- Informatics with another discipline (programme FI, B-BI)
- Informatics with another discipline (programme FI, B-FY)
- Informatics with another discipline (programme FI, B-GE)
- Informatics with another discipline (programme FI, B-GK)
- Informatics with another discipline (programme FI, B-CH)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-MA)
- Informatics with another discipline (programme FI, B-TV)
- Informatics (programme FI, B-IN)
- Course objectives
- The goal of the course is an introduction to propositional and first-order logic, resolution principle, logic programming and computational logic, and inductive inference and knowledge representation.
- Syllabus
- Survey of logic calculi, syntax.
- Propositional logic, truth tables, axioms, provability.
- Essentials of proof theory in propositional logic, normal forms, resolution.
- First-order predicate calculus, predicate formulas, semantics, axioms, provability.
- Normal forms in predicate logic, skolemization.
- Essentials of proof theory in predicate logic, resolution.
- Introduction to logic programming, SLD-resolution. Basics of Prolog language.
- Basics of inductive inference and knowledge representation.
- Literature
- Assessment methods (in Czech)
- Součástí hodnocení jsou dvě semestrální zkoušky. Předmět je ukončen písemnou zkouškou formou testu, není povoleno používat žádné pomocné materiály.
- Language of instruction
- Czech
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually. - Teacher's information
- http://www.fi.muni.cz/usr/popelinsky/lectures/bak_logika/
- Enrolment Statistics (Spring 2007, recent)
- Permalink: https://is.muni.cz/course/fi/spring2007/IB101