Logic and Logic Programming

Lecturer:

Olga Štěpánková (gar.)

Tutor:

Olga Štěpánková (gar.)

Supervisor:

Department of Cybernetics

Synopsis:

Mathematical logics and its relation to technical disciplines. Formal system

and its essential properties - validity, completeness. Syntax and semantics,

basic definitions. Compactness theorem. First order language and its

interpretation. Theory and its model, Herbrand´s model. Herbrand´s theorem,

Gödel´s completeness theorem and their practical implications. Limits of

computability and probability. Logic programming and Prolog language.

Metodology of logic programming. Introduction of extralogical features and

metapredicates. New trends - constraint logic programming (CLP)and inductive

logic programming (ILP). Some practical examples of complex logic programs

and practical applications.

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Study materials:

Tymoczko,T., Henle, J.: Sweet Reason: A Field Guide to Modern Logic.

Springer 2000

Flach, P.: Simply Logical - Intelligent Reasoning by Example. John Wiley &

Sons, Chichester 1994

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans:

• Doctoral studies, daily studies (compulsory elective course)
• Doctoral studies, combined studies (compulsory elective course)
• Doctoral studies, structured daily studies (compulsory elective course)
• Doctoral studies, structured combined studies (compulsory elective course)