International Center for Computational Logic - Benutzerbeiträge [de]

HSZ 204

2026-10-06T08:49:52Z

Maximilian Marx: Die Seite wurde neu angelegt: „{{Raum |Navigator URL=http://navigator.tu-dresden.de/etplan/hsz/02/raum/136102.0040 |Beschreibung DE=Dies ist einer der Seminarräume im zweiten Stock des Hörsaalzentrums. Er enthält etwa 60 Sitzplätze. |Beschreibung EN=This is one of the seminar rooms on the second floor of Hörsaalzentrum. It offers around 60 seats. }}“

{{Raum |Navigator URL=http://navigator.tu-dresden.de/etplan/hsz/02/raum/136102.0040 |Beschreibung DE=Dies ist einer der Seminarräume im zweiten Stock des Hörsaalzentrums. Er enthält etwa 60 Sitzplätze. |Beschreibung EN=This is one of the seminar rooms on the second floor of Hörsaalzentrum. It offers around 60 seats. }}

HSZ 304

2026-10-06T08:48:45Z

Maximilian Marx: Die Seite wurde neu angelegt: „{{Raum |Navigator URL=http://navigator.tu-dresden.de/etplan/hsz/03/raum/136103.0040 |Beschreibung DE=Dies ist einer der Seminarräume im dritten Stock des Hörsaalzentrums. Er enthält etwa 100 Sitzplätze. |Beschreibung EN=This is one of the seminar rooms on the third floor of Hörsaalzentrum. It offers around 100 seats. }}“

{{Raum |Navigator URL=http://navigator.tu-dresden.de/etplan/hsz/03/raum/136103.0040 |Beschreibung DE=Dies ist einer der Seminarräume im dritten Stock des Hörsaalzentrums. Er enthält etwa 100 Sitzplätze. |Beschreibung EN=This is one of the seminar rooms on the third floor of Hörsaalzentrum. It offers around 100 seats. }}

Complexity Theory (WS2026)

2026-10-05T16:02:09Z

Maximilian Marx:

{{Vorlesung
|Title=Complexity Theory
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Lukas Gerlach
|Term=WS
|Year=2026
|Lecture series=Complexity Theory
|Matrix=#complexity:tu-dresden.de
|Module=INF-25-MA-FTK-CT
|SWSLecture=4
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=== Contents ==
This course covers both fundamental concepts and advanced topics in complexity theory.

Key topics are:
* '''Turing Machines (revision):''' Definition of Turing Machines; Variants; Computational Equivalence; Decidability and Recognizability; Enumeration
* '''Undecidability:''' Examples of Undecidable Problems; Mapping Reductions; Rice’s Theorem (both for characterizing Decidability and Recognizability); Recursion Theorem; Outlook into Decidability in Logic
* '''Time Complexity:''' Measuring Time Complexity; Many-One Reductions; Cook-Levin Theorem; Time Complexity Classes (P, NP, ExpTime); NP-completeness; pseudo-NP-complete problems
* '''Space Complexity:''' Space Complexity Classes (PSpace, L, NL); Savitch’s Theorem; PSpace-completeness; NL-completeness; NL = coNL
* '''Diagonalization:''' Hierarchy Theorems (det. Time, non-det. Time, Space); Gap Theorem; Ladner’s Theorem; Relativization; Baker-Gill-Solovay Theorem
* '''Alternation:''' Alternating Turing Machines; APTime = PSpace; APSpace = ExpTime; Polynomial Hierarchy 
* '''Circuit Complexity:''' Boolean Circuits; Alternative Proof of Cook-Levin Theorem; Parallel Computation (NC); P-completeness; P/poly; (Karp-Lipton Theorem, Meyer’s Theorem)
* '''Probabilistic Computation:''' Randomized Complexity Classes (RP, PP, BPP, ZPP); Sipser-Gács-Lautemann Theorem
* '''Quantum Computing:''' Quantum circuits, BQP, some basic results

===Mode of Teaching and Registration===

The course generally does not require a special registration, and there is no participant limit. However, students in programmes that use the Selma system (esp., students in CMS Master) will need to register there to obtain credits. 
Most of the materials will be freely available worldwide.

===Schedule and Location===

This page will publish all dates (see ''Dates & Materials'' above).
* The weekly lecture sessions will take place on Mondays DS4 (13.00 – 14.30) in [[APB E005]] and Tuesdays DS2 (09.20 – 10.50) in [[APB E005]].
* The weekly exercise session will take place on '''Tuesday DS5 (14.50 – 16.20)''', also in [[APB E005]].

===Contact===

Besides the regular meetings in lectures and exercise classes, you can also contact the teachers and other students in the public discussion channel on Matrix shown on the side.

===Acknowledgements===

The slides for some of the foundational lectures of this course are based on slides used by Markus Krötzsch for the course ''Complexity Theory'' at the University of Oxford, which were adopted from slides created by [http://logic.las.tu-berlin.de/Members/Kreutzer/ Stefan Kreutzer] and [http://www.cs.ox.ac.uk/people/ian.horrocks/ Ian Horrocks] for that course.

Further material has been prepared first by [[Daniel Borchmann/en|Daniel Borchmann]] during his time at TU Dresden.
|Literature=* '''Michael Sipser: ''Introduction to the Theory of Computation, International Edition''; 3rd Edition; Cengage Learning 2013'''
:: Introductory text that covers all basic topics in this lecture.

* Erich Grädel: ''Complexity Theory''; Lecture Notes, Winter Term 2009/10. Available online at https://logic.rwth-aachen.de/Teaching/KTQC-WS09/index.html.en
:: Free lecture notes with a general overview of main results; more detailed than Sipser on oracles and alternation; main reference for randomized computation

* John E. Hopcroft and Jeffrey D. Ullman: ''Introduction to Automata Theory, Languages, and Computation''; Addison Wesley Publishing Company 1979
:: The ''Cinderella Book''; contains a lot of information not contained in most other books; the hierarchy of undecidable problems as well as Rice' characterization of recognizable properties of recognizable languages are from here.

* Christos H. Papadimitriou: ''Computational Complexity''; 1995 Addison-Wesley Publishing Company, Inc
:: Standard reference text for many advanced aspects on complexity theory; the proofs of the Linear Speedup Theorem, the Gap Theorem, and Ladner's Theorem as given in the lecture are from here

* Sanjeev Arora and Boaz Barak: ''Computational Complexity: A Modern Approach''; Cambridge University Press 2009
:: Extensive book covering the state of the art of Complexity Theory

* Michael R. Garey and David S. Johnson: ''Computers and Intractability''; Bell Telephone Laboratories, Inc. 1979
:: The classical book on Complexity Theory; contains a long list of problems with their complexities


}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction and Motivation
|Room=APB E005
|Date=2026-10-12
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Turing Machines and Languages
|Room=APB E005
|Date=2026-10-13
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Undecidability
|Room=APB E005
|Date=2026-10-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Undecidability and Recursion
|Room=APB E005
|Date=2026-10-20
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Mathematical Foundations, Decidability, and Recognisability
|Room=APB E005
|Date=2026-10-20
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Time Complexity and Polynomial Time
|Room=APB E005
|Date=2026-10-26
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Polynomial-Time Reductions and Nondeterministic Polynomial Time
|Room=APB E005
|Date=2026-10-27
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Undecidability
|Room=APB E005
|Date=2026-10-27
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=NP-Completeness
|Room=APB E005
|Date=2026-11-02
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=NP-Complete Problems
|Room=APB E005
|Date=2026-11-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Time Complexity
|Room=APB E005
|Date=2026-11-03
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Space Complexity and PSPACE
|Room=APB E005
|Date=2026-11-09
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Polynomial Space and Games
|Room=APB E005
|Date=2026-11-10
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=NP-Completeness
|Room=APB E005
|Date=2026-11-10
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Logarithmic Space
|Room=APB E005
|Date=2026-11-16
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Hierarchy Theorems
|Room=APB E005
|Date=2026-11-17
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=More NP-Completeness and P-Completeness
|Room=APB E005
|Date=2026-11-17
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Space Hierarchy and Gaps
|Room=APB E005
|Date=2026-11-23
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=P vs. NP: Ladner's Theorem
|Room=APB E005
|Date=2026-11-24
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Space Complexity
|Room=APB E005
|Date=2026-11-24
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=P vs. NP and Diagonalisation
|Room=APB E005
|Date=2026-11-30
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Alternation
|Room=APB E005
|Date=2026-12-01
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Time and Space Complexity
|Room=APB E005
|Date=2026-12-01
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=The Polynomial Hierarchy
|Room=APB E005
|Date=2026-12-07
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Circuit Complexity
|Room=APB E005
|Date=2026-12-08
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Alternation
|Room=APB E005
|Date=2026-12-08
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Circuits and Parallel Computation
|Room=APB E005
|Date=2026-12-14
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Questions and Answers (before Christmas)
|Room=APB E005
|Date=2026-12-15
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Christmas Break
|Room=APB E005
|Date=2026-12-15
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Probabilistic Turing Machines
|Room=APB E005
|Date=2027-01-04
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Probabilistic Complexity Classes (1)
|Room=APB E005
|Date=2027-01-05
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Polynomial Hierarchy
|Room=APB E005
|Date=2027-01-05
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Probabilistic Complexity Classes (2)
|Room=APB E005
|Date=2027-01-11
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Quantum Computing (1)
|Room=APB E005
|Date=2027-01-12
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Circuit Complexity
|Room=APB E005
|Date=2027-01-12
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Quantum Computing (2)
|Room=APB E005
|Date=2027-01-18
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Interactive Proof Systems
|Room=APB E005
|Date=2027-01-19
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Randomised Computation
|Room=APB E005
|Date=2027-01-19
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Constant-Factor Approximations
|Room=APB E005
|Date=2027-01-25
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Polynomial-Time Approximation Schemes
|Room=APB E005
|Date=2027-01-26
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=All the Rest
|Room=APB E005
|Date=2027-01-26
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Parameterized Complexity
|Room=APB E005
|Date=2027-02-01
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Summary and Consultation
|Room=APB E005
|Date=2027-02-02
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=no more exercise
|Room=APB E005
|Date=2027-02-02
|DS=DS5
}}

Complexity Theory (WS2026)

2026-10-05T16:01:00Z

Maximilian Marx:

{{Vorlesung
|Title=Complexity Theory
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Lukas Gerlach
|Term=WS
|Year=2026
|Lecture series=Complexity Theory
|Matrix=#complexity:tu-dresden.de
|Module=INF-25-MA-FTK-CT
|SWSLecture=4
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=== Contents ==
This course covers both fundamental concepts and advanced topics in complexity theory.

Key topics are:
* '''Turing Machines (revision):''' Definition of Turing Machines; Variants; Computational Equivalence; Decidability and Recognizability; Enumeration
* '''Undecidability:''' Examples of Undecidable Problems; Mapping Reductions; Rice’s Theorem (both for characterizing Decidability and Recognizability); Recursion Theorem; Outlook into Decidability in Logic
* '''Time Complexity:''' Measuring Time Complexity; Many-One Reductions; Cook-Levin Theorem; Time Complexity Classes (P, NP, ExpTime); NP-completeness; pseudo-NP-complete problems
* '''Space Complexity:''' Space Complexity Classes (PSpace, L, NL); Savitch’s Theorem; PSpace-completeness; NL-completeness; NL = coNL
* '''Diagonalization:''' Hierarchy Theorems (det. Time, non-det. Time, Space); Gap Theorem; Ladner’s Theorem; Relativization; Baker-Gill-Solovay Theorem
* '''Alternation:''' Alternating Turing Machines; APTime = PSpace; APSpace = ExpTime; Polynomial Hierarchy 
* '''Circuit Complexity:''' Boolean Circuits; Alternative Proof of Cook-Levin Theorem; Parallel Computation (NC); P-completeness; P/poly; (Karp-Lipton Theorem, Meyer’s Theorem)
* '''Probabilistic Computation:''' Randomized Complexity Classes (RP, PP, BPP, ZPP); Sipser-Gács-Lautemann Theorem
* '''Quantum Computing:''' Quantum circuits, BQP, some basic results

===Mode of Teaching and Registration===

The course generally does not require a special registration, and there is no participant limit. However, students in programmes that use the Selma system (esp., students in CMS Master) will need to register there to obtain credits. 
Most of the materials will be freely available worldwide.

===Schedule and Location===

This page will publish all dates (see ''Dates & Materials'' above).
* The weekly lecture sessions will take place on Mondays DS4 (13.00 – 14.30) in [[APB E005]] and Tuesdays DS2 (09.20 – 10.50) in [[APB E005]].
* The weekly exercise session will take place on '''Tuesday DS5 (14.50 – 16.20)''', also in [[APB E005]].

===Contact===

Besides the regular meetings in lectures and exercise classes, you can also contact the teachers and other students in the public discussion channel on Matrix shown on the side.

===Acknowledgements===

The slides for some of the foundational lectures of this course are based on slides used by Markus Krötzsch for the course ''Complexity Theory'' at the University of Oxford, which were adopted from slides created by [http://logic.las.tu-berlin.de/Members/Kreutzer/ Stefan Kreutzer] and [http://www.cs.ox.ac.uk/people/ian.horrocks/ Ian Horrocks] for that course.

Further material has been prepared first by [[Daniel Borchmann/en|Daniel Borchmann]] during his time at TU Dresden.
|Literature=* '''Michael Sipser: ''Introduction to the Theory of Computation, International Edition''; 3rd Edition; Cengage Learning 2013'''
:: Introductory text that covers all basic topics in this lecture.

* Erich Grädel: ''Complexity Theory''; Lecture Notes, Winter Term 2009/10. Available online at https://logic.rwth-aachen.de/Teaching/KTQC-WS09/index.html.en
:: Free lecture notes with a general overview of main results; more detailed than Sipser on oracles and alternation; main reference for randomized computation

* John E. Hopcroft and Jeffrey D. Ullman: ''Introduction to Automata Theory, Languages, and Computation''; Addison Wesley Publishing Company 1979
:: The ''Cinderella Book''; contains a lot of information not contained in most other books; the hierarchy of undecidable problems as well as Rice' characterization of recognizable properties of recognizable languages are from here.

* Christos H. Papadimitriou: ''Computational Complexity''; 1995 Addison-Wesley Publishing Company, Inc
:: Standard reference text for many advanced aspects on complexity theory; the proofs of the Linear Speedup Theorem, the Gap Theorem, and Ladner's Theorem as given in the lecture are from here

* Sanjeev Arora and Boaz Barak: ''Computational Complexity: A Modern Approach''; Cambridge University Press 2009
:: Extensive book covering the state of the art of Complexity Theory

* Michael R. Garey and David S. Johnson: ''Computers and Intractability''; Bell Telephone Laboratories, Inc. 1979
:: The classical book on Complexity Theory; contains a long list of problems with their complexities


}}

{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction and Motivation
|Room=APB E005
|Date=2026-10-12
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Turing Machines and Languages
|Room=APB E005
|Date=2026-10-13
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Undecidability
|Room=APB E005
|Date=2026-10-19
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Undecidability and Recursion
|Room=APB E005
|Date=2026-10-20
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Mathematical Foundations, Decidability, and Recognisability
|Room=APB E005
|Date=2026-10-20
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Time Complexity and Polynomial Time
|Room=APB E005
|Date=2026-10-26
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Polynomial-Time Reductions and Nondeterministic Polynomial Time
|Room=APB E005
|Date=2026-10-27
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Undecidability
|Room=APB E005
|Date=2026-10-27
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=NP-Completeness
|Room=APB E005
|Date=2026-11-02
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=NP-Complete Problems
|Room=APB E005
|Date=2026-11-03
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Time Complexity
|Room=APB E005
|Date=2026-11-03
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Space Complexity and PSPACE
|Room=APB E005
|Date=2026-11-09
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Polynomial Space and Games
|Room=APB E005
|Date=2026-11-10
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=NP-Completeness
|Room=APB E005
|Date=2026-11-10
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Logarithmic Space
|Room=APB E005
|Date=2026-11-16
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Hierarchy Theorems
|Room=APB E005
|Date=2026-11-17
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=More NP-Completeness and P-Completeness
|Room=APB E005
|Date=2026-11-17
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Space Hierarchy and Gaps
|Room=APB E005
|Date=2026-11-23
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=P vs. NP: Ladner's Theorem
|Room=APB E005
|Date=2026-11-24
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Space Complexity
|Room=APB E005
|Date=2026-11-24
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=P vs. NP and Diagonalisation
|Room=APB E005
|Date=2026-11-30
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Alternation
|Room=APB E005
|Date=2026-12-01
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Time and Space Complexity
|Room=APB E005
|Date=2026-12-01
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=The Polynomial Hierarchy
|Room=APB E005
|Date=2026-12-07
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Circuit Complexity
|Room=APB E005
|Date=2026-12-08
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Alternation
|Room=APB E005
|Date=2026-12-08
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Circuits and Parallel Computation
|Room=APB E005
|Date=2026-12-14
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Questions and Answers (before Christmas)
|Room=APB E005
|Date=2026-12-15
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Christmas Break
|Room=APB E005
|Date=2026-12-16
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Probabilistic Turing Machines
|Room=APB E005
|Date=2027-01-04
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Probabilistic Complexity Classes (1)
|Room=APB E005
|Date=2027-01-05
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Polynomial Hierarchy
|Room=APB E005
|Date=2027-01-05
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Probabilistic Complexity Classes (2)
|Room=APB E005
|Date=2027-01-11
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Quantum Computing (1)
|Room=APB E005
|Date=2027-01-12
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Circuit Complexity
|Room=APB E005
|Date=2027-01-12
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Quantum Computing (2)
|Room=APB E005
|Date=2027-01-18
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Interactive Proof Systems
|Room=APB E005
|Date=2027-01-19
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Randomised Computation
|Room=APB E005
|Date=2027-01-19
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Constant-Factor Approximations
|Room=APB E005
|Date=2027-01-25
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Polynomial-Time Approximation Schemes
|Room=APB E005
|Date=2027-01-26
|DS=DS2
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=All the Rest
|Room=APB E005
|Date=2027-01-26
|DS=DS5
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Parameterized Complexity
|Room=APB E005
|Date=2027-02-01
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Summary and Consultation
|Room=APB E005
|Date=2027-02-02
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=no more exercise
|Room=APB E005
|Date=2027-02-02
|DS=DS5
}}

Knowledge Graphs (WS2026)

2026-10-05T15:27:51Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2026
|Lecture series=Knowledge Graphs
|Matrix=#kg:tu-dresden.de
|Module=INF-25-MA-FTK-KM, INF-E-3
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====News===
* the first lecture will take place on '''Tuesday, 2026-10-13, DS3 (11:10–12:40)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2026-10-14, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Tuesdays, DS3 (11:10 to 12:40) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
}}

{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2026-10-13
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2026-10-20
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2026-10-27
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2026-11-03
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2026-11-10
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2026-11-17
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2026-11-24
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2026-12-01
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2026-12-08
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2026-12-15
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2027-01-05
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2027-01-12
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. Knowledge Graph Quality
|Room=BAR 106
|Date=2027-01-19
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. Knowledge Graph Quality / Summary
|Room=BAR 106
|Date=2027-01-26
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2027-02-02
|DS=DS3
}}

{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2026-10-14
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2026-10-21
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=(no exercise)
|Room=N63 A001
|Date=2026-10-28
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. TBD
|Room=N63 A001
|Date=2026-11-04
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. TBD
|Room=N63 A001
|Date=2026-11-11
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2026-11-18
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. TBD
|Room=N63 A001
|Date=2026-11-25
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. TBD
|Room=N63 A001
|Date=2026-12-02
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. TBD
|Room=N63 A001
|Date=2026-12-09
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. TBD
|Room=N63 A001
|Date=2026-12-16
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. TBD
|Room=N63 A001
|Date=2027-01-06
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. TBD
|Room=N63 A001
|Date=2027-01-13
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. TBD
|Room=N63 A001
|Date=2027-01-20
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. TBD
|Room=N63 A001
|Date=2027-01-27
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. TBD
|Room=N63 A001
|Date=2027-02-03
|DS=DS4
|Download=
}}

Knowledge Graphs (WS2026)

2026-10-05T15:26:14Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2026
|Lecture series=Knowledge Graphs
|Matrix=#kg:tu-dresden.de
|Module=INF-25-MA-FTK-KM, INF-E-3
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====News===
* the first lecture will take place on '''Tuesday, 2026-10-13, DS3 (11:10–12:40)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2026-10-14, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Tuesdays, DS3 (11:10 to 12:40) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
}}

{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2026-10-13
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2026-10-20
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2026-10-27
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2026-11-03
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2026-11-10
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2026-11-17
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2026-11-24
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2026-12-01
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2026-12-08
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2026-12-15
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2027-01-05
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2027-01-12
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. Knowledge Graph Quality
|Room=BAR 106
|Date=2027-01-19
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. Knowledge Graph Quality / Summary
|Room=BAR 106
|Date=2027-01-26
|DS=DS3
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2027-02-02
|DS=DS3
}}

{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2026-10-14
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2026-10-21
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=(no exercise)
|Room=N63 A001
|Date=2026-11-28
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2026-11-04
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2026-11-11
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2026-11-18
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2026-11-25
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2026-12-02
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2026-12-09
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2026-12-16
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2027-01-06
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2027-01-13
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. Datalog and OWL
|Room=N63 A001
|Date=2027-01-20
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. Knowledge Graph Quality and Validation
|Room=N63 A001
|Date=2027-01-27
|DS=DS4
|Download=
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. More OWL & Datalog
|Room=N63 A001
|Date=2027-02-03
|DS=DS4
|Download=
}}

Knowledge Graphs (WS2026)

2026-10-05T14:34:25Z

Maximilian Marx:

Knowledge Graphs (WS2026)

2026-10-05T14:33:59Z

Maximilian Marx:

Knowledge Graphs (WS2026)

2026-10-05T14:32:21Z

Maximilian Marx:

Knowledge Graphs (WS2026)

2026-10-05T14:30:24Z

Maximilian Marx:

Complexity Theory (WS2026)

2026-10-05T14:29:19Z

Maximilian Marx:

Knowledge Graphs (WS2026)

2026-10-01T16:07:38Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2026
|Lecture series=Knowledge Graphs
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====News===
* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]

* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Tuesdays, DS3 (11:10 to 12:40) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]

}}

Knowledge Graphs (WS2026)

2026-10-01T16:07:22Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2026
|Lecture series=Knowledge Graphs
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====News===
* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]

* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.





===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Tuesdays, DS3 (11:10 to 12:40) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]

}}

Knowledge Graphs (WS2026)

2026-10-01T16:06:57Z

Maximilian Marx: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Knowledge Graphs |Research group=Wissensbasierte Systeme |Lecturers=Markus Krötzsch |Tutors=Maximilian Marx |Term=WS |Year=2026 |Lecture series=Knowledge Graphs |SWSLecture=2 |SWSExercise=2 |SWSPractical=0 |Exam type=mündliche Prüfung |Description====News=== * the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room BAR 106 <!-- * the first exercise will take place on '''Wednesday, 2025-10-22,…“

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2026
|Lecture series=Knowledge Graphs
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====News===
* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]

* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

 -->



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Tuesdays, DS3 (11:10 to 12:40) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]

}}

Complexity Theory (WS2026)

2026-10-01T12:10:24Z

Maximilian Marx:

Complexity Theory (WS2026)

2026-10-01T12:09:56Z

Maximilian Marx: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Complexity Theory |Research group=Wissensbasierte Systeme |Lecturers=Markus Krötzsch |Tutors=Lukas Gerlach |Term=WS |Year=2026 |Lecture series=Complexity Theory |Matrix=https://matrix.to/#/#complexity:tu-dresden.de |SWSLecture=4 |SWSExercise=2 |SWSPractical=0 |Exam type=mündliche Prüfung |Description=== Contents == This course covers both fundamental concepts and advanced topics in complexity theory. Key topics are: * '''Turing…“

Vorlage:ProjektModule2026

2026-09-24T12:14:19Z

Maximilian Marx:

{| class="wikitable"
!|
!|Modules
!|Title
!|Integrated Assignment
|-
!rowspan="2"|Bachelor Programme
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ba-BaSe.pdf?lang=en INF-25-Ba-BaSe]
|Bachelorseminar
|50h
|-
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ba-P-KBS.pdf?lang=en INF-25-Ba-P-KBS]
|Knowledge-Based Systems Lab
|80h
|-
!rowspan="4"|Master Programm
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-BSem.pdf?lang=en INF-25-Ma-BSem]
|Belegseminar
|50h
|-
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-GB.pdf?lang=en INF-25-Ma-GB]
|Großer Beleg
|180h
|-
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-AFT.pdf?lang=en INF-25-Ma-AFT]
|Analyse eines Forschungsthemas
|80h
|-
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-FP.pdf?lang=en INF-25-Ma-FP]
|Forschungsprojekt
|200h
|}

Larry González

2026-07-30T12:00:56Z

Maximilian Marx:

{{Mitarbeiter
|Vorname=Larry
|Nachname=González
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=1
|Telefon=+49 351 463 38043
|Email=larry.gonzalez@tu-dresden.de
|Matrix=@lgonzale:tu-dresden.de
|Raum=APB 3029
|Bild=Larry-Gonzalez-2019-10-21.jpg
|Info=I am a PhD student in the [[Wissensbasierte Systeme/en|Knowledge-Based Systems]] group lead by Prof. Dr. [[Markus Krötzsch]] since January 2018.

I completed my master's degree at the [http://www.uchile.cl/english University of Chile], under the supervision of Dr. [http://aidanhogan.com/ Aidan Hogan].
|Info EN=I am a PhD student in the [[Wissensbasierte Systeme/en|Knowledge-Based Systems]] group lead by Prof. Dr. [[Markus Krötzsch]] since January 2018.

I completed my master's degree at the [http://www.uchile.cl/ University of Chile], under the supervision of Dr. [http://aidanhogan.com/ Aidan Hogan].
|DBLP=https://dblp.uni-trier.de/pid/217/4413.html
|Google Scholar=https://scholar.google.de/citations?user=Ya2loVcAAAAJ
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
|Projekte anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Semantische Technologien
}}

Inproceedings3462

2026-06-10T10:43:25Z

Maximilian Marx:

{{Publikation Erster Autor
|ErsterAutorVorname=Raimund
|ErsterAutorNachname=Dachselt
|FurtherAuthors=Lukas Gerlach; Philipp Hanisch; Alex Ivliev; Markus Krötzsch; Maximilian Marx; Julián Méndez
}}
{{Inproceedings
|Referiert=1
|Title=Declarative Debugging for Datalog with Aggregation
|To appear=0
|Year=2026
|Booktitle=Proceedings of the Workshops of the EDBT/ICDT 2026 Joint Conference (EDBT/ICDT-WS 2026), Tampere, Finland, March 24, 2026
|Publisher=CEUR-WS.org
|Editor=Alexander Krause, João Felipe Pimentel
|Series=CEUR Workshop Proceedings
|Volume=4192
}}
{{Publikation Tool
|Tool=Nemo
}}
{{Publikation Details
|Abstract=We propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally
similar parts of proof trees into a single, easier to understand structure. We show how to query for such summaries, discuss the
implementation in our rule engine Nemo, and empirically establish the feasibility of the method. We also briefly introduce a graphical
interface for editing these proof queries and visualising the results.
|Download=TGD2026.pdf
|Link=https://ceur-ws.org/Vol-4192/TGD-paper4.pdf
|Projekt=CPEC, CeTI, SECAI, ScaDS.AI
|Forschungsgruppe=Wissensbasierte Systeme
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Regelbasiertes Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Nichtmonotones Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}

Inproceedings3462

2026-06-10T10:43:08Z

Maximilian Marx:

{{Publikation Erster Autor
|ErsterAutorVorname=Raimund
|ErsterAutorNachname=Dachselt
|FurtherAuthors=Lukas Gerlach; Philipp Hanisch; Alex Ivliev; Markus Krötzsch; Maximilian Marx; Julián Méndez
}}
{{Inproceedings
|Referiert=1
|Title=Declarative Debugging for Datalog with Aggregation
|To appear=1
|Year=2026
|Booktitle=Proceedings of the Workshops of the EDBT/ICDT 2026 Joint Conference (EDBT/ICDT-WS 2026), Tampere, Finland, March 24, 2026
|Publisher=CEUR-WS.org
|Editor=Alexander Krause, João Felipe Pimentel
|Series=CEUR Workshop Proceedings
|Volume=4192
}}
{{Publikation Tool
|Tool=Nemo
}}
{{Publikation Details
|Abstract=We propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally
similar parts of proof trees into a single, easier to understand structure. We show how to query for such summaries, discuss the
implementation in our rule engine Nemo, and empirically establish the feasibility of the method. We also briefly introduce a graphical
interface for editing these proof queries and visualising the results.
|Download=TGD2026.pdf
|Link=https://ceur-ws.org/Vol-4192/TGD-paper4.pdf
|Projekt=CPEC, CeTI, SECAI, ScaDS.AI
|Forschungsgruppe=Wissensbasierte Systeme
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Regelbasiertes Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Nichtmonotones Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}

Knowledge Graphs (WS2025)

2026-04-02T10:04:19Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* '''Post-exam review''': You can review your written exam on Wednesday, 2026-04-15, at 14:50 in [[APB 3027]].
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.
* for CMS-COR-KM, there will be a written exam on '''Thursday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]].

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This will be a written exam on '''Thursday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]]. 



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
|Download=KG2025-Lecture-10-overlay.pdf, KG2025-Lecture-10-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
|Download=KG2025-Lecture-11-overlay.pdf, KG2025-Lecture-11-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
|Download=kg2025-exercise-09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. Knowledge Graph Quality
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
|Download=KG2025-Lecture-12-overlay.pdf, KG2025-Lecture-12-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. Datalog and OWL
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
|Download=kg2025-exercise-10.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. Knowledge Graph Quality / Summary
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
|Download=KG2025-Lecture-13-overlay.pdf, KG2025-Lecture-13-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. Knowledge Graph Quality and Validation
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
|Download=kg2025-exercise-11.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. More OWL & Datalog
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
|Download=kg2025-exercise-12.pdf
}}

Vorlage:ProjektModule2026

2026-03-30T10:42:51Z

Maximilian Marx: Die Seite wurde neu angelegt: „{| class="wikitable" !| !|Modules !|Title !|Integrated Assignment |- !|Bachelor Programme |[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ba-BaSe.pdf?lang=en INF-25-Ba-BaSe] |Bachelorseminar |50h |- !rowspan="4"|Master Programm |[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-BSem.pdf?lang=en INF-25-Ma-BSem] |Belegseminar |50h |- |[https://tu-dr…“

{| class="wikitable"
!|
!|Modules
!|Title
!|Integrated Assignment
|-
!|Bachelor Programme
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ba-BaSe.pdf?lang=en INF-25-Ba-BaSe]
|Bachelorseminar
|50h
|-
!rowspan="4"|Master Programm
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-BSem.pdf?lang=en INF-25-Ma-BSem]
|Belegseminar
|50h
|-
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-GB.pdf?lang=en INF-25-Ma-GB]
|Großer Beleg
|180h
|-
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-AFT.pdf?lang=en INF-25-Ma-AFT]
|Analyse eines Forschungsthemas
|80h
|-
|[https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-25/de/INF-25-Ma-FP.pdf?lang=en INF-25-Ma-FP]
|Forschungsprojekt
|200h
|}

Inproceedings3462

2026-03-19T13:17:08Z

Maximilian Marx:

{{Publikation Erster Autor
|ErsterAutorVorname=Raimund
|ErsterAutorNachname=Dachselt
|FurtherAuthors=Lukas Gerlach; Philipp Hanisch; Alex Ivliev; Markus Krötzsch; Maximilian Marx; Julián Méndez
}}
{{Inproceedings
|Referiert=1
|Title=Declarative Debugging for Datalog with Aggregation
|To appear=1
|Year=2026
|Booktitle=Proceedings of the Workshops of the EDBT/ICDT 2026 Joint Conference (EDBT/ICDT-WS 2026), Tampere, Finland, March 24, 2026
|Publisher=CEUR-WS.org
|Editor=Alexander Krause, João Felipe Pimentel
|Series=CEUR Workshop Proceedings
}}
{{Publikation Tool
|Tool=Nemo
}}
{{Publikation Details
|Abstract=We propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally
similar parts of proof trees into a single, easier to understand structure. We show how to query for such summaries, discuss the
implementation in our rule engine Nemo, and empirically establish the feasibility of the method. We also briefly introduce a graphical
interface for editing these proof queries and visualising the results.
|Download=TGD2026.pdf
|Projekt=CPEC, CeTI, SECAI, ScaDS.AI
|Forschungsgruppe=Wissensbasierte Systeme
}}

Karina Adler

2026-03-19T11:36:47Z

Maximilian Marx: Maximilian Marx verschob die Seite Karina Adler nach Karina Neupert: Namensaenderung

#WEITERLEITUNG [[Karina Neupert]]

Karina Neupert

2026-03-19T11:36:47Z

Maximilian Marx: Maximilian Marx verschob die Seite Karina Adler nach Karina Neupert: Namensaenderung

{{Mitarbeiter
|Vorname=Karina
|Nachname=Neupert
|Forschungsgruppe=Computational Logic; Logische Programmierung und Argumentation
|Stellung=Technikerin
|Ehemaliger=0
|Telefon=+49 351 463 38521
|Email=karina.neupert@tu-dresden.de
|Raum=APB 2004
|Bild=Adler.jpeg
|Publikationen anzeigen=0
|Abschlussarbeiten anzeigen=0
}}

Inproceedings3203

2026-03-03T13:43:30Z

Maximilian Marx:

{{Publikation Erster Autor
|ErsterAutorVorname=Markus
|ErsterAutorNachname=Krötzsch
|FurtherAuthors=Maximilian Marx; Sebastian Rudolph
}}
{{Inproceedings
|Referiert=0
|Title=The Power of the Terminating Chase
|To appear=0
|Year=2019
|Booktitle=Proceedings of the 22nd International Conference on Database Theory (ICDT 2019)
|Pages=3:1--3:17
|Publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik
|Editor=Pablo Barceló, Marco Calautti
|Series=LIPIcs
|Volume=127
}}
{{Publikation Details
|Abstract=The chase has become a staple of modern database theory with applications in data integration, query optimisation, data exchange, ontology-based query answering, and many other areas. Most application scenarios and implementations require the chase to terminate and produce a finite universal model, and a large arsenal of sufficient termination criteria is available to guarantee this
(generally undecidable) condition. In this invited tutorial, we therefore ask about the expressive power of logical theories for which the chase terminates. Specifically, which database properties can be recognised by such theories, i.e., which Boolean queries can they realise? For the skolem (semi-oblivious) chase, and almost any known termination criterion, this expressivity is just that of plain Datalog. Surprisingly, this limitation of most prior research does not apply to the chase in general. Indeed, we show that standard–chase terminating theories can realise queries with data complexities ranging from PTime to non-elementary that are out of reach for the terminating skolem chase. A “Datalog-first” standard chase that prioritises applications of rules without existential quantifiers makes modelling simpler – and we conjecture: computationally more efficient. This is one of the many open questions raised by our insights, and we conclude with an outlook on the research opportunities in this area.
|Download=Terminating-Chase-Power-ICDT2019.pdf
|Slides=Terminating-Chase-Power-ICDT2019-Invited-Talk-slides.pdf
|DOI Name=10.4230/LIPIcs.ICDT.2019.3
|Projekt=DIAMOND, DeciGUT, HAEC B08
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Techreport3024

2026-03-03T13:42:34Z

Maximilian Marx:

{{Publikation Erster Autor
|ErsterAutorVorname=Tom
|ErsterAutorNachname=Hanika
|FurtherAuthors=Maximilian Marx; Gerd Stumme
}}
{{Techreport
|Title=Discovering Implicational Knowledge in Wikidata
|Year=2019
|Month=Februar
|Institution=arXiv.org
|Archivierungsnummer=CoRR abs/1902.00916
}}
{{Publikation Details
|Abstract=Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Examples include the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata. A distinguishing feature of Wikidata is that the knowledge is collaboratively edited and curated. While this greatly enhances the scope of Wikidata, it also makes it impossible for a single individual to grasp complex connections between properties or understand the global impact of edits in the graph. We apply Formal Concept Analysis to efficiently identify comprehensible implications that are implicitly present in the data. Although the complex structure of data modelling in Wikidata is not amenable to a direct approach, we overcome this limitation by extracting contextual representations of parts of Wikidata in a systematic fashion. We demonstrate the practical feasibility of our approach through several experiments and show that the results may lead to the discovery of interesting implicational knowledge. Besides providing a method for obtaining large real-world data sets for FCA, we sketch potential applications in offering semantic assistance for editing and curating Wikidata.
|Download=HMS19-discovering-wikidata-tr.pdf
|Link=https://arxiv.org/abs/1902.00916
|DOI Name=10.48550/arXiv.1902.00916
|Projekt=Wikidata
|Forschungsgruppe=Wissensbasierte Systeme
}}

Techreport3024

2026-03-03T13:42:18Z

Maximilian Marx:

{{Publikation Erster Autor
|ErsterAutorVorname=Tom
|ErsterAutorNachname=Hanika
|FurtherAuthors=Maximilian Marx; Gerd Stumme
}}
{{Techreport
|Title=Discovering Implicational Knowledge in Wikidata
|Year=2019
|Month=Februar
|Institution=arXiv.org
|Archivierungsnummer=CoRR abs/1902.00916
}}
{{Publikation Details
|Abstract=Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Examples include the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata. A distinguishing feature of Wikidata is that the knowledge is collaboratively edited and curated. While this greatly enhances the scope of Wikidata, it also makes it impossible for a single individual to grasp complex connections between properties or understand the global impact of edits in the graph. We apply Formal Concept Analysis to efficiently identify comprehensible implications that are implicitly present in the data. Although the complex structure of data modelling in Wikidata is not amenable to a direct approach, we overcome this limitation by extracting contextual representations of parts of Wikidata in a systematic fashion. We demonstrate the practical feasibility of our approach through several experiments and show that the results may lead to the discovery of interesting implicational knowledge. Besides providing a method for obtaining large real-world data sets for FCA, we sketch potential applications in offering semantic assistance for editing and curating Wikidata.
|Download=HMS19-discovering-wikidata-tr.pdf
|Link=https://arxiv.org/abs/1902.00916
|DOI Name=https://doi.org/10.48550/arXiv.1902.00916
|Projekt=Wikidata
|Forschungsgruppe=Wissensbasierte Systeme
}}

Vorlage:Personal Control Centre

2026-03-03T13:35:49Z

Maximilian Marx:

<noinclude>Use this template on user pages to create a convenient overview of available actions. For best results, insert the following on your user page:

<pre>{{Personal Control Centre}}</pre>

Used on a user's page, this will create a personalised view with some specific items.

</noinclude>__NOTOC__{{#ifeq: {{NAMESPACENUMBER}}|2|<h2>Personal Control Centre of {{PAGENAME}}</h2>
<span class="fas fa-chevron-right"></span> [[{{PAGENAME}}|my page]]    
<span class="fas fa-chevron-right"></span> [[{{PAGENAME}}/Publikationen|my publications]]

 |}}{{#maketabs:
|Publications=

{{#ifeq: {{NAMESPACENUMBER}}|2|You are the author of <span class="badge">{{#ask: [[Author::{{PAGENAME}}]] [[Category:Publikation]]
| format = count
}}</span> publications, and the supervisor of <span class="badge">{{#ask: [[Betreuer::{{PAGENAME}}]] [[Category:Abschlussarbeit]] [[Abschlussarbeitsstatus::Abgeschlossen]]
| format = count
}}</span> completed student theses on this site.<br/><br/>|}}

====Add Publications====

{{Two-column row
|{{#formlink:form=Article|link text={{Button|Article|success}}}}
|an article you have published in a journal
}}
{{Two-column row
|{{#formlink:form=Book|link text={{Button|Book|success}}}}
|a book that you are the author or editor of (for conference proceedings use "Proceedings" below
}}
{{Two-column row
|{{#formlink:form=Incollection|link text={{Button|Book chapter|success}}}}
|chapter in a book (but not a regular conference/workshop paper)
}}
{{Two-column row
|{{#formlink:form=Inproceedings|link text={{Button|Conference or workshop paper|success}}}}
|research paper that appeared in the proceedings of a conference, workshop, etc.
}}
{{Two-column row
|{{#formlink:form=phdthesis|link text={{Button|PhD Thesis|success}}}}
|your own doctoral thesis; if you published your thesis with a publisher (as common in Germany) you can use "Book" instead
}}
{{Two-column row
|{{#formlink:form=Proceedings|link text={{Button|Proceedings|success}}}}
|proceedings that you have edited (conferences, workshops, etc.)
}}
{{Two-column row
|{{#formlink:form=Deliverable|link text={{Button|Project deliverable|success}}}}
|deliverables from EU projects and other project reports
}}
{{Two-column row
|{{#formlink:form=Abschlussarbeit|link text={{Button|Supervised student thesis|success}}}}
|2=any project or final thesis that ''you supervised'' (see below for how to enter your own theses) <span class="btn btn-xs btn-warning invert-color">Supervised by you</span>
}}
{{Two-column row
|{{#formlink:form=Misc|link text={{Button|Talk or other|success}}}}
| This can be used for anything "miscellaneous" that has no published research paper: invited talks, demos and posters (without paper), own student theses, etc.
}}
{{Two-column row
|{{#formlink:form=Techreport|link text={{Button|Technical report|success}}}}
|technical reports, including ''arxiv'' publications
}}
{{Two-column row
|[[Formular:DataOrTool|{{Button|Dataset or tool|info}}]]
|Datasets and software tools can be important research results on their own. All publication input forms allow you to associate such artefacts with a publication. Use this button to add a dataset or tool.
}}

====How to publish …====
* Habilitations (post-doctoral thesis): use book
* Master's or Bachelor's theses: for theses of your students, see "student projects"; for your own theses use "Others" (example: [[Misc916]])
* Publications that are "to appear": use the type that they have; the input form includes an option "to appear" that you can tick; set the year to the expected year of apperance
* Talk slides: all publication types allow you to upload talks slides; if you gave a talk without any paper, use "Talk or other"

|Activities=

Activities is anything that you do (professionally) that you would like to be displayed on your personal page. This includes '''memberships in programme committees''' and things you organise. Activities are fairly lightweight: they just have a title, a URL to link to, and a time interval during which they are relevant (after the end year of an activity is over, it will automatically vanish from your page).

{{#formlink:form=Aktivität|link text={{Button|Add new activity|info}}}}

{{#ifeq: {{NAMESPACENUMBER}}|2|To edit your existing activities, use the links below to get to their actual page. The links on your personal page do not lead to the pages where the activities were defined, since they point directly to the activity's URL.

Ongoing activities: {{#ask: [[Category:Aktivität]] [[Person::{{PAGENAME}}]] [[Ende(Jahr)::>{{CURRENTYEAR}}]]
| ?Beschreibung DE=Description DE
| ?Beschreibung EN=Description EN
| ?Start(Jahr)=Start
| ?Ende(Jahr)=End
| ?Rank
| format=broadtable
| sort=Rank,Start(Jahr)
| order=desc,desc
|limit=30
|default=none
|searchlabel=view more results
}}

Past activities: {{#ask: [[Category:Aktivität]] [[Person::{{PAGENAME}}]] [[Ende(Jahr)::<{{CURRENTYEAR}}]] [[Ende(Jahr)::!{{CURRENTYEAR}}]]
| ?Beschreibung DE=Description DE
| ?Beschreibung EN=Description EN
| ?Start(Jahr)=Start
| ?Ende(Jahr)=End
| ?Rank
| format=broadtable
| sort=Ende(Jahr)
| order=desc
|limit=10
|default=none
|searchlabel=view more results
}}
|}}

|Teaching=

{{Two-column row
| {{#formlink:form=Vorlesung|link text={{Button|Course|info}}}}
| Add a description for a new lecture or seminar.
}}
{{Two-column row
| {{#formlink:form=Vorlesungsreihe|link text={{Button|Lecture series|info}}}}
| Add a description for a new lecture series.
}}
{{Two-column row
| {{#formlink:form=Abschlussarbeit|link text={{Button|Thesis topic|info}}}}
| Add a new thesis topic that you are willing to supervise. You can specify what kind of thesis the topic would be suitable for. Please add yourself as a supervisor.
}}
{{Two-column row
| {{#formlink:form=Abschlussarbeit|link text={{Button|Supervised thesis|info}}}}
| Add a new thesis you supervised. You can also publish a PDF if desired (the author who holds the copyright has to agree with this).
}}

|Research topics=

It is possible to add new [[Forschungsfelder/en|Research areas]] to describe your research more accurately. <span class="btn btn-xs btn-warning invert-color">Highly visible</span>

Guidelines:
* '''Always check with your head of group first.''' Research topics define what we stand for and are highly visible through the site.
* Ask yourself if a new research topic is really needed or if you could use one of the existing topics instead. As a guideline, there should be at least three publications on the topic with more to be expected.
* Always provide an informative description in German and English. Do not create a topic if you do not have time for a proper description now.
* Use a nice illustrating picture. It can be far-fetched (there is a field to explain it with) but it should be attractive.

[[Formular:Forschungsgebiet|{{Button|Add new research field|danger}}]]

|News and events=

News or events are announced on the main page (though for events you can disable this in the form). Check with your head of group before starting to add such contents.

{{Two-column row
| {{#formlink:form=Veranstaltung|link text={{Button|Event}}}}
| 2=Add a new event, such as a talk at the faculty, a student's defense, or a conference or workshop at TUD.
}}
{{Two-column row
| {{#formlink:form=Neuigkeit|link text={{Button|News|danger}}}}
| 2=Add a news item for the main page. This '''will''' appear on the main page, so make sure to choose a good title and to give a meaningful description. <span class="btn btn-xs btn-warning invert-color">Highly visible</span>
}}

|People, groups and projects=

'''Please check with your head of group before adding any content from this section.'''

{{Two-column row
| [[Formular:Partner|{{Button|Partner organisation}}]]
| Add a new research or industry coorperation.
}}
{{Two-column row
| {{#formlink:form=Projekt|link text={{Button|Research project}}}}
| Add a new research project. Normally, this should only be used for ''research'' projects in a narrow sense. For software projects, use "Data or tool" under publications.
}}
{{Two-column row
|[[Formular:Mitarbeiter|{{Button|Person}}]]
|You can create pages for researchers, student assistants, external doctoral students, and guests. Before uploading somebodies email or picture, be sure to get his or her permission. Only administrator users can create new accounts on this site. When doing this, always use the correct name of the person and add the [[Template:Personal Control Centre|Personal Control Center]] to their user pages.
}}
{{Two-column row
| [[Formular:Forschungsgruppe|{{Button|Research group}}]]
| Add a new research group.
}}
{{Two-column row
| [[Formular:Raum|{{Button|Room}}]]
| Add a page for a room.
}}
{{Two-column row
| {{#formlink:form=StellenausschreibungModern|link text={{Button|Job offer|danger}}}}
| Publish a job offer. '''Please note that job advertisements are governed by university regulations as well as by applicable laws. If you don't know the details, you should not publish anything.'''
}}
{{Two-column row
| {{#formlink:form=Stellenausschreibung|link text={{Button|Job offer (legacy style)|danger}}}}
| Publish a job offer using the legacy style. '''Please note that job advertisements are governed by university regulations as well as by applicable laws. If you don't know the details, you should not publish anything.'''
}}

|TODOs={{#ifeq: {{NAMESPACENUMBER}}|2|

This page lists potential problems with your data that you should attend to.

{{#ask: [[To appear::1]] [[Author::{{PAGENAME}}]]
| ?Year
| ?Title
| format = broadtable
| limit=100
| intro= <h2>Publications marked "to appear"</h2>
The following table shows all of your publication marked as "to appear". If their date is in the past, you should probably update them (or change the date to a realistic time when they will appear).
}}{{#ask: [[Category:Seiten mit defekten Dateilinks||Publications without download]]
[[Author::{{PAGENAME}}]]
| ?Year
| ?Title
| ?Category:Publications without download#X,-=missing
| ?Category:Seiten mit defekten Dateilinks#X,-=broken
| format = broadtable
| limit=100
| intro= <h2>Publications with missing or broken download links</h2>
The following table shows all of your publication that are missing a download PDF ("missing") or that refer to a PDF file that does not exist on this wiki ("broken"). The former might be unavoidable in some cases, but the latter should not occur. Click the table headers to sort by time or by error.
}}{{#ask: [[Category:Publications without DOI]]
[[Author::{{PAGENAME}}]]
| ?Year
| ?Title
| format = broadtable
| limit=100
| intro= <h2>Publications with missing DOIs</h2>
The following table shows all of your publication that are missing a DOI. This might not be available for older publications, but should not happen for anything recent.
}}
|Personalised TODOs are only displayed when using this template on a user page.}}
}}

Kategorie:Publications without DOI

2026-03-03T13:33:55Z

Maximilian Marx: Die Seite wurde neu angelegt: „This category automatically collects publications that are missing a DOI.“

This category automatically collects publications that are missing a DOI.

Vorlage:Publikation Details

2026-03-03T13:33:24Z

Maximilian Marx:

<noinclude>
This template is used to display all types of publications.
Sie sollte im folgenden Format aufgerufen werden:
<pre>
{{Publikation Details
| Abstract=
| ISBN=
| ISSN=
| Link=
| Download=
| Slides=
| DOI Name=
| Projekt=
| Forschungsgruppe=
| BibTex=
}}

To make it bilingual, we use this: <span class="lang-de">'''Kurzfassung'''</span><span class="lang-en">'''Abstract'''</span>
</pre>

* [[Attribut:BibTex|BibTex]]

If BibTex is not defined in the specific publication type, such as [[Vorlage:Article]], an automatically generated version is displayed.

</noinclude><includeonly>__NOTOC__{{#ifeq:{{{Download|}}}||[[Category:Publications without download]]|}}{{#ifeq:{{{DOI Name|}}}||[[Category:Publications without DOI]]|}}{{#set:
| Abstract={{{Abstract|}}}
| ISBN={{{ISBN|}}}
| ISSN={{{ISSN|}}}
| Link={{{Link|}}}
| Download={{{Download|}}}
| Slides={{{Slides|}}}
| DOI Name={{{DOI Name|}}}
}}{{#leftsidenav:
<br/>
<br/>
{{LeftsidenavHeading|1=<span class="lang-de">[[Veröffentlichungen|{{MediaWiki:Portal label Publikationen}}]]</span><span class="lang-en">[[Veröffentlichungen/en|{{MediaWiki:Portal label Publikationen/en}}]]</span>}}
<ul class="nav-list">
<li><span class="lang-de">{{MediaWiki:Portal_label_Nach_Autor}}</span><span class="lang-en">{{MediaWiki:Portal_label_Nach_Autor/en}}</span>
<div style="font-size: 95%; "><ul class="nav-list" style="padding-left: 1ex !important; ">
{{#arraymap:{{#var:AuthorList|}}|;|@@@|
{{#ask: [[@@@]] [[Publikationen anzeigen::1]]
|link=none
|format=plainlist
|template=Link to publication page
|intro=<li>
|outro=</li>
}}
|}}
</ul></div>
</li>
<li><span class="lang-de">{{MediaWiki:Portal_label_Nach_Forschungsgruppe}}</span><span class="lang-en">{{MediaWiki:Portal_label_Nach_Forschungsgruppe/en}}</span>
<div style="font-size: 95%; "><ul class="nav-list" style="padding-left: 1ex !important; ">
{{#arraymap:{{{Forschungsgruppe|}}}|,|@@@|<li><span class="lang-de">[[@@@/Publikationen|@@@]]</span><span class="lang-en">[[@@@/Publikationen/en|{{#show: @@@| ?Name EN| default=@@@}}]]</span></li>|}}
</ul></div>
</li>
</ul>
|<div style="margin-bottom: 5ex; ">{{Main heading|{{#var:pubtitle}}}}
<h5>{{#arraymap:{{#var:AuthorList|}}|;|@@@|<span class="lang-de">[[@@@]]</span><span class="lang-en">[[@@@/en|@@@]]</span>|,  }}</h5>
</div><div class="row">

<div class="col-sm-4 col-md-3">
<div style="max-width: 230px; ">
<div style="margin-left: auto; margin-right: auto; width: 180px;">[[{{#setmainimage:{{#ifeq:{{{Bild|}}}|
|{{#ifeq:{{{Download|}}}||Bild:Missing_document_icon.png|Bild:{{{Download}}}{{!}}class=shadow}}
|Bild:{{{Bild}}}
}}}}|150px|link={{#ifeq:{{{Download|}}}||{{{Link|}}}|{{filepath:{{{Download}}}}}}}|frameless|{{#var:pubtitle}}]]
{{#ifeq:{{{Slides|}}}|||<br/>[[Bild:{{{Slides}}}{{!}}class=shadow|150px|link={{filepath:{{{Slides}}}}}|frameless|Slides: {{#var:pubtitle}}]]}}


{{#ifeq:{{{ISBN|}}}{{{ISSN|}}}{{{Download|}}}{{{Slides|}}}{{{DOI Name|}}}|||
<ul class="plain-list" style="margin-top: 2ex; ">
{{#ifeq: {{{ISBN|}}}|||<li>ISBN: {{{ISBN}}}</li>
}}{{#ifeq: {{{ISSN|}}}|||<li>ISSN: {{{ISSN|}}}</li>
}}{{#ifeq: {{{Download|}}}|||<li>[[Media:{{{Download}}}|Download]]</li>
}}{{#ifeq: {{{Slides|}}}|||<li>[[Media:{{{Slides}}}|Slides]]</li>
}}{{#ifeq: {{{DOI Name|}}}|||<li>[http://dx.doi.org/{{{DOI Name|}}} DOI Link]</li>}}
</ul>
}}
</div>
</div>
</div><div class="col-sm-8 col-md-9">{{#var:pubtext}}{{#maketabs:{{MediaWiki:Portal_label_Details{{{L|}}}}} =<div style="margin-top: 0ex; "><ul class="plain-list" style="margin-top: 2ex; ">{{#ifeq: {{{Abstract|}}}|||<li><span class="lang-de">'''Kurzfassung'''</span><span class="lang-en">'''Abstract'''</span><br/>{{{Abstract}}}</li><li></li>}}{{#ifeq: {{#var:note}}|||<li><span class="lang-de">'''Bemerkung:''' </span><span class="lang-en">'''Note:''' </span> {{#var:note}}</li><li></li>}}{{#ifeq: {{{Link|}}}|||<li><span class="lang-de">'''Weitere Informationen unter:'''</span><span class="lang-en">'''Further Information:'''</span> {{#arraymap:{{{Link|}}}|, |x|[[Link::x|Link]]|, }}</li><li></li>}}{{#ifeq: {{{Projekt|}}}|||<li><span class="lang-de">'''Projekt:'''</span><span class="lang-en">'''Project:'''</span> {{#arraymap:{{{Projekt|}}}|, |x|[[Projekt::x]] |, }} </li><li></li>}}{{#ifeq: {{#ask: [[{{PAGENAME}}]] [[Tool::+]] | ?Tool | format=count}}|0||<li><span class="lang-de">'''Verknüpfte Tools:'''</span><span class="lang-en">'''Related Tools:'''</span> {{#ask: [[{{PAGENAME}}]] | ?Tool | format=plainlist | mainlabel=- | headers=hide}}</li><li></li>}}{{#ifeq: {{#ask: [[{{PAGENAME}}]] [[Data::+]] | ?Data | mainlabel=- | format=count}}|0||<li><span class="lang-de">'''Verknüpfte Datasets:'''</span><span class="lang-en">'''Related Datasets:'''</span> {{#ask: [[{{PAGENAME}}]] | ?Data | format=plainlist | mainlabel=- | headers=hide}}</li><li></li>}}{{#ifeq: {{{Forschungsgruppe|}}}|||<li><span class="lang-de">'''Forschungsgruppe:'''</span><span class="lang-en">'''Research Group:'''</span> {{#arraymap:{{{Forschungsgruppe|}}}|, |x|<span class="lang-de">[[Forschungsgruppe::x]]</span><span class="lang-en">[[x/en|{{#show: x| ?Name EN| default=x}}]]</span> |, }}</li><li></li>}}</ul>{{#ifeq:{{#var:publisher}}|Springer
|The final publication is available at Springer{{#ifeq:{{{DOI Name|}}}||.| via [http://dx.doi.org/{{{DOI Name|}}} http://dx.doi.org/{{{DOI Name|}}}].}}
|
}}{{#set:
| Abstract={{{Abstract|}}}
| publication text={{#var:pubtext}}<br/><span class="fas fa-chevron-right" style="font-size: 85%;" ></span> [[{{PAGENAME}}|Details]] {{#ifeq: {{{Download|}}}|||<span class="fas fa-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:{{{Download}}}|Download]]}}
| publication text en={{#var:pubtext en}}<br/><span class="fas fa-chevron-right" style="font-size: 85%;" ></span> [[{{PAGENAME}}|Details]] {{#ifeq: {{{Download|}}}|||<span class="fas fa-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:{{{Download}}}|Download]]}}
| DOI Name={{{DOI Name|}}}
}}
</div>
|{{MediaWiki:Portal_label_Bibtex{{{L|}}} }}={{#vardefine:monthEN|{{Translate month
|{{#var:month}}
|#userparam=/en}}
}}<div style="font-size: 90%; ">{{#ifeq:{{{BibTex|}}}|
|{{#makebibtex:{{#var:type}}
|author={{#arraymap: {{#var:AuthorList}}|;|@@@|@@@| and }}
|title={{#var:pubtitle}}
|editor={{#arraymap: {{#var:editor}}|, |@@@|@@@| and }}
|booktitle={{#var:booktitle}}
|journal={{#var:journal}}
|series={{#var:series}}
|volume={{#var:volume}}
|number={{#var:number}}
|edition={{#var:edition}}
|publisher={{#var:publisher}}
|institution={{#var:institution}}
|school={{#var:school}}
|date={{#var:date}}
|year={{#var:year}}
|month={{#var:monthEN}}
|pages={{#var:pages}}
|doi={{{DOI Name|}}}
|isbn={{{ISBN|}}}
|issn={{{ISSN|}}}
}}
|{{#bibtex: {{#replace: {{#replace:{{{BibTex}}}|{ {|{{Opening double brace}}}}|} }|{{Closing double brace}}}}}}
}}</div>
}}
</div>
</div>{{#ifeq:{{{BibTex|}}}|
|{{#set:BibTex={{#makebibtex:{{#var:type}}
|author={{#arraymap: {{#var:AuthorList}}|;|@@@|@@@| and }}
|title={{#var:pubtitle}}
|editor={{#arraymap: {{#var:editor}}|, |@@@|@@@| and }}
|booktitle={{#var:booktitle}}
|journal={{#var:journal}}
|series={{#var:series}}
|volume={{#var:volume}}
|number={{#var:number}}
|edition={{#var:edition}}
|publisher={{#var:publisher}}
|institution={{#var:institution}}
|school={{#var:school}}
|date={{#var:date}}
|year={{#var:year}}
|month={{#var:monthEN}}
|pages={{#var:pages}}
|doi={{{DOI Name|}}}
|isbn={{{ISBN|}}}
|issn={{{ISSN|}}}
|highlight=none}}
}}
|{{#set:BibTex={{#replace: {{#replace:{{{BibTex}}}|{ {|{{Opening double brace}}}}|} }|{{Closing double brace}}}}}}
}}
}}[[Kategorie:Publikation]]</includeonly>

Knowledge Graphs (WS2025)

2026-02-01T02:25:09Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.
* for CMS-COR-KM, there will be a written exam on '''Thursday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]].

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This will be a written exam on '''Thursday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]]. 



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
|Download=KG2025-Lecture-10-overlay.pdf, KG2025-Lecture-10-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
|Download=KG2025-Lecture-11-overlay.pdf, KG2025-Lecture-11-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
|Download=kg2025-exercise-09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. Knowledge Graph Quality
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
|Download=KG2025-Lecture-12-overlay.pdf, KG2025-Lecture-12-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. Datalog and OWL
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
|Download=kg2025-exercise-10.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. Knowledge Graph Quality / Summary
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
|Download=KG2025-Lecture-13-overlay.pdf, KG2025-Lecture-13-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. Knowledge Graph Quality and Validation
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
|Download=kg2025-exercise-11.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. More OWL & Datalog
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
|Download=kg2025-exercise-12.pdf
}}

Datei:Kg2025-exercise-12.pdf

2026-02-01T02:25:06Z

Maximilian Marx:

Knowledge Graphs (WS2025)

2026-01-27T13:17:36Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.
* for CMS-COR-KM, there will be a written exam on '''Thursday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]].

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This will be a written exam on '''Thursday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]]. 



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
|Download=KG2025-Lecture-10-overlay.pdf, KG2025-Lecture-10-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
|Download=KG2025-Lecture-11-overlay.pdf, KG2025-Lecture-11-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
|Download=kg2025-exercise-09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. Knowledge Graph Quality
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
|Download=KG2025-Lecture-12-overlay.pdf, KG2025-Lecture-12-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. Datalog and OWL
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
|Download=kg2025-exercise-10.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. Knowledge Graph Quality / Summary
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
|Download=KG2025-Lecture-13-overlay.pdf, KG2025-Lecture-13-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. Knowledge Graph Quality and Validation
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
|Download=kg2025-exercise-11.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. TBA
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
}}

HÜL S386

2026-01-27T13:16:30Z

Maximilian Marx: Die Seite wurde neu angelegt: „{{Raum |Navigator URL=http://navigator.tu-dresden.de/etplan/hül/03/raum/145403.0460 }}“

{{Raum
|Navigator URL=http://navigator.tu-dresden.de/etplan/hül/03/raum/145403.0460
}}

Knowledge Graphs (WS2025)

2026-01-27T13:15:14Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.
* for CMS-COR-KM, there will be a written exam on '''Thusrday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]].

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This will be a written exam on '''Thusrday, 2026-03-05, DS2 (09:30–11:00)''' in room [[HÜL S386]]. 



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
|Download=KG2025-Lecture-10-overlay.pdf, KG2025-Lecture-10-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
|Download=KG2025-Lecture-11-overlay.pdf, KG2025-Lecture-11-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
|Download=kg2025-exercise-09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. Knowledge Graph Quality
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
|Download=KG2025-Lecture-12-overlay.pdf, KG2025-Lecture-12-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. Datalog and OWL
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
|Download=kg2025-exercise-10.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. Knowledge Graph Quality / Summary
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
|Download=KG2025-Lecture-13-overlay.pdf, KG2025-Lecture-13-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. Knowledge Graph Quality and Validation
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
|Download=kg2025-exercise-11.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. TBA
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
}}

Knowledge Graphs (WS2025)

2026-01-23T21:49:51Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This exam is either written or oral, depending on the number of registered students (as per the study regulations). We can announce the actual mode only at the end of the exam registration period.



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
|Download=KG2025-Lecture-10-overlay.pdf, KG2025-Lecture-10-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
|Download=KG2025-Lecture-11-overlay.pdf, KG2025-Lecture-11-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
|Download=kg2025-exercise-09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. Knowledge Graph Quality
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
|Download=KG2025-Lecture-12-overlay.pdf, KG2025-Lecture-12-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. Datalog and OWL
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
|Download=kg2025-exercise-10.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. TBA
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. Knowledge Graph Quality and Validation
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
|Download=kg2025-exercise-11.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. TBA
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
}}

Datei:Kg2025-exercise-11.pdf

2026-01-23T21:49:47Z

Maximilian Marx:

Knowledge Graphs (WS2025)

2026-01-15T17:41:43Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This exam is either written or oral, depending on the number of registered students (as per the study regulations). We can announce the actual mode only at the end of the exam registration period.



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
|Download=KG2025-Lecture-10-overlay.pdf, KG2025-Lecture-10-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
|Download=kg2025-exercise-09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. TBA
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. Datalog and OWL
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
|Download=kg2025-exercise-10.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. TBA
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. TBA
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. TBA
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
}}

Datei:Kg2025-exercise-10.pdf

2026-01-15T17:41:38Z

Maximilian Marx:

Knowledge Graphs (WS2025)

2026-01-07T17:31:28Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This exam is either written or oral, depending on the number of registered students (as per the study regulations). We can announce the actual mode only at the end of the exam registration period.



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. Ontologies for Knowledge Graphs
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
|Download=KG2025-Lecture-10-overlay.pdf, KG2025-Lecture-10-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. Ontology-Based Query Answering
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. SPARQL and OWL
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
|Download=kg2025-exercise-09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. TBA
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. TBA
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. TBA
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. TBA
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. TBA
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
}}

Datei:Kg2025-exercise-09.pdf

2026-01-07T17:31:23Z

Maximilian Marx:

Datei:Kg2025-exercise-08.pdf

2026-01-07T09:08:06Z

Maximilian Marx: Maximilian Marx lud eine neue Version von Datei:Kg2025-exercise-08.pdf hoch

Veröffentlichungen/en

2026-01-02T00:40:37Z

Maximilian Marx: Weiterleitungsziel von Veröffentlichungen/2025/en nach Veröffentlichungen/2026/en geändert

#REDIRECT [[Veröffentlichungen/2026/en]]

Veröffentlichungen

2026-01-02T00:40:28Z

Maximilian Marx: Weiterleitungsziel von Veröffentlichungen/2025 nach Veröffentlichungen/2026 geändert

#REDIRECT [[Veröffentlichungen/2026]]

Veröffentlichungen/2026/en

2025-12-31T21:53:13Z

Maximilian Marx: Die Seite wurde neu angelegt: „{{Wiki Seite Veröffentlichungen nach Jahr|langsuffix=/en|year={{#titleparts:{{PAGENAME}}|-1|-2}}}}“

{{Wiki Seite Veröffentlichungen nach Jahr|langsuffix=/en|year={{#titleparts:{{PAGENAME}}|-1|-2}}}}

Veröffentlichungen/2026

2025-12-31T21:52:55Z

Maximilian Marx: Die Seite wurde neu angelegt: „{{Wiki Seite Veröffentlichungen nach Jahr|year={{#titleparts:{{PAGENAME}}||-1}}}}“

{{Wiki Seite Veröffentlichungen nach Jahr|year={{#titleparts:{{PAGENAME}}||-1}}}}

Knowledge Graphs (WS2025)

2025-12-17T14:06:53Z

Maximilian Marx:

{{Vorlesung
|Title=Knowledge Graphs
|Research group=Wissensbasierte Systeme
|Lecturers=Markus Krötzsch
|Tutors=Maximilian Marx
|Term=WS
|Year=2025
|Lecture series=Knowledge Graphs
|Matrix=#kg2025:tu-dresden.de
|Module=CMS-COR-KM, INF-25-MA-FTK-KM, INF-B510, INF-B520, INF-BAS2, INF-BAS6, INF-E-3, INF-PM-ANW, INF-PM-FOR, INF-VERT2, INF-VERT6, MCL-KR, MCL-TCSL
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=Klausur, mündliche Prüfung
|Description====News===
* we offer oral exams in Winter 2025/2026 (see below). Please contact [[Kati Domann]] to schedule your oral exam.

* the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room [[BAR 106]]
* the first exercise will take place on '''Wednesday, 2025-10-22, DS4 (13:00–14:30)''' in room [[N63 A001]]
* please check this page regularly for updates of the schedule
* additional materials (example data, solutions to programming exercises) are available on a [https://github.com/knowsys/Course-Knowledge-Graphs/ GitHub repository]

===Contents===
Knowledge graphs are becoming an important paradigm in industry and research, with applications including prominent examples such as Google's own Knowledge Graph, Wikipedia's knowledge base sister [[Wikidata/en|Wikidata]], and numerous artificial intelligence projects from Alexa to Siri. Meanwhile, companies are exploring the use of their own enterprise knowledge graphs for improving internal knowledge management.

With so many facets, knowledge graphs are a cross-cutting topic in computer science that involves aspects of data management (graph databases, file formats), publication (exchange formats, data integration), knowledge organisation (constraints, ontologies), and advanced analytics (expressive query languages, graph data mining). On each of these levels, there is some interesting theory and some interesting technology to be learned. This course will cover a colourful mix of technologies and methods related to the use of graphs for data analysis, knowledge representation, and data management.

===Registration===

The course generally does not require a special registration and there is no limit for participants. However, you will need to register in Selma for the appropriate module to obtain credits.
Most of the materials will be freely available world-wide. Live sessions (especially tutorials) are restricted to students of TU Dresden.

===Examination Dates and Mode===

The registration and scheduling for exams depend on the module they are for. All students need to contact the [[Wissensbasierte_Systeme/en|KBS secretary]] to arrange time slots for their oral exams, or the secretary of another chair in the case of another main examiner. The preferred date for oral exams is ''2026-02-24''. Although we cannot generally accommodate wishes for specific dates, students with justified time constraints during the examination period can still let us know as early as possible.

To obtain credits in module '''CMS-COR-KM,''' students have to take an exam that only involves this one course. This exam is either written or oral, depending on the number of registered students (as per the study regulations). We can announce the actual mode only at the end of the exam registration period.



===Schedule and Location===
All dates are published on this page (see ''Dates & Materials'' above).
* Lectures: Thursdays, DS2 (09:20 to 10:50) in [[BAR 106]]
* Exercises: Wednesdays, DS4 (13:00 to 14:30) in [[N63 A001]]
* The first exercise sessions will be on '''Wednesday, 2025-10-22'''.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=1. Introduction and Welcome
|Room=BAR 106
|Date=2025-10-14
|DS=DS2
|Download=KG2025-Lecture-01-overlay.pdf, KG2025-Lecture-01-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=2. Representing Graphs with RDF
|Room=BAR 106
|Date=2025-10-21
|DS=DS2
|Download=KG2025-Lecture-02-overlay.pdf, KG2025-Lecture-02-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=0. Introduction to Python
|Room=N63 A001
|Date=2025-10-22
|DS=DS4
|Download=kg2025-exercise-00.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=3. Modelling in RDF / SPARQL Basics
|Room=BAR 106
|Date=2025-10-28
|DS=DS2
|Download=KG2025-Lecture-03-overlay.pdf, KG2025-Lecture-03-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=1. Getting to Know Graphs
|Room=N63 A001
|Date=2025-10-29
|DS=DS4
|Download=kg2025-exercise-01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=4. Wikidata
|Room=BAR 106
|Date=2025-11-04
|DS=DS2
|Download=KG2025-Lecture-04-overlay.pdf, KG2025-Lecture-04-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=2. Graphs and RDF
|Room=N63 A001
|Date=2025-11-05
|DS=DS4
|Download=kg2025-exercise-02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=5. Advanced Features of SPARQL
|Room=BAR 106
|Date=2025-11-11
|DS=DS2
|Download=KG2025-Lecture-05-overlay.pdf, KG2025-Lecture-05-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=3. SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-12
|DS=DS4
|Download=kg2025-exercise-03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=6. SPARQL Semantics
|Room=BAR 106
|Date=2025-11-18
|DS=DS2
|Download=KG2025-Lecture-06-overlay.pdf, KG2025-Lecture-06-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=Repentance and Prayer Day (public holiday)
|Room=N63 A001
|Date=2025-11-19
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=7. Datalog for Knowledge Graphs
|Room=BAR 106
|Date=2025-11-25
|DS=DS2
|Download=KG2025-Lecture-07-overlay.pdf, KG2025-Lecture-07-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=4. More SPARQL and Wikidata
|Room=N63 A001
|Date=2025-11-26
|DS=DS4
|Download=kg2025-exercise-04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=8. Advanced Datalog
|Room=BAR 106
|Date=2025-12-02
|DS=DS2
|Download=KG2025-Lecture-08-overlay.pdf, KG2025-Lecture-08-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=5. Datalog in Theory & Practice
|Room=N63 A001
|Date=2025-12-03
|DS=DS4
|Download=kg2025-exercise-05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=9. Complexity of SPARQL and Datalog (1)
|Room=BAR 106
|Date=2025-12-09
|DS=DS2
|Download=KG2025-Lecture-09-overlay.pdf, KG2025-Lecture-09-print.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=6. Advanced Datalog
|Room=N63 A001
|Date=2025-12-10
|DS=DS4
|Download=kg2025-exercise-06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=10. Complexity of SPARQL and Datalog (2)
|Room=BAR 106
|Date=2025-12-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=7. SPARQL Semantics & Wikidata
|Room=N63 A001
|Date=2025-12-17
|DS=DS4
|Download=kg2025-exercise-07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=11. TBA
|Room=BAR 106
|Date=2026-01-06
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=8. Advanced SPARQL
|Room=N63 A001
|Date=2026-01-07
|DS=DS4
|Download=kg2025-exercise-08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=12. TBA
|Room=BAR 106
|Date=2026-01-13
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=9. TBA
|Room=N63 A001
|Date=2026-01-14
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=13. TBA
|Room=BAR 106
|Date=2026-01-20
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=10. TBA
|Room=N63 A001
|Date=2026-01-21
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=14. TBA
|Room=BAR 106
|Date=2026-01-27
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=11. TBA
|Room=N63 A001
|Date=2026-01-28
|DS=DS4
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Konsultation
|Title=Consultation
|Room=BAR 106
|Date=2026-02-03
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=12. TBA
|Room=N63 A001
|Date=2026-02-04
|DS=DS4
}}