184.771 Systems and Solving Techniques for Knowledge Representation and Reasoning
Diese Lehrveranstaltung ist in allen zugeordneten Curricula Teil der STEOP.
Diese Lehrveranstaltung ist in mindestens einem zugeordneten Curriculum Teil der STEOP.

2015W, VU, 2.0h, 3.0EC


  • Semesterwochenstunden: 2.0
  • ECTS: 3.0
  • Typ: VU Vorlesung mit Übung

Ziele der Lehrveranstaltung

The goal of this lecture is to provide students with an understanding
how solving techniques are designed and implemented in state-of-the-art
systems. They become familiar with some of the most advanced methods
developed in the areas of AI and knowledge representation. This will
increase their ability to detect similarities among solving strategies
in different domains and thus the ability to migrate solving techniques
to other reasoning paradigms.

Inhalt der Lehrveranstaltung

Declarative knowledge is expressed by means of declarative sentences
in a symbolic language, and such knowledge is processed by running a
reasoning procedure that works on these sentences. In order to deal
with problems of real-world size, software systems that implement such
kind of knowledge processing (often called provers or solvers) require
advanced methods that take advantage of mature technology.  Moreover,
for performance heuristics, space-efficient data-structures and
parallelization techniques become crucial. This lecture shall give an
overview on such state-of-the-art methods and techniques. It will
also introduce students to the respective systems and tools. The knowledge
representation formalisms that are within the scope of this
course include Answer-Set Programming (and its extensions),
Description Logics, Constraint-Satisfaction formalisms, as well as
hybrid systems which aim at combining two or more knowledge
representation formalisms.

This lecture complements the related course about "Processing
of Declarative Knowledge" (184.700) which focuses on the modelling
aspect of declarative programming. This course, on the other hand,
shall provide deeper insight in the computational methods developed
for efficient evaluation of the modelled problem.  Compared to the
course "SAT Solving and Extensions" (184.090), the focus is here on
more powerful languages (e.g., supporting predicate language) which
therefore require techniques which go beyond the standard DPLL
procedure as employed in SAT-solvers (e.g., grounding, unification etc).

Weitere Informationen

ECTS breakdown (tentative):

Lecture 24h
Project/Preparation of Presentation: 51h

(3 ECTS = 75 Hours)

Vortragende Personen

  • Maratea, Marco


LVA Termine

Di.14:00 - 15:0013.10.2015Seminarraum FAV EG C (Seminarraum Gödel) Vorbesprechung
Fr.13:00 - 15:0016.10.2015Seminarraum FAV EG C (Seminarraum Gödel) VO
Mo.16:00 - 18:0019.10.2015Seminarraum FAV EG C (Seminarraum Gödel) VO
Fr.10:00 - 13:0023.10.2015Seminarraum FAV EG C (Seminarraum Gödel) VO
Mi.11:00 - 13:0028.10.2015Seminarraum FAV EG C (Seminarraum Gödel) VO
Fr.11:00 - 14:0030.10.2015Seminarraum FAV EG C (Seminarraum Gödel) VO
Mi.10:00 - 13:0004.11.2015Seminarraum FAV EG C (Seminarraum Gödel) VO
Fr.10:00 - 13:0006.11.2015Seminarraum FAV EG C (Seminarraum Gödel) VO
Mo.16:00 - 19:0009.11.2015Seminarraum FAV EG C (Seminarraum Gödel) VO


The course will be based on two main parts. The first part will consist of
lectures which provide the necessary background. In the second part of the
course the students prepare either a presentation of some paper(s) relevant
to the topic of the course, or carry out a project where they have to work
with systems discussed in the lecture.


Nicht erforderlich


066 011 DDP Computational Logic (Erasmus-Mundus) Gebundenes Wahlfach
066 931 Computational Intelligence Gebundenes Wahlfach
066 937 Software Engineering & Internet Computing Gebundenes Wahlfach


Es wird kein Skriptum zur Lehrveranstaltung angeboten.


The course is for master and PhD students with background in formal logic.
Some experience with knowledge representation and/or artificial intelligence
will be helpful, but is not a necessary precondition for successful

Weitere Informationen