192.064 Seminar in Theoretical Computer Science
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2022W, SE, 2.0h, 3.0EC, to be held in blocked form

Properties

  • Semester hours: 2.0
  • Credits: 3.0
  • Type: SE Seminar
  • Format: Online

Learning outcomes

After successful completion of the course, students are able to...

  • use formal methods from the area of knowledge compilation and knowledge graphs
  • solve hard reasoning problems scalably with the help of knowledge compilation
  • to aply this theoretically and practically in form of an implementation

Subject of course

In this seminar, we cover methods and questions from the areas of Knowledge Graphs und Knowledge Compilation.

Knowledge Graphs are knowledge bases that use a graph-like data model. They are often used to represent connection between objects, events and sitautions. In relation to the semantic web, Knowledge Graphs are often used in Open Data projects. A prominent application is Google's search engine. Knowledge Graphs are used, among other items, to reason over data and in particular to represent and use existing knowledge in an area instead of just answering simple queries.

Knowledge Compilation is a technique to transform knowledge (often in the form of formulas) into another representation. The specific goal is to translate computationally expensive and difficult tasks once into a respective reprsentation, and then to solve interesting questions more efficiently on the new representation.

The target audience are students interested to deepen their knowledge in one of these areas:

  • Knowledge Graphs
  • Knowledge Compilation

Deep previous knowledge in both areas is not necessary.

We cover both topics in the seminar and derive connections.

Teaching methods

Students first present a collection of articles on the core ideas of the areas. After that, connection between the areas are introduced and discussed in groups.

Mode of examination

Immanent

Additional information

ECTS Breakdown:

  • 10h introduction to subject matter
  • 30h algorithm design and implementation, 
  • 25h presentation (including time to prepare)

 

Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: Directive concerning the handling of plagiarism (PDF)

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Mon15:30 - 16:3010.10.2022 https://tuwien.zoom.us/j/97882129891?pwd=Slo5UUxtQnZFM2xDKzRJcXNuTUFOdz09Kick-Off
Thu17:00 - 18:0017.11.2022 https://tuwien.zoom.us/j/99715775813?pwd=bXNFZHA2QWpHdTFtU3ZYT1V3elVDUT09Topic Selection
Course is held blocked

Examination modalities

Assessement is based on the implementation and the oral presenation of the topic, including discussion of the connections based on theoretical articles. Selected works will show algorithms and implementation to connect theory to practice.

Course registration

Begin End Deregistration end
16.08.2022 00:00 31.01.2023 23:59 31.12.2022 23:59

Curricula

Study CodeObligationSemesterPrecon.Info
066 931 Logic and Computation Mandatory elective
066 936 Medical Informatics Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective

Literature

No lecture notes are available.

Previous knowledge

The target audience are students interested to deepen their knowledge in one of these areas:

  • Knowledge Graphs
  • Knowledge Compilation

Deep previous knowledge in both areas is not necessary.

Language

English