| Module No. |
Name of Module |
Person in Charge |
| MCL-A-KRAI |
Knowledge Representation and Artificial Intelligence |
Prof. Michael Thielscher |
| Contents and qualification objectives |
Contents of this module:
- Knowledge categories;
- Logic-based formalisms for knowledge representation and their
mathematical properties;
- Inference methods for automatically processing knowledge;
- Design of knowledge bases;
- Foundations and applications of knowledge-based systems in
Artificial Intelligence.
With this module students gain a detailed understanding of how
knowledge is formalized and processed in Artificial Intelligence.
They acquire the skills of designing, formally specifying, and
implementing techniques of knowledge representation and reasoning.
With the focus on formal models in combination with systematic
methods from software engineering, this module provides the essential
basis for a scientific approach to Computer Science. |
| Form of teaching and education |
This module contains lectures, tutorials, seminars or
practicals of a total extent of at least 8 SWS in dependence of the
student's choice as well as the private studies. |
| Courses |
The courses are announced at the beginning of every
academic year giving the form of teaching and the SWS within the
course offer of the Computer Science Department for the study course
Computational Logic. |
| Prerequisits for participation |
Deepened knowledge of logic is required. |
| Usability |
This module is one of 5 advanced modules of the study
course Computational Logic, of which 3 ones have to be
chosen. |
| Prerequisits for allocation of credits |
The credits are given, if the module examination has
been passed. The module examination consists of an oral examination
of at least 30 and at most 60 minutes. |
| Credits and marks |
With this module 12 credits can be acquired. The mark of
the module is the mark obtained in the oral examination. |
| Frequency |
This module is offered every academic year beginning in
winter term. |
| Expenditure of work |
The expenditure of work is in all 360 hours. |
| Duration |
This module contains 2 semesters. |
| Module No. |
Name of Module |
Person in Charge |
| MCL-A-SV |
Specification and Verification |
Prof. Christel Baier |
| Contents and qualification objectives |
The module addresses modeling techniques for complex
systems, temporal and other program logics for specifying functional
and quantitative requirements, and corresponding verification
techniques. The students learn the theoretical foundations of formal
verification (model checking, interactive theorem proving) and get a
deep understanding of the design, implementation and application of
verification tools. |
| Form of teaching and education |
This module contains lectures, tutorials, seminars or
practicals of a total extent of at least 8 SWS in dependence of the
student's choice as well as the private studies. |
| Courses |
The courses are announced at the beginning of every
academic year giving the form of teaching and the SWS within the
course offer of the Computer Science Department for the study course
Computational Logic. |
| Prerequisits for participation |
Amongst basic knowledge of computer science and
mathematics deepened knowledge of logic is required. |
| Usability |
This module is one of 5 advanced modules of the study
course Computational Logic, of which 3 ones have to be
chosen. |
| Prerequisits for allocation of credits |
The credits are given, if the module examination has
been passed. The module examination consists of an oral examination
of at least 30 and at most 60 minutes. |
| Credits and marks |
With this module 12 credits can be acquired. The mark of
the module is the mark obtained in the oral examination. |
| Frequency |
This module is offered every academic year. |
| Expenditure of work |
The expenditure of work is in all 360 hours. |
| Duration |
This module contains 2 semesters. |
| Module No. |
Name of Module |
Person in Charge |
| MCL-A-SDS |
Syntax-directed Semantics |
Prof. Heiko Vogler |
| Contents and qualification objectives |
The contents of this module encompass the translation of
syntactic structures (e.g., derivation trees of programs or of
sentences in natural languages) into semantic structures (e.g.
translations into other formal or natural languages, respectively),
with a particular focus being on the theory of tree automata,
equivalent formalisms, and extensions of those formalisms on the one
hand, and applications in the area of statistical machine translation
and parsing of natural languages on the other hand.
Students who pass this module will be proficient in the foundations
of syntax-directed translation and will be able to apply and evaluate
formal models from this area. |
| Form of teaching and education |
This module contains lectures, tutorials, seminars or
practicals of a total extent of at least 8 SWS in dependence of the
student's choice as well as the private studies. |
| Courses |
The courses are announced at the beginning of every
academic year giving the form of teaching and the SWS within the
course offer of the Computer Science Department for the study course
Computational Logic. |
| Prerequisits for participation |
Basic knowledge of automata, formal languages and
computability on computer science bachelor level is required. |
| Usability |
This module is one of 5 advanced modules of the study
course Computational Logic, of which 3 ones have to be
chosen. |
| Prerequisits for allocation of credits |
The credits are given, if the module examination has
been passed. The module examination consists of an oral examination
of at least 30 and at most 60 minutes. |
| Credits and marks |
With this module 12 credits can be acquired. The mark of
the module is the mark obtained in the oral examination. |
| Frequency |
This module is offered every academic year beginning in
winter term. |
| Expenditure of work |
The expenditure of work is in all 360 hours. |
| Duration |
This module contains 2 semesters. |
| Module No. |
Name of Module |
Person in Charge |
| MCL-A-TCSL |
Theoretical Computer Science and Logic |
Prof. Franz Baader |
| Contents and qualification objectives |
The content of this module comprises selected techniques
of Theoretical Computer Science (like automata, decidability and
complexity results, term rewriting techniques) as well as their
application for the analysis of formal properties (like
axiomatizations, proof-theoretic properties, design of inference
algorithms and analysis of their properties) of logics (like
temporal logics, description logics, monadic second-order logic).
After completion of the module the students have a deep and
practically applicable knowledge of the methods from Theoretical
Computer Science that are relevant for application in logic, as well
as a good understanding of formal properties of various logics. |
| Form of teaching and education |
This module contains lectures, tutorials, seminars or
practicals of a total extent of at least 8 SWS in dependence of the
student's choice as well as the private studies. |
| Courses |
The courses are announced at the beginning of every
academic year giving the form of teaching and the SWS within the
course offer of the Computer Science Department for the study course
Computational Logic. |
| Prerequisits for participation |
Deepened knowledge of logic as well as basic knowledge in
the areas of automata theory, computability and complexity is
required. |
| Usability |
This module is one of 5 advanced modules of the study
course Computational Logic, of which 3 ones have to be
chosen. |
| Prerequisits for allocation of credits |
The credits are given, if the module examination has
been passed. The module examination consists of an oral examination
of at least 30 and at most 60 minutes. |
| Credits and marks |
With this module 12 credits can be acquired. The mark of
the module is the mark obtained in the oral examination. |
| Frequency |
This module is offered every academic year beginning in
winter term. |
| Expenditure of work |
The expenditure of work is in all 360 hours. |
| Duration |
This module contains 2 semesters. |
| Module No. |
Name of Module |
Person in Charge |
| MCL-A-IT |
Inference Techniques |
Prof. Steffen Hölldobler |
| Contents and qualification objectives |
The module containts selected inference techniques
applied in automatic or semi-automatic proof and inference systems
ranging from logic and calculus over data structures, strategies and
heuristics to implementations and applications.
After completion of the module students have an in depth
understanding of the development, implementation and application of
selected inference techniques. |
| Form of teaching and education |
This module contains lectures, tutorials, seminars or
practicals of a total extent of at least 8 SWS in dependence of the
student's choice as well as the private studies. |
| Courses |
The courses are announced at the beginning of every
academic year giving the form of teaching and the SWS within the
course offer of the Computer Science Department for the study course
Computational Logic. |
| Prerequisits for participation |
Deepened knowledge of logic is required. |
| Usability |
This module is one of 5 advanced modules of the study
course Computational Logic, of which 3 ones have to be
chosen. |
| Prerequisits for allocation of credits |
The credits are given, if the module examination has
been passed. The module examination consists of an oral examination
of at least 30 and at most 60 minutes. |
| Credits and marks |
With this module 12 credits can be acquired. The mark of
the module is the mark obtained in the oral examination. |
| Frequency |
This module is offered every academic year beginning in
winter term. |
| Expenditure of work |
The expenditure of work is in all 360 hours. |
| Duration |
This module contains 2 semesters. |
