International Center for Computational Logic - Letzte Änderungen [de]

Inproceedings3475

Sebastian Rudolph — Mon, 10 Aug 2026 13:07:07 GMT

← Nächstältere Version		Version vom 10. August 2026, 13:07 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 8:		Zeile 8:
	\|To appear=1		\|To appear=1
	\|Year=2026		\|Year=2026
	\|Booktitle=Conceptual Knowledge Structures		\|Booktitle=The Third International Joint Conference on Conceptual Knowledge Structures (CONCEPTS 2026)
	\|Publisher=Springer		\|Publisher=Springer
			\|Editor=Madalina Croitoru, Domingo López-Rodríguez, Gerd Stumme
	\|Series=LNCS		\|Series=LNCS
	\|Volume=16811		\|Volume=16811

Inproceedings3476

Lukas Gerlach — Mon, 10 Aug 2026 06:12:07 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Julián |ErsterAutorNachname=Méndez |FurtherAuthors=Lukas Gerlach; Tobias Wieland; Alex Ivliev; Markus Krötzsch; Raimund Dachselt }} {{Inproceedings |Referiert=1 |Title=Evaluating a Visual Query Tracer and Builder for Learning Declarative Logic Programming |To appear=1 |Year=2026 |Booktitle=VIS 2026 }} {{Publikation Details |Abstract=Nemo Explain Visualizer (nev) is an interactive visual query tracer and bu…“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Julián
|ErsterAutorNachname=Méndez
|FurtherAuthors=Lukas Gerlach; Tobias Wieland; Alex Ivliev; Markus Krötzsch; Raimund Dachselt
}}
{{Inproceedings
|Referiert=1
|Title=Evaluating a Visual Query Tracer and Builder for Learning Declarative Logic Programming
|To appear=1
|Year=2026
|Booktitle=VIS 2026
}}
{{Publikation Details
|Abstract=Nemo Explain Visualizer (nev) is an interactive visual query tracer and builder for Nemo, a powerful Datalog reasoner with extended features. Our tools were developed with and for expert users. However, considering the lack of resources to learn Datalog and similar declarative logic programming languages, we conducted a qualitative user study to assess how our tools might help students. The study, interviewing 14 participants with varying levels of involvement with the content of a university course on knowledge graphs, revealed a very positive assessment of our tools, which strengthens the value of visual explanation tools beyond their intended use.
|Download=Nev-Short-Paper-VIS-2026.pdf
|Projekt=CPEC
|Forschungsgruppe=Wissensbasierte Systeme
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Regelbasiertes Schließen
}}

Datei:Nev-Short-Paper-VIS-2026.pdf

Lukas Gerlach — Mon, 10 Aug 2026 06:11:39 GMT

Lukas Gerlach lud Datei:Nev-Short-Paper-VIS-2026.pdf hoch

Neue Seite

TBA17

Meghna Bhadra — Sun, 09 Aug 2026 20:14:14 GMT

← Nächstältere Version		Version vom 9. August 2026, 20:14 Uhr
(3 dazwischenliegende Versionen derselben Benutzerin werden nicht angezeigt)
Zeile 1:		Zeile 1:
	{{Veranstaltung		{{Veranstaltung
	\|Titel DE=~~TBA~~		\|Titel DE=Logical Institutional and Narrative Dynamics
	\|Titel EN=~~TBA~~		\|Titel EN=Logical Institutional and Narrative Dynamics
	\|Beschreibung DE=~~TBA~~		\|Beschreibung DE=Human societies are full of heterogenous rule-based structures (norms and institutions) which coexist with each other temporally, but also evolve and transform over time under interaction, documented through primary sources. This presents a modelling challenge, since some generative social models (e.g. game-theoretic ones) compress textual data into simplified, temporally local theoretical assumptions while others use statistical learning over longer times but struggle to generate off-distribution outputs. Meanwhile decision-makers are increasingly interested in scenario models for fields such as privacy and systemic risks to democratic institutions. This student talk will present a proposal for a Master's thesis project, a generative agent-based model that is both data-driven and interactive in an interpretable way. The plan is to extract institutional transition dynamics from prosopographies - temporal KGs of named individuals. Additionally, agents would be equipped with personal narratives of rules and facts. Following the symbolic interactionism approach in sociology, these two elements will act as the rules and constraints under which the social KG evolves. Because all of these components can be expressed in one unified logical representation, the model can be tentatively used both to analyze documented structures (e.g. identifying communities via constraints) and generate counterfactuals to test hypotheses, without any encoding/decoding or collapse of concepts into scalars. Currently, similar work has been done to analyze privacy policies with ASP, but another consideration is Standpoint Logic.
	\|Beschreibung EN=~~TBA~~

			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
			\|Beschreibung EN=Human societies are full of heterogenous rule-based structures (norms and institutions) which coexist with each other temporally, but also evolve and transform over time under interaction, documented through primary sources. This presents a modelling challenge, since some generative social models (e.g. game-theoretic ones) compress textual data into simplified, temporally local theoretical assumptions while others use statistical learning over longer times but struggle to generate off-distribution outputs. Meanwhile decision-makers are increasingly interested in scenario models for fields such as privacy and systemic risks to democratic institutions. This student talk will present a proposal for a Master's thesis project, a generative agent-based model that is both data-driven and interactive in an interpretable way. The plan is to extract institutional transition dynamics from prosopographies - temporal KGs of named individuals. Additionally, agents would be equipped with personal narratives of rules and facts. Following the symbolic interactionism approach in sociology, these two elements will act as the rules and constraints under which the social KG evolves. Because all of these components can be expressed in one unified logical representation, the model can be tentatively used both to analyze documented structures (e.g. identifying communities via constraints) and generate counterfactuals to test hypotheses, without any encoding/decoding or collapse of concepts into scalars. Currently, similar work has been done to analyze privacy policies with ASP, but another consideration is Standpoint Logic.


			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
	\|Veranstaltungsart=Vortrag		\|Veranstaltungsart=Vortrag
	\|Start=2026-08-13 11:00:00		\|Start=2026-08-13 11:00:00

Inproceedings3475

Sebastian Rudolph — Wed, 05 Aug 2026 13:32:53 GMT

← Nächstältere Version		Version vom 5. August 2026, 13:32 Uhr
(3 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt)
Zeile 14:		Zeile 14:
	}}		}}
	{{Publikation Details		{{Publikation Details
	\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis – the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.		\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis – the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for "easy" ways to verify PCF.

	As the large language model Claude Opus 4.6 was instrumental in establishing the NP-hardness part, this paper also discusses the methodology applied and observations made in the process.		As the large language model Claude Opus 4.6 was instrumental in establishing the NP-hardness part, this paper also discusses the methodology applied and observations made in the process.
			\|Download=SR-Concepts2026.pdf
	\|Forschungsgruppe=Computational Logic		\|Forschungsgruppe=Computational Logic
	}}		}}

Datei:SR-Concepts2026.pdf

Sebastian Rudolph — Wed, 05 Aug 2026 00:11:42 GMT

Sebastian Rudolph lud Datei:SR-Concepts2026.pdf hoch

Neue Seite

Inproceedings3475

Sebastian Rudolph — Wed, 05 Aug 2026 00:10:23 GMT

← Nächstältere Version		Version vom 5. August 2026, 00:10 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 5:		Zeile 5:
	{{Inproceedings		{{Inproceedings
	\|Referiert=1		\|Referiert=1
	\|Title=Pseudo-Closed Family ~~Veri�fication~~ is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)		\|Title=Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)
	\|To appear=1		\|To appear=1
	\|Year=2026		\|Year=2026
Zeile 14:		Zeile 14:
	}}		}}
	{{Publikation Details		{{Publikation Details
	\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis -- the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.		\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis – the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.

	As the large language model Claude Opus 4.6 was instrumental in establishing the ~~\textsc{~~NP}-hardness part, this paper also discusses the methodology applied and observations made in the process.		As the large language model Claude Opus 4.6 was instrumental in establishing the NP-hardness part, this paper also discusses the methodology applied and observations made in the process.
	\|Forschungsgruppe=Computational Logic		\|Forschungsgruppe=Computational Logic
	}}		}}

Inproceedings3475

Sebastian Rudolph — Wed, 05 Aug 2026 00:09:21 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Sebastian |ErsterAutorNachname=Rudolph }} {{Inproceedings |Referiert=1 |Title=Pseudo-Closed Family Veri�fication is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) |To appear=1 |Year=2026 |Booktitle=Conceptual Knowledge Structures |Publisher=Springer |Series=LNCS |Volume=16811 }} {{Publikation Details |Abstract=Every closure operator on a finite set admits a canonical minimum implication bas…“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Sebastian
|ErsterAutorNachname=Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=Pseudo-Closed Family Veri�fication is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)
|To appear=1
|Year=2026
|Booktitle=Conceptual Knowledge Structures
|Publisher=Springer
|Series=LNCS
|Volume=16811
}}
{{Publikation Details
|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis -- the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.

As the large language model Claude Opus 4.6 was instrumental in establishing the \textsc{NP}-hardness part, this paper also discusses the methodology applied and observations made in the process.
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Formale Begriffsanalyse
}}

Datei:ESWC2026-sparqling-datalog.pdf

Alex Ivliev — Tue, 04 Aug 2026 13:05:07 GMT

Alex Ivliev lud eine neue Version von Datei:ESWC2026-sparqling-datalog.pdf hoch Paper titled "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at ESWC 2026

Neue Seite

Full version of the paper "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at the European Semantic Web Conference 2026

Datei:ESWC2026-sparqling-datalog.pdf

Alex Ivliev — Tue, 04 Aug 2026 13:03:35 GMT

Alex Ivliev lud eine neue Version von Datei:ESWC2026-sparqling-datalog.pdf hoch Paper titled "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at ESWC 2026

Neue Seite

Full version of the paper "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at the European Semantic Web Conference 2026

Datei:2608.00698.pdf

Martin Diller — Tue, 04 Aug 2026 10:00:04 GMT

Martin Diller lud Datei:2608.00698.pdf hoch

Neue Seite

TBA15

Meghna Bhadra — Mon, 03 Aug 2026 08:38:24 GMT

← Nächstältere Version		Version vom 3. August 2026, 08:38 Uhr
(Eine dazwischenliegende Version derselben Benutzerin wird nicht angezeigt)
Zeile 1:		Zeile 1:
	{{Veranstaltung		{{Veranstaltung
	\|Titel DE=~~TBA~~		\|Titel DE=SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
	\|Titel EN=~~TBA~~		\|Titel EN=SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
	\|Beschreibung DE=~~TBA~~		\|Beschreibung DE=The talk will propose a new integration of rule reasoners with one or more RDF stores, using selective SPARQL queries to fetch relevant data. In contrast to previous implementations that merely import results of fixed SPARQL queries, the proposed approach relies on pure logic programs over RDF triple data. Transparent to the user, optimised SPARQL queries then are constructed and evaluated during reasoning. To ensure good performance, the approach develops optimisation methods that adopt ideas from logic program optimisation, including semi-naive evaluation, magic sets, and static filtering. Based on the integration of the methods into the open source rule engine Nemo, the talk will empirically evaluate the approach with complex rule sets over large knowledge graphs.
	\|Beschreibung EN=~~TBA~~		The talk has been presented at ESWC 2026.


			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
			\|Beschreibung EN=The talk will propose a new integration of rule reasoners with one or more RDF stores, using selective SPARQL queries to fetch relevant data. In contrast to previous implementations that merely import results of fixed SPARQL queries, the proposed approach relies on pure logic programs over RDF triple data. Transparent to the user, optimised SPARQL queries then are constructed and evaluated during reasoning. To ensure good performance, the approach develops optimisation methods that adopt ideas from logic program optimisation, including semi-naive evaluation, magic sets, and static filtering. Based on the integration of the methods into the open source rule engine Nemo, the talk will empirically evaluate the approach with complex rule sets over large knowledge graphs.
			The talk has been presented at ESWC 2026.


			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
	\|Veranstaltungsart=Vortrag		\|Veranstaltungsart=Vortrag
	\|Start=2026-08-06 11:00:00		\|Start=2026-08-06 11:00:00

Sebastian Rudolph

Sebastian Rudolph — Sat, 01 Aug 2026 12:55:05 GMT

← Nächstältere Version		Version vom 1. August 2026, 12:55 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 12:		Zeile 12:
	\|Raum=APB 2035		\|Raum=APB 2035
	\|Bild=SR2019-webseite.png		\|Bild=SR2019-webseite.png
	\|Info=Ich bin seit April 2013 Professor für [[Computational Logic]] am [https://tu-dresden.de/ing/informatik/ki Institut für Künstliche Intelligenz] der [http://inf.tu-dresden.de Fakultät Informatik] der [https://tu-dresden.de Technischen Universität Dresden], seit 2021 auch Zweitmitglied der [https://tu-dresden.de/mn/math Fakultät Mathematik]. Meine Forschungsinteressen umfassen Künstliche Intelligenz, insbesondere [[Wissensrepräsentation und logisches Schließen]] mithilfe diverser Formalismen (u.a. [[Beschreibungslogiken]], [[Existenzielle Regeln]] und [[Formale Begriffsanalyse]]) und ihren Anwendungen beispielsweise im Bereich [[Semantische Technologien\|Semantischer Technologien]]. Dabei befasse ich mich mit Fragestellungen die von den theoretischen Grundlagen (z.B. Entscheidbarkeit und Komplexität von Inferenzproblemen) bis hin zum praktischen Einsatz (Ontologiemodellierung, interaktive Wissensakquise) reichen. 2017 erhielt ich ein [[News34\|ERC Consolidator Grant]], im Rahmen dessen ich mich mit allgemeinen Prinzipien der Entscheidbarkeit in der logikbasierten Wissensrepräsentation ~~befasse~~.		\|Info=Ich bin seit April 2013 Professor für [[Computational Logic]] am [https://tu-dresden.de/ing/informatik/ki Institut für Künstliche Intelligenz] der [http://inf.tu-dresden.de Fakultät Informatik] der [https://tu-dresden.de Technischen Universität Dresden], seit 2021 auch Zweitmitglied der [https://tu-dresden.de/mn/math Fakultät Mathematik]. Meine Forschungsinteressen umfassen Künstliche Intelligenz, insbesondere [[Wissensrepräsentation und logisches Schließen]] mithilfe diverser Formalismen (u.a. [[Beschreibungslogiken]], [[Existenzielle Regeln]] und [[Formale Begriffsanalyse]]) und ihren Anwendungen beispielsweise im Bereich [[Semantische Technologien\|Semantischer Technologien]]. Dabei befasse ich mich mit Fragestellungen die von den theoretischen Grundlagen (z.B. Entscheidbarkeit und Komplexität von Inferenzproblemen) bis hin zum praktischen Einsatz (Ontologiemodellierung, interaktive Wissensakquise) reichen. 2017 erhielt ich ein [[News34\|ERC Consolidator Grant]], im Rahmen dessen ich mich mit allgemeinen Prinzipien der Entscheidbarkeit in der logikbasierten Wissensrepräsentation befasste.

			Ich bin Principal Investigator im [[ScaDS.AI\|Center for Scalable Data Analytics and Artificial Intelligence Dresden/Leipzig (ScaDS.AI)]], Academic Fellow und Steering Group Member in der [[SECAI\|School of Embedded Composite Artificial Intelligence (SECAI)]] und Mitglied des [[CPEC\|Center for Perspicuous Computing (CPEC)]].

	Vor meiner Rückkehr nach Dresden war ich von 2006 bis 2013 als Postdoktorand, Projektleiter und später Privatdozent in [http://de.wikipedia.org/wiki/Rudi_Studer Rudi Studer]s [http://www.aifb.kit.edu/web/Wissensmanagement Gruppe für Wissensmanagement] am [http://www.aifb.kit.edu/web/Hauptseite Institut für Angewandte Informatik und Formale Beschreibungsverfahren] des [http://www.kit.edu Karlsruher Instituts für Technologie], wo ich 2011 die venia legendi erhielt. Meine Promotion in Algebra und mein Lehramtsstudium für Mathematik, Physik und Informatik absolvierte ich an der [http://tu-dresden.de TU Dresden].		Vor meiner Rückkehr nach Dresden war ich von 2006 bis 2013 als Postdoktorand, Projektleiter und später Privatdozent in [http://de.wikipedia.org/wiki/Rudi_Studer Rudi Studer]s [http://www.aifb.kit.edu/web/Wissensmanagement Gruppe für Wissensmanagement] am [http://www.aifb.kit.edu/web/Hauptseite Institut für Angewandte Informatik und Formale Beschreibungsverfahren] des [http://www.kit.edu Karlsruher Instituts für Technologie], wo ich 2011 die venia legendi erhielt. Meine Promotion in Algebra und mein Lehramtsstudium für Mathematik, Physik und Informatik absolvierte ich an der [http://tu-dresden.de TU Dresden].
	\|Info EN=Since April 2013, I have been full professor for [[Computational Logic/en\|Computational Logic]] at the [https://tu-dresden.de/ing/informatik/ki?set_language=en Institute for Artificial Intelligence] at the [http://inf.tu-dresden.de/portal.php?node_id=1&ln=en&group=13 Faculty of Computer Science] of [http://tu-dresden.de/en Technische Universität Dresden], since 2021 affiliated member of the [https://tu-dresden.de/mn/math Faculty of Mathematics]. My research interests comprise Artificial Intelligence, in particular [[Wissensrepräsentation und logisches Schließen/en\|Knowledge Representation and Reasoning]] using diverse formalisms (such as [[Beschreibungslogiken/en\|Description Logics]], [[Existenzielle Regeln/en\|Existential Rules]] and [[Formale Begriffsanalyse/en\|Formal Concept Analysis]]) and their applications in diverse areas, for instance [[Semantische Technologien/en\|Semantic Technologies]]. I deal with problems ranging from theoretical foundations (e.g., decidability and complexity of reasoning tasks) to practical deployment (ontology modeling, interactive knowledge acquisition). In 2017, I received an [[News34/en\|ERC Consolidator Grant]] for investigating general principles of decidability in logic-based knowledge representation.		\|Info EN=Since April 2013, I have been full professor for [[Computational Logic/en\|Computational Logic]] at the [https://tu-dresden.de/ing/informatik/ki?set_language=en Institute for Artificial Intelligence] at the [http://inf.tu-dresden.de/portal.php?node_id=1&ln=en&group=13 Faculty of Computer Science] of [http://tu-dresden.de/en Technische Universität Dresden], since 2021 affiliated member of the [https://tu-dresden.de/mn/math Faculty of Mathematics]. My research interests comprise Artificial Intelligence, in particular [[Wissensrepräsentation und logisches Schließen/en\|Knowledge Representation and Reasoning]] using diverse formalisms (such as [[Beschreibungslogiken/en\|Description Logics]], [[Existenzielle Regeln/en\|Existential Rules]] and [[Formale Begriffsanalyse/en\|Formal Concept Analysis]]) and their applications in diverse areas, for instance [[Semantische Technologien/en\|Semantic Technologies]]. I deal with problems ranging from theoretical foundations (e.g., decidability and complexity of reasoning tasks) to practical deployment (ontology modeling, interactive knowledge acquisition). In 2017, I received an [[News34/en\|ERC Consolidator Grant]] for investigating general principles of decidability in logic-based knowledge representation.

			I am principal investigator in the [[ScaDS.AI\|Center for Scalable Data Analytics and Artificial Intelligence Dresden/Leipzig (ScaDS.AI)]], academic fellow und steering group member in the [[SECAI\|School of Embedded Composite Artificial Intelligence (SECAI)]], and member of the [[CPEC\|Center for Perspicuous Computing (CPEC)]].

	Before returning to Dresden, I spend the years 2006 to 2013 as a postdoctoral researcher, project leader and later Privatdozent in [http://en.wikipedia.org/wiki/Rudi_Studer Rudi Studer]'s [http://www.aifb.kit.edu/web/Wissensmanagement/en Knowledge Management group] at the [http://www.aifb.kit.edu/web/Hauptseite/en Institute AIFB] of the [http://www.kit.edu/english/index.php Karlsruhe Institute of Technology], where I obtained my habilitation in 2011. Before I had completed my PhD in Algebra and my studies for highschool teaching in mathematics, physics and computer science at the [http://tu-dresden.de/en TU Dresden].		Before returning to Dresden, I spend the years 2006 to 2013 as a postdoctoral researcher, project leader and later Privatdozent in [http://en.wikipedia.org/wiki/Rudi_Studer Rudi Studer]'s [http://www.aifb.kit.edu/web/Wissensmanagement/en Knowledge Management group] at the [http://www.aifb.kit.edu/web/Hauptseite/en Institute AIFB] of the [http://www.kit.edu/english/index.php Karlsruhe Institute of Technology], where I obtained my habilitation in 2011. Before I had completed my PhD in Algebra and my studies for highschool teaching in mathematics, physics and computer science at the [http://tu-dresden.de/en TU Dresden].

Inproceedings3474

Alex Ivliev — Fri, 31 Jul 2026 17:46:56 GMT

← Nächstältere Version		Version vom 31. Juli 2026, 17:46 Uhr
(3 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt)
Zeile 10:		Zeile 10:
	\|Year=2026		\|Year=2026
	\|Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026)		\|Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026)
			\|Editor=Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto Jimenez Ruiz, Oshani Seneviratne, Lora Aroyo, Gianluca Demartini, Reham Alharbi, Roberto Barile, Claudia d'Amato, And Valentina Tamma
	}}		}}
	{{Publikation Details		{{Publikation Details
			\|Abstract=Datalog rules are often used to define ontologies over Knowledge Graphs. Rule reasoners routinely optimise such ontologies by rewriting their rules into a form that can be evaluated more efficiently. These transformations preserve the entailed facts, but not the structure of the underlying derivations. A proof tree under the rewritten rules explains why a fact holds, but does not readily yield an explanation in terms of the original rules. We study the problem of constructing, from a proof of entailment under the rewritten rules, a proof under the original ones: we establish its computational complexity and identify two practically relevant languages for specifying proof transformations.
			\|Download=ISWC26-datalog-transformations.pdf
	\|Projekt=CPEC, SECAI, ScaDS.AI		\|Projekt=CPEC, SECAI, ScaDS.AI
	\|Forschungsgruppe=Wissensbasierte Systeme		\|Forschungsgruppe=Wissensbasierte Systeme
	}}		}}

Datei:ISWC26-datalog-transformations.pdf

Alex Ivliev — Fri, 31 Jul 2026 17:44:14 GMT

Alex Ivliev lud Datei:ISWC26-datalog-transformations.pdf hoch Full paper "Recovering Explanations from Transformed Rule-Based Ontologies" published at ISWC'26

Neue Seite

Full paper "Recovering Explanations from Transformed Rule-Based Ontologies" published at ISWC'26

Larry González

Maximilian Marx — Thu, 30 Jul 2026 12:00:56 GMT

← Nächstältere Version		Version vom 30. Juli 2026, 12:00 Uhr
Zeile 5:		Zeile 5:
	\|Forschungsgruppe=Wissensbasierte Systeme		\|Forschungsgruppe=Wissensbasierte Systeme
	\|Stellung=Wissenschaftlicher Mitarbeiter		\|Stellung=Wissenschaftlicher Mitarbeiter
	\|Ehemaliger=0		\|Ehemaliger=1
	\|Telefon=+49 351 463 38043		\|Telefon=+49 351 463 38043
	\|Email=larry.gonzalez@tu-dresden.de		\|Email=larry.gonzalez@tu-dresden.de

CPEC

Sebastian Rudolph — Tue, 28 Jul 2026 14:40:52 GMT

← Nächstältere Version		Version vom 28. Juli 2026, 14:40 Uhr
Zeile 24:		Zeile 24:
	\|Projektstatus=aktiv		\|Projektstatus=aktiv
	\|Logo=CPEC-logo.png		\|Logo=CPEC-logo.png
	\|Person=Franz Baader, Christel Baier, Stefan Borgwardt, Markus Krötzsch, Ali Elhalawati, Irina Dragoste, Lukas Gerlach, Stephan Mennicke, Simon Razniewski		\|Person=Franz Baader, Christel Baier, Stefan Borgwardt, Markus Krötzsch, Ali Elhalawati, Irina Dragoste, Lukas Gerlach, Stephan Mennicke, Simon Razniewski, Sebastian Rudolph
	\|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik, Automatentheorie, Knowledge-aware Artificial Intelligence, Wissensbasierte Systeme		\|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik, Automatentheorie, Computational Logic, Knowledge-aware Artificial Intelligence, Wissensbasierte Systeme
	\|Partner=Universität des Saarlandes, Max-Planck-Institut für Softwaresysteme, Max-Planck-Institut für Informatik		\|Partner=Universität des Saarlandes, Max-Planck-Institut für Softwaresysteme, Max-Planck-Institut für Informatik
	}}		}}

TBA16

Meghna Bhadra — Sun, 26 Jul 2026 07:03:13 GMT

← Nächstältere Version		Version vom 26. Juli 2026, 07:03 Uhr
(Eine dazwischenliegende Version derselben Benutzerin wird nicht angezeigt)
Zeile 1:		Zeile 1:
	{{Veranstaltung		{{Veranstaltung
	\|Titel DE=~~TBA~~		\|Titel DE=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
	\|Titel EN=~~TBA~~		\|Titel EN=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
	\|Beschreibung DE=~~TBA~~		\|Beschreibung DE=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). This talk will present an endeavor of crafting a Lean framework around existential rules and the chase. It will discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, it will show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, it will unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.
	\|Beschreibung EN=~~TBA~~
			Talk also presented at the KR conference, in Lisbon, 2026.


			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
			\|Beschreibung EN=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). This talk will present an endeavor of crafting a Lean framework around existential rules and the chase. It will discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, it will show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, it will unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.

			Talk also presented at the KR conference, in Lisbon, 2026.


			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
	\|Veranstaltungsart=Vortrag		\|Veranstaltungsart=Vortrag
	\|Start=2026-07-30 11:00:00		\|Start=2026-07-30 11:00:00

Theoretische Informatik und Logik (SS2026)

Markus Krötzsch — Thu, 23 Jul 2026 09:34:44 GMT

← Nächstältere Version		Version vom 23. Juli 2026, 09:34 Uhr
Zeile 426:		Zeile 426:
	\|Date=2026-07-23		\|Date=2026-07-23
	\|DS=DS4		\|DS=DS4
			\|Download=TheoLog2026-Vorlesung-25-overlay.pdf, TheoLog2026-Vorlesung-25-print.pdf
	}}		}}
	{{Vorlesung Zeiten		{{Vorlesung Zeiten

Datei:TheoLog2026-Vorlesung-25-print.pdf

Markus Krötzsch — Thu, 23 Jul 2026 09:34:40 GMT

Markus Krötzsch lud Datei:TheoLog2026-Vorlesung-25-print.pdf hoch

Neue Seite

Datei:TheoLog2026-Vorlesung-25-overlay.pdf

Markus Krötzsch — Thu, 23 Jul 2026 09:34:32 GMT

Markus Krötzsch lud Datei:TheoLog2026-Vorlesung-25-overlay.pdf hoch

Neue Seite

Theoretische Informatik und Logik (SS2026)

Markus Krötzsch — Thu, 23 Jul 2026 08:01:09 GMT

← Nächstältere Version		Version vom 23. Juli 2026, 08:01 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 23:		Zeile 23:
	=== Nutzung von Z3 ===		=== Nutzung von Z3 ===

	Wir nutzen in dieser Vorlesung und den dazugehörigen Übungen ~~die~~ SMT-Solver [https://www.microsoft.com/en-us/research/project/z3-3/ Z3], der sich über ein [https://microsoft.github.io/z3guide/programming/Z3%20Python%20-%20Readonly/Introduction/#using-z3py-locally Python Binding] lokal nutzen lässt. Eine Beispielumgebung finden Sie unter [https://colab.research.google.com/drive/1H4Ek7uqI5qJzEzOMzfYxiuyMt21snUhk?usp=sharing Google Colab], die Sie sich herunterladen oder klonen können, um selbst damit weiterzuarbeiten.		Wir nutzen in dieser Vorlesung und den dazugehörigen Übungen den SMT-Solver [https://www.microsoft.com/en-us/research/project/z3-3/ Z3], der sich über ein [https://microsoft.github.io/z3guide/programming/Z3%20Python%20-%20Readonly/Introduction/#using-z3py-locally Python Binding] lokal nutzen lässt. Eine Beispielumgebung finden Sie unter [https://colab.research.google.com/drive/1H4Ek7uqI5qJzEzOMzfYxiuyMt21snUhk?usp=sharing Google Colab], die Sie sich herunterladen oder klonen können, um selbst damit weiterzuarbeiten.

			=== Nutzung von Nemo ===

			Wir nutzen in dieser Vorlesung und den dazugehörigen Übungen den Datalog-Reasoner [https://github.com/knowsys/nemo Nemo], der sich über [https://tools.iccl.inf.tu-dresden.de/nemo/ Nemo Web] direkt im Browser nutzen lässt.

	== Prüfung ==		== Prüfung ==
Zeile 35:		Zeile 39:

	=== Klausur: Zeit & Orte ===		=== Klausur: Zeit & Orte ===
	Die Klausur über 90 Minuten findet am '''Mittwoch, den 19.08.2024 um 8:00 Uhr''' statt. Uns stehen die Räume [[TRE/MATH/H]], [[TRE/PHYS/E]] und [[ZEU/LICH/H]] zur Verfügung. Wir beginnen mit dem '''Einlass''' an den jeweiligen Standorten '''um 7:45 Uhr'''. ~~Versuchen~~ Sie~~, möglichst~~ pünktlich ~~zu erscheinen~~, ~~damit~~ wir um 8:00 Uhr mit der Prüfung beginnen ~~können~~.		Die Klausur über 90 Minuten findet am '''Mittwoch, den 19.08.2024 um 8:00 Uhr''' statt. Uns stehen die Räume [[TRE/MATH/H]], [[TRE/PHYS/E]] und [[ZEU/LICH/H]] zur Verfügung. Wir beginnen mit dem '''Einlass''' an den jeweiligen Standorten '''um 7:45 Uhr'''. Erscheinen Sie pünktlich, da wir um 8:00 Uhr mit der Prüfung beginnen werden.

	Die Zuordnung zu den Räumen erfolgt nach dem Anfangsbuchstaben Ihres Nachnamens wie folgt:		Die Zuordnung zu den Räumen erfolgt nach dem Anfangsbuchstaben Ihres Nachnamens wie folgt:
Zeile 101:		Zeile 105:
	: ''(deutschsprachiger Standardtext; in der Tat ziemlich kurz gefasst)''		: ''(deutschsprachiger Standardtext; in der Tat ziemlich kurz gefasst)''
	* Michael Sipser: '''Introduction to the Theory of Computation.''' Cengage Learning.		* Michael Sipser: '''Introduction to the Theory of Computation.''' Cengage Learning.
	: ''(Standardtext zur Berechnung und Sprachen, speziell zum Thema Komplexität zu empfehlen~~; leider nur auf Englisch~~)''		: ''(Standardtext zur Berechnung und Sprachen, speziell zum Thema Komplexität zu empfehlen)''
	* Christopher Moore, Stephan ~~Meterns~~: '''The Nature of Computation.''' Oxford University Press.		* Christopher Moore, Stephan Mertens: '''The Nature of Computation.''' Oxford University Press.
	: ''(sehr guter, moderner Text zu Komplexität und Berechnung, weniger formell~~; leider nur auf Englisch~~)''		: ''(sehr guter, moderner Text zu Komplexität und Berechnung, weniger formell)''
	* John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: '''Einführung in Automatentheorie, Formale Sprachen und Berechenbarkeit.''' Pearson Studium.		* John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: '''Einführung in Automatentheorie, Formale Sprachen und Berechenbarkeit.''' Pearson Studium.
	: ''(aus dem Englischen übertragenes Standardwerk; Original ev. besser)''		: ''(aus dem Englischen übertragenes Standardwerk mit vertiefenden Themen; Original ev. besser)''

	=== Unterhaltung ===		=== Unterhaltung ===
Zeile 116:		Zeile 120:
	: ''(informeller Text (eigentlich eine Sammlung von Blogeinträgen) mit interessanten Denkanstößen rund um Berechnung und Komplexität)''		: ''(informeller Text (eigentlich eine Sammlung von Blogeinträgen) mit interessanten Denkanstößen rund um Berechnung und Komplexität)''
	* Douglas Hofstadter: '''Gödel, Escher, Bach: An Eternal Golden Braid.''' Basic Books		* Douglas Hofstadter: '''Gödel, Escher, Bach: An Eternal Golden Braid.''' Basic Books
	: ''(der Klassiker; in viele Sprachen übersetzt~~, aber im Original am besten~~)''		: ''(der Klassiker; in viele Sprachen übersetzt)''

	=== Berechnung und Komplexität ===		=== Berechnung und Komplexität ===
Zeile 142:		Zeile 146:
	=== Spezielle Themen ===		=== Spezielle Themen ===

			* Markus Krötzsch: ''''[[https://iccl.inf.tu-dresden.de/web/Inproceedings3435\|Modern Datalog: Concepts, Methods, Applications]].''' Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools. 2006.
			: ''(ausführliche Einführung in Datalog und verwandte Methoden und Erweiterungen)''
	* Torkel Franzén: ''''Gödel's Theorem: An Incomplete Guide to Its Use and Abuse.''' A K Peters.		* Torkel Franzén: ''''Gödel's Theorem: An Incomplete Guide to Its Use and Abuse.''' A K Peters.
	: ''(Gut verdaulicher Text zu Gödels Unvollständigkeitssätzen, einschl. deren Beziehungen zur Berechenbarkeitstheorie)''		: ''(Gut verdaulicher Text zu Gödels Unvollständigkeitssätzen, einschl. deren Beziehungen zur Berechenbarkeitstheorie)''

Datei:TheoLog2026-Probeklausur.pdf

Stephan Mennicke — Wed, 22 Jul 2026 08:24:17 GMT

Stephan Mennicke lud eine neue Version von Datei:TheoLog2026-Probeklausur.pdf hoch Lesefreundlicher Font

Neue Seite

Inproceedings3464

Lukas Gerlach — Tue, 21 Jul 2026 20:47:53 GMT

← Nächstältere Version		Version vom 21. Juli 2026, 20:47 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 6:		Zeile 6:
	\|Referiert=1		\|Referiert=1
	\|Title=The Chase in Lean - Crafting a Formal Library for Existential Rule Research		\|Title=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
	\|To appear=1		\|To appear=0
	\|Year=2026		\|Year=2026
	\|Booktitle=Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning		\|Booktitle=Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning
			\|Pages=346--356
			\|Publisher=IJCAI Organization
	\|Editor=Renata Wassermann, Marie-Laure Mugnier, Franz Baader		\|Editor=Renata Wassermann, Marie-Laure Mugnier, Franz Baader
	\|Series=Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning		\|Series=Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning
Zeile 15:		Zeile 17:
	{{Publikation Details		{{Publikation Details
	\|Abstract=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). In this work, we present our own endeavor of crafting a Lean framework around existential rules and the chase. We discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, we show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, we unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.		\|Abstract=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). In this work, we present our own endeavor of crafting a Lean framework around existential rules and the chase. We discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, we show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, we unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.
			\|ISBN=978-1-956792-18-8
			\|ISSN=2334-1033
	\|Download=KR-2026-Camera-Ready-178-Chase-In-Lean.pdf		\|Download=KR-2026-Camera-Ready-178-Chase-In-Lean.pdf
			\|Slides=2026-KR-Talk-Lukas-Gerlach.pdf
	\|Link=https://dmfa.dev/lean		\|Link=https://dmfa.dev/lean
			\|DOI Name=10.24963/kr.2026/33
	\|Projekt=CPEC, CeTI, SECAI, ScaDS.AI		\|Projekt=CPEC, CeTI, SECAI, ScaDS.AI
	\|Forschungsgruppe=Wissensbasierte Systeme		\|Forschungsgruppe=Wissensbasierte Systeme

Datei:2026-KR-Talk-Lukas-Gerlach.pdf

Lukas Gerlach — Tue, 21 Jul 2026 20:41:19 GMT

Lukas Gerlach lud Datei:2026-KR-Talk-Lukas-Gerlach.pdf hoch

Neue Seite

Theoretische Informatik und Logik (SS2026)

Stephan Mennicke — Tue, 21 Jul 2026 12:06:49 GMT

Probeklausur

← Nächstältere Version		Version vom 21. Juli 2026, 12:06 Uhr
Zeile 474:		Zeile 474:
	\|Date=2026-08-03		\|Date=2026-08-03
	\|DS=DS4		\|DS=DS4
			\|Download=TheoLog2026-Probeklausur.pdf
	}}		}}
	{{Vorlesung Zeiten		{{Vorlesung Zeiten

Datei:TheoLog2026-Probeklausur.pdf

Stephan Mennicke — Tue, 21 Jul 2026 12:06:39 GMT

Stephan Mennicke lud Datei:TheoLog2026-Probeklausur.pdf hoch

Neue Seite

Inproceedings3474

Alex Ivliev — Tue, 21 Jul 2026 10:33:11 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Alex |ErsterAutorNachname=Ivliev |FurtherAuthors=Markus Krötzsch; Maximilian Marx }} {{Inproceedings |Referiert=1 |Title=Recovering Explanations from Transformed Rule-Based Ontologies |To appear=1 |Year=2026 |Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026) }} {{Publikation Details |Projekt=CPEC, SECAI, ScaDS.AI |Forschungsgruppe=Wissensbasierte Systeme }}“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Alex
|ErsterAutorNachname=Ivliev
|FurtherAuthors=Markus Krötzsch; Maximilian Marx
}}
{{Inproceedings
|Referiert=1
|Title=Recovering Explanations from Transformed Rule-Based Ontologies
|To appear=1
|Year=2026
|Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026)
}}
{{Publikation Details
|Projekt=CPEC, SECAI, ScaDS.AI
|Forschungsgruppe=Wissensbasierte Systeme
}}

Algorithmic Game Theory (SS2026)

Hannes Straß — Mon, 20 Jul 2026 15:03:45 GMT

@@ Zeile 293: / Zeile 293: @@
 |DS=DS3
 |Download=AGT2026-13.pdf
 }}

Datei:AGT2026-Problems-12.pdf

Hannes Straß — Mon, 20 Jul 2026 15:03:37 GMT

Hannes Straß lud Datei:AGT2026-Problems-12.pdf hoch

Neue Seite

Inproceedings3472

Hannes Straß — Mon, 20 Jul 2026 11:15:59 GMT

← Nächstältere Version		Version vom 20. Juli 2026, 11:15 Uhr
Zeile 1:		Zeile 1:
	{{Publikation Erster Autor		{{Publikation Erster Autor
	\|ErsterAutorVorname=Hannes		\|ErsterAutorVorname=Hannes
	\|ErsterAutorNachname=~~Strass~~		\|ErsterAutorNachname=Straß
	\|FurtherAuthors=Johannes P. Wallner		\|FurtherAuthors=Johannes P. Wallner
	}}		}}

Inproceedings3473

Hannes Straß — Mon, 20 Jul 2026 11:15:19 GMT

← Nächstältere Version		Version vom 20. Juli 2026, 11:15 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 1:		Zeile 1:
	{{Publikation Erster Autor		{{Publikation Erster Autor
	\|ErsterAutorVorname=~~Hannes~~		\|ErsterAutorVorname=Iosif
	\|ErsterAutorNachname=~~Strass~~		\|ErsterAutorNachname=Apostolakis
	\|FurtherAuthors=Johannes P. Wallner		\|FurtherAuthors=Hannes Straß; Johannes P. Wallner
	}}		}}
	{{Inproceedings		{{Inproceedings

Theoretische Informatik und Logik (SS2026)

Markus Krötzsch — Mon, 20 Jul 2026 08:14:28 GMT

← Nächstältere Version		Version vom 20. Juli 2026, 08:14 Uhr
Zeile 412:		Zeile 412:
	\|Date=2026-07-20		\|Date=2026-07-20
	\|DS=DS3		\|DS=DS3
			\|Download=TheoLog2026-Vorlesung-24-overlay.pdf, TheoLog2026-Vorlesung-24-print.pdf
	}}		}}
	{{Vorlesung Zeiten		{{Vorlesung Zeiten