Logic Programming 2 - NAIL077
Title: Logické programování 2
Guaranteed by: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty: Faculty of Mathematics and Physics
Actual: from 2020
Semester: summer
E-Credits: 3
Hours per week, examination: summer s.:2/0, Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
Guarantor: RNDr. Jan Hric
Class: Informatika Mgr. - Teoretická informatika
Classification: Informatics > Programming, Theoretical Computer Science
Co-requisite : NAIL076
Opinion survey results   Examination dates   SS schedule   Noticeboard   
Annotation -
Last update: T_KTI (14.05.2015)
Prolog and its procedures, domains, data structures. Semantics of logic programs, Termination, Occur-check. Partial correctness, pre- and post-conditions. Negative information, rule "Negation by failure", nonmonotonic reasoning.
Aim of the course -
Last update: RNDr. Jan Hric (07.06.2019)

To learn theory and techniques used in logic programming.

Course completion requirements -
Last update: RNDr. Jan Hric (07.06.2019)

Oral exam on topics from lecture.

Literature -
Last update: T_KTI (14.05.2013)

Krzysztof R. Apt: From Logic Programming to Prolog, Prentice Hall International Series in Computer Science, 1996, ISBN-13: 978-0132303682

Krzysztof R. Apt , Roland Bol: Logic Programming and Negation: A survey. Journal of Logic Programming, 1994, vol. 19, pp. 9-71

John W. Lloyd. Foundations of Logic Programming (2nd edition). Springer-Verlag 1987

Syllabus -
Last update: T_KTI (14.05.2015)

Relation between SLD-resolution and pure Prolog. Domains, data structures.

Termination of Prolog programs, staged mappings. Occur-check, modes of programs, linear terms. Partial correctness, pre- and post-conditions.

Negative information. Nonmonotonic deduction, closed world assumption, deduction

rule "negation by failure". Characterization of finite failure.

Completion of logic program. Transformation from logic program P with negation to

its completion, programs IF(P), IFF(P) and completion. Correctness of the rule

"negation by failure". Completeness of the rule "negation by failure".