FI:I013 Logic Programming I - Course Information
I013 Logic Programming I
Faculty of InformaticsSpring 2001
- Extent and Intensity
- 2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
- Teacher(s)
- prof. RNDr. Luděk Matyska, CSc. (lecturer)
Mgr. Eva Mráková, Ph.D. (seminar tutor)
Mgr. Adriana Strejčková (seminar tutor)
Shun Ha Sylvia Wong, Ph.D. (seminar tutor) - Guaranteed by
- prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: prof. RNDr. Luděk Matyska, CSc. - Timetable
- Thu 15:00–16:50 D1
- Timetable of Seminar Groups:
I013/02: each even Monday 16:00–17:50 B204, A. Strejčková
I013/03: each odd Wednesday 11:00–12:50 B204, E. Mráková
I013/04: each even Wednesday 11:00–12:50 B204, E. Mráková
I013/05: Thu 9:00–10:50 B204, S. Wong - Prerequisites
- I008 Computational Logic &&! U410 Logic Programming for CS
Passing through the lecture I008 Computational Logic is essential, but only for the masters' study program in informatics. - 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
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Information Technology (programme FI, B-IN)
- Syllabus
- First order logic, Definite clauses and programs, models, SLD resolution.
- Negation, SLDNF resolution, stratification programs.
- Control of program flow, reduction of program search tree, cut.
- Prolog, basic programming techniques, extra-logical predicates, arithmetics.
- Prolog implementation, Warren Abstract Machine. Implementace Prologu.
- Logic programming and parallelism, concurent systems (Concurrent Prolog, Parlog, GHC).
- Flat parallel logic programming languages.
- Constraint logic programming, combinatorial problems.
- Literature
- APT, Krzysztof R. From logic programming to Prolog. London: Prentice Hall, 1997, xviii, 328. ISBN 0-13-230368-X. info
- NILSSON, Ulf and Jan MAŁUSZYŃSKI. Logic, programming and Prolog. Chichester: John Wiley & Sons, 1990, xiv, 285. ISBN 0471926256. info
- O'KEEFE, Richard A. The Craft of Prolog. Cambridge: Massachusetts Institute of Technology, 1990, 387 s. ISBN 0262150395. info
- STERLING, Leon and Ehud Y. SHAPIRO. The art of Prolog : advanced programming techniques. 4th ed. Cambridge: MIT Press, 1987, x, 437. ISBN 0262192500. info
- Assessment methods (in Czech)
- Předmět je ukončen písemkou, na níž navazuje volitelná ústní zkouška
- Language of instruction
- Czech
- Follow-Up Courses
- Further comments (probably available only in Czech)
- The course is taught annually.
- Enrolment Statistics (Spring 2001, recent)
- Permalink: https://is.muni.cz/course/fi/spring2001/I013