Modules in Computational Logic at TU Wien

Module ECTS Hours Responsible Person
Foundation Modules
Foundations 12 8 Alexander Leitsch
Logic and Constraint Programming 12 8 Thomas Eiter
Advanced Logics 9 6 Matthias Baaz
Integrated Logic Systems 9 6 Georg Gottlob
Advanced Modules
Principles of Computation 12 Thomas Eiter
Logical Foundations 15 Alexander Leitsch
Mathematical Methods 11 Alexander Leitsch
Computational Logic for Information Technology 12 Georg Gottlob
Inference in Classical and Nonclassical Logic 12 Matthias Baaz
Student Project
Student Project 12 Georg Gottlob
Alexander Leitsch
Thomas Eiter
MSc Thesis
MSc Thesis 30 Georg Gottlob
Alexander Leitsch
Thomas Eiter
Matthias Baaz

Foundation Modules

Foundations

Keywords: propositional logic; first order logic; deduction; proof theory; abduction and induction; knowledge representation and reasoning; complexity theory; computer algebra.

The module offers a comprehensive introduction to Computational Logic covering the main subareas as well as main methods and techniques. After recalling basic notions from propositional and first order logic, complexity theory and computer algebra, the areas of equational reasoning, deduction, proof theory, abduction and induction, non-monotonic reasoning, logic-based program development, natural language processing and machine learning as well as logic and connectionism are covered.

Courses in 2009/2010:

Winter Semester
Summer Semester

Logic and Constraint Programming

Keywords: unification; declarative, procedural, and operational semantics; logic programming; constraint logic programming; combinatorics and analysis of algorithms.

This module is concerned with the foundations of logic programming and constraint logic programming. The basic computation mechanisms of unification and SLD-resolution are introduced. The declarative and the operational semantics of logic programs are given and related to the procedural semantics. A logic programming language is introduced as an example of a declarative programming language. Logic programs with constraints are introduced and basic computation mechanisms given. The module concludes with examples of constraint logic programming languages. In addition basic knowledge of combinatorics and analysis of algorithms is taught.

After the successful completion of this module, students will have acquired a profound understanding of the mathematical principles of logic programming. Students will also have experience in using logic programming languages and constraint logic programming languages for problem solving.

Courses in 2009/2010:

Summer Semester

Advanced Logic

Keywords: higher order logics; lambda calculus; lambda prolog; modal logics, epistemic logic; temporal logic; mu-calculus; CTL*; schematic tableaux; model theory.

The aim of this module is to introduce basic concepts beyond first-order predicate logics. In Computer Science many different logics and deductive systems exist. First we introduce higher order logic (HOL) as a framework for specifying syntactic and deductive notions of different logics. HOL is used in several interactive proof tools, like PVS and Isabelle. In addition, specific families of logics aimed at different application areas are introduced: logics of time and computation (modal logics, temporal Logics), logics for reasoning about knowledge (epistemic logic). Finally we introduce the mu-calculus which allows to define recursive temporal properties and we present a tableau based deduction calculus for the mu-calculus. The mu-calculus and its deduction system can be used to define problem oriented systems of modal operators and corresponding deduction systems.

Courses in 2009/2010:

Winter Semester
Summer Semester

Integrated Logic Systems

Keywords: Logic & computers, logic & other systems; logic & interfaces; logic & applications.

The module shall meet the demand for more practice-oriented subjects in the curriculum. By means of selected examples it shall give an insight to various issues of how logic can be used in real world applications. The students shall be introduced to how logic can be linked to computers (e.g. data structures, WAM, distributed computation), to other systems (e.g. ODCB, Oracle, Java, Interplay between Prolog and data bases) and to human interfaces (e.g. ML, Java). The principle techniques shall be supplemented by examples.

Courses in 2009/2010:

Winter Semester
Summer Semester

Advanced Modules

Principles of Computation

This module deals with the theoretical foundations of computation and with practical realizations. On the theoretical side it covers the theory of computability (computable functions, recursion theory, degrees of unsolvability), complexity theory (NP-completeness, the polynomial hierarchy NP-approximation), and different computing paradigms like quantum computation. On the practical side the areas functional programming and constraint logic programming are covered.

Courses:

Realization in 2009/2010:

Winter Semester
Summer Semester

Logical Foundations

This module deepens the knowledge in important traditional fields of mathematical logic like proof theory, model theory, set theory, lambda-calculus (typed and untyped) and combinatory logic.

Courses:

Realization in 2009/2010:

Winter Semester
Summer Semester

Mathematical Methods

The aim of this module is the extension of advanced mathematical knowledge which may be useful in solving difficult problems in computational logic. The mathematical areas included in this module are algebra, symbolic computation, discrete methods and combinatorics and others.

Courses:

No Realization in 2009/2010.

Computational Logic for Information Technology

This module contains several areas where methods of logic are applied in computer science. These areas are theory of data bases, deductive data bases, web data extraction and integration, data and knowledge-bases systems.

Courses:

Realization in 2009/2010:

Winter Semester
Summer Semester

Inference in Classical and Nonclassical Logic

This module presents several inference principles in more detail. These principles are term rewriting, unification theory, nonmonotonic reasoning, probabilistic reasoning and automated deduction in nonclassical logics. Moreover various nonclassical logics are introduced and their potential in modelling knowledge and reasoning is investigated.

Courses:

Realization in 2009/2010:

Winter Semester
Summer Semester

Student Project

Realization in 2009/2010:

Winter Semester
Summer Semester

MSc Thesis

For information on MSc Thesis, please contact Alexander Leitsch.

Further information


Other links for EMCL students at TUW:

List of modules and courses
Studying at TUW
Thesis and Graduation
General Information and Links
FAQs

Valid CSS! Valid HTML 4.01! Viewable With Any Browser