Logical Systems and Logic Programming

• relate different kinds of proof systems
• construct formal proofs in elementary logics
• exploit selected classical and non-classical logics
• use the backtracking algorithm for simple problem solving
• analyze the effect of a declarative program
• establish a functional design for a given problem, so that the main concepts of the problem are directly traceable in the design
• master logical approaches to programming in terms of defining recursive predicates
• communicate solutions to problems in a clear and precise manner

The course covers logic programming (in particular Prolog as a rapid prototyping tool), elementary logics (including propositional and first-order logic), proof systems (deductive systems and/or refutation systems), and problem solving techniques (for instance the backtracking algorithm).

02002/02003/02100/02101/02102/01017/01019/02105, Programming in a declarative or imperative language, discrete mathematics, algorithms and data structures. Functional programming is an advantage.

Lectures, exercises and mandatory assignments.