IB013 Logic Programming I

Faculty of Informatics
Spring 2003
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).
doc. Mgr. Hana Rudová, Ph.D. (lecturer)
doc. RNDr. Aleš Horák, Ph.D. (seminar tutor)
Mgr. Eva Mráková, Ph.D. (seminar tutor)
Mgr. Miloslav Nepil, Ph.D. (seminar tutor)
Mgr. Adriana Strejčková (seminar tutor)
Guaranteed by
prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing - Faculty of Informatics
Contact Person: doc. Mgr. Hana Rudová, Ph.D.
Mon 14:00–15:50 D2
  • Timetable of Seminar Groups:
IB013/01: each even Wednesday 11:00–12:50 B117, A. Horák
IB013/02: each odd Wednesday 11:00–12:50 B117, E. Mráková
IB013/03: each odd Monday 17:00–18:50 B116, M. Nepil
IB013/04: each even Monday 17:00–18:50 B116, M. Nepil
IB013/05: each odd Monday 17:00–18:50 B411, A. Strejčková
IB013/06: each even Monday 17:00–18:50 B411, A. Strejčková
Prerequisites (in Czech)
! I013 Logic Programming I
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
Course objectives
The main goal of this lecture is to provide a basic information in the subject of Logic Programming. The lecture starts with basics of programming in Prolog. A brief introduction to computational logic is follwed by the description of a theoretical background of logic programming language Prolog. Constraint logic programming is presented from the theoretical and practical point of view. Implementation of Prolog is discussed in the last part of the lecture together with basic optimization techniques. Seminaries are focused on practical aspects of logic programming and constraint logic programming.
  • Prolog, basic programming techniques, data structures, extra-logical predicates, arithmetics, backtracking, cut.
  • First order logic, resolution, definite clauses and programs, models, SLD resolution.
  • Control of program flow, reduction of program search tree, cut.
  • Equality, negation, SLDNF resolution, stratification programs.
  • Constraint logic programming, basic programming in CLP(FD), constraint propagation, search.
  • Prolog implementation, Warren Abstract Machine.
  • BRATKO, Ivan. Prolog Programming for Artificial Intelligence. 3rd ed. Addison-Wesley, 2001. 678 pp. ISBN 0201-40375-7. info
  • CLOCKSIN, W. F. and Christopher S. MELLISH. Programming in Prolog. Berlin: Springer, 1994. xiv, 281. ISBN 3540583505. info
  • NERODE, Anil and Richard A. SHORE. Logic for applications. New York: Springer-Verlag, 1993. xvii, 365. ISBN 0387941290. info
  • NILSSON, Ulf and Jan MALUSZYNSKI. Logic, programming and Prolog. Chichester: John Wiley & Sons, 1990. 285 pp. ISBN 0-471-92625-6. URL 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
  • VAN HENTENRYCK, Pascal. Constraint Satisfaction in Logic Programming. Cambridge: Massachusetts Institute of Technology, 1989. 224 s. ISBN 0262081814. info
  • BARTÁK, Roman. On-line Guide to Constraint Programming. 2002. URL info
Assessment methods (in Czech)
Předmět je ukončen písemkou, na níž navazuje volitelná ústní zkouška
Language of instruction
Follow-Up Courses
Further comments (probably available only in Czech)
The course is taught annually.
The course is also listed under the following terms Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013.
  • Enrolment Statistics (Spring 2003, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2003/IB013