FI:IA008 Computational Logic - Course Information
IA008 Computational Logic
Faculty of InformaticsSpring 2005
- Extent and Intensity
- 2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- Teacher(s)
- doc. RNDr. Lubomír Popelínský, Ph.D. (lecturer)
RNDr. Jan Blaťák, Ph.D. (seminar tutor) - 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 14:00–15:50 B410
- Timetable of Seminar Groups:
IA008/02: each odd Wednesday 18:00–19:50 B007, J. Blaťák - Prerequisites (in Czech)
- ! I008 Computational Logic
- Course Enrolment Limitations
- The course is only offered to the students of the study fields the course is directly associated with.
The capacity limit for the course is 253 student(s).
Current registration and enrolment status: enrolled: 0/253, only registered: 0/253 - fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, N-AP)
- Informatics (programme FI, M-IN)
- Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)
- Course objectives
- Logic as a computational tool.
- Syllabus
- Essentials of proof theory in propositional and first-order predicate logic.
- Technical notions: trees, König lemma, formulae analysis, abstract truth-tables, clausal form.
- Proofs in the propositional logic: system G, soundness, completeness, proof structure, compactness, cut elimination; resolution, refinements of the resolution, Horn clauses, SLD-resolution.
- Proof in the predicate logic: substitution, system G, compatness, Skolem-Löwenheim theorem, Herbrand theorem; prenex form, Skolemization, unification, resolution and its refinements, Horn clauses, SLD-resolution.
- Logic programming: SLD-serching, SLD-resolution trees, semantics. Prolog. Metanterpreters.
- Datalog and deductive databases
- Inductive logic programming.
- Modal logic, nonmonotonic inference, many-valued logic, inference with uncertainty
- Literature
- 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 (in Czech)
- Předmět je ukončen písemnou zkouškou formou testu.
- Language of instruction
- English
- Further Comments
- Study Materials
The course is taught annually.
- Enrolment Statistics (Spring 2005, recent)
- Permalink: https://is.muni.cz/course/fi/spring2005/IA008