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

Introduction to Existential Rules (SS2026)

2026-05-17T17:00:40Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=CMS-LM-ADV, INF-25-MA-FTK-ASAI, INF-BAS2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 14:50-16:20 (DS 5) in room APB E005.
The lecture is scheduled for Mondays, 14:50-16:20 (DS 5) in room APB E005 on the dates indicated in the schedule.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2026-04-13
|DS=DS5
|Download=ER-Rudolph-Lecture01-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2026-04-20
|DS=DS5
|Download=ER-Rudolph-Lecture01-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2026-04-27
|DS=DS5
|Download=ER-Rudolph-Lecture02-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2026-05-04
|DS=DS5
|Download=ER-Rudolph-Lecture03-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2026-05-18
|DS=DS5
|Download=ER-Rudolph-Lecture04-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026-06-01
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026-06-22
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026-06-29
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026-07-06
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 10
|Room=APB E005
|Date=2026-07-13
|DS=DS5
}}

Datei:ER-Rudolph-Lecture04-SS26.pdf

2026-05-17T17:00:28Z

Sebastian Rudolph:

Datei:ER-Rudolph-Lecture03-SS26.pdf

2026-05-17T16:58:47Z

Sebastian Rudolph:

Introduction to Existential Rules (SS2026)

2026-04-27T11:43:14Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=CMS-LM-ADV, INF-25-MA-FTK-ASAI, INF-BAS2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 14:50-16:20 (DS 5) in room APB E005.
The lecture is scheduled for Mondays, 14:50-16:20 (DS 5) in room APB E005 on the dates indicated in the schedule.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2026-04-13
|DS=DS5
|Download=ER-Rudolph-Lecture01-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2026-04-20
|DS=DS5
|Download=ER-Rudolph-Lecture01-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2026-04-27
|DS=DS5
|Download=ER-Rudolph-Lecture02-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2026-05-04
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2026-05-18
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026-06-01
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026-06-22
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026-06-29
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026-07-06
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 10
|Room=APB E005
|Date=2026-07-13
|DS=DS5
}}

Introduction to Existential Rules (SS2026)

2026-04-27T11:41:58Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=CMS-LM-ADV, INF-25-MA-FTK-ASAI, INF-BAS2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 14:50-16:20 (DS 5) in room APB E005.
The lecture is scheduled for Mondays, 14:50-16:20 (DS 5) in room APB E005 on the dates indicated in the schedule.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2026-04-13
|DS=DS5
|Download=ER-Rudolph-Lecture01-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2026-04-20
|DS=DS5
|Download=ER-Rudolph-Lecture02-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2026-04-27
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2026-05-04
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2026-05-18
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026-06-01
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026-06-22
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026-06-29
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026-07-06
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 10
|Room=APB E005
|Date=2026-07-13
|DS=DS5
}}

Datei:ER-Rudolph-Lecture02-SS26.pdf

2026-04-27T11:41:53Z

Sebastian Rudolph:

Inproceedings3465

2026-04-26T13:06:49Z

Sebastian Rudolph: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Sebastian |ErsterAutorNachname=Rudolph |FurtherAuthors=Kai Sauerwald }} {{Inproceedings |Referiert=1 |Title=Mutual Irreducibility of Revision and Multiple Revision |To appear=0 |Year=2026 |Booktitle=Foundations of Information and Knowledge Systems – 14th International Symposium (FoIKS 2026) |Pages=121-133 |Publisher=Springer |Editor=Anni-Yasmin Turhan, Jonni Virtema |Series=LNCS |Volume=16475 }} {{Publikati…“

{{Publikation Erster Autor
|ErsterAutorVorname=Sebastian
|ErsterAutorNachname=Rudolph
|FurtherAuthors=Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=Mutual Irreducibility of Revision and Multiple Revision
|To appear=0
|Year=2026
|Booktitle=Foundations of Information and Knowledge Systems – 14th International Symposium (FoIKS 2026)
|Pages=121-133
|Publisher=Springer
|Editor=Anni-Yasmin Turhan, Jonni Virtema
|Series=LNCS
|Volume=16475
}}
{{Publikation Details
|Abstract=We show that revision by single sentences and multiple revision are, in general, mutually irreducible processes. The result is given for revision in base logics, a framework for studying revision in arbitrary classical logics for various notions of bases. Within this framework, we demonstrate that revision by single sentences can not be represented as multiple revision. The result employs general relational semantics for base revision. In combination with the well-known result that multiple revision cannot be reduced to sentence revision, we obtain that sentence revision and multiple revision are mutually irreducible.
|ISBN=978-3-032-21539-0
|Download=Rudolph-Sauerwald-FOIKS2026.pdf
|Link=https://doi.org/10.1007/978-3-032-21540-6_8
|DOI Name=10.1007/978-3-032-21540-6_8
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Nichtmonotones Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Datei:Rudolph-Sauerwald-FOIKS2026.pdf

2026-04-26T13:06:20Z

Sebastian Rudolph:

Introduction to Existential Rules (SS2026)

2026-04-12T11:09:41Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=CMS-LM-ADV, INF-25-MA-FTK-ASAI, INF-BAS2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 14:50-16:20 (DS 5) in room APB E005.
The lecture is scheduled for Mondays, 14:50-16:20 (DS 5) in room APB E005 on the dates indicated in the schedule.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2026-04-13
|DS=DS5
|Download=ER-Rudolph-Lecture01-SS26.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2026-04-20
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2026-04-27
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2026-05-04
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2026-05-18
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026-06-01
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026-06-22
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026-06-29
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026-07-06
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 10
|Room=APB E005
|Date=2026-07-13
|DS=DS5
}}

Datei:ER-Rudolph-Lecture01-SS26.pdf

2026-04-12T11:09:37Z

Sebastian Rudolph:

Introduction to Existential Rules (SS2026)

2026-04-12T11:06:55Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=CMS-LM-ADV, INF-25-MA-FTK-ASAI, INF-BAS2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 14:50-16:20 (DS 5) in room APB E005.
The lecture is scheduled for Mondays, 14:50-16:20 (DS 5) in room APB E005 on the dates indicated in the schedule.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2026-04-13
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2026-04-20
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2026-04-27
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2026-05-04
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2026-05-18
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026-06-01
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026-06-22
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026-06-29
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026-07-06
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 10
|Room=APB E005
|Date=2026-07-13
|DS=DS5
}}

Introduction to Formal Concept Analysis (SS2026)

2026-04-11T18:00:53Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Formal Concept Analysis
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=CMS-LM-ADV, INF-25-MA-FTK-ASAI, INF-BAS2
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=This course is an introduction into formal concept analysis (FCA), a mathematical theory oriented at applications in knowledge representation, knowledge acquisition, data analysis and visualization. It provides tools for understanding the data by representing it as a hierarchy of concepts or, more exactly, a concept lattice. FCA can help in processing a wide class of data types providing a framework in which various data analysis and knowledge acquisition techniques can be formulated. In this course, we focus on some of these techniques, as well as cover the theoretical foundations and algorithmic issues of FCA.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 11:10-12:40 (DS 3) in room APB E005.
The lecture is scheduled for Mondays, 11:10-12:40 (DS 3) in room APB E005 and the tutorial for Mondays, 9:20-10:50 (DS2) in room APB E005.
|Literature=*Bernhard Ganter and Rudolf Wille, Formal Concept Analysis: Mathematical Foundations, Springer, Berlin/Heidelberg, 1999.
*Claudio Carpineto and Giovanni Romano, Concept Data Analysis: Theory and Applications, Wiley, 2004.
*Proceedings of the International Conference on Formal Concept Analysis, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, 2004-2012.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2026-04-13
|DS=DS3
|Download=00 organization 26.pdf, 01 contexts and concept lattices.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 1
|Room=APB E005
|Date=2026-04-20
|DS=DS2
|Download=IFCA-2017-T01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2026-04-20
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 2
|Room=APB E005
|Date=2026-04-27
|DS=DS2
|Download=IFCA-2017-T02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2026-04-27
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 3
|Room=APB E005
|Date=2026-05-04
|DS=DS2
|Download=IFCA-2017-T03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2026-05-04
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 4
|Room=APB E005
|Date=2026-05-18
|DS=DS2
|Download=IFCA-2017-T04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2026-05-18
|DS=DS3
|Download=02 conceptual scaling.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 5
|Room=APB E005
|Date=2026-06-01
|DS=DS2
|Download=IFCA-2017-T05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026-06-01
|DS=DS3
|Download=03 closure systems.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 6
|Room=APB E005
|Date=2026-06-22
|DS=DS2
|Download=IFCA-2017-T06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026-06-22
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 7
|Room=APB E005
|Date=2026-06-29
|DS=DS2
|Download=IFCA-2017-T07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026-06-29
|DS=DS3
|Download=04 implications.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 8
|Room=APB E005
|Date=2026-07-06
|DS=DS2
|Download=ICFCA-2017-T08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026-07-06
|DS=DS3
|Download=05 attribute exploration.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 9
|Room=APB E005
|Date=2026-07-13
|DS=DS2
|Download=ICFCA-2017-T09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Q/A Session
|Room=APB E005
|Date=2026-07-13
|DS=DS3
|Download=06 trifca.pdf
}}

Datei:00 organization 26.pdf

2026-04-11T18:00:37Z

Sebastian Rudolph:

Introduction to Formal Concept Analysis (SS2026)

2026-04-11T17:59:44Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Formal Concept Analysis
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=CMS-LM-ADV, INF-25-MA-FTK-ASAI, INF-BAS2
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=This course is an introduction into formal concept analysis (FCA), a mathematical theory oriented at applications in knowledge representation, knowledge acquisition, data analysis and visualization. It provides tools for understanding the data by representing it as a hierarchy of concepts or, more exactly, a concept lattice. FCA can help in processing a wide class of data types providing a framework in which various data analysis and knowledge acquisition techniques can be formulated. In this course, we focus on some of these techniques, as well as cover the theoretical foundations and algorithmic issues of FCA.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 11:10-12:40 (DS 3) in room APB E005.
The lecture is scheduled for Mondays, 11:10-12:40 (DS 3) in room APB E005 and the tutorial for Mondays, 9:20-10:50 (DS2) in room APB E005.
|Literature=*Bernhard Ganter and Rudolf Wille, Formal Concept Analysis: Mathematical Foundations, Springer, Berlin/Heidelberg, 1999.
*Claudio Carpineto and Giovanni Romano, Concept Data Analysis: Theory and Applications, Wiley, 2004.
*Proceedings of the International Conference on Formal Concept Analysis, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, 2004-2012.
}}

{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2026/04/13
|DS=DS3
|Download=00 organization 2324.pdf,01 contexts and concept lattices.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 1
|Room=APB E005
|Date=2026/04/20
|DS=DS2
|Download=IFCA-2017-T01.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2026/04/20
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 2
|Room=APB E005
|Date=2026/04/27
|DS=DS2
|Download=IFCA-2017-T02.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2026/04/27
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 3
|Room=APB E005
|Date=2026/05/04
|DS=DS2
|Download=IFCA-2017-T03.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2026/05/04
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 4
|Room=APB E005
|Date=2026/05/18
|DS=DS2
|Download=IFCA-2017-T04.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2026/05/18
|DS=DS3
|Download=02 conceptual scaling.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 5
|Room=APB E005
|Date=2026/06/01
|DS=DS2
|Download=IFCA-2017-T05.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026/06/01
|DS=DS3
|Download=03 closure systems.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 6
|Room=APB E005
|Date=2026/06/22
|DS=DS2
|Download=IFCA-2017-T06.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026/06/22
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 7
|Room=APB E005
|Date=2026/06/29
|DS=DS2
|Download=IFCA-2017-T07.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026/06/29
|DS=DS3
|Download=04 implications.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 8
|Room=APB E005
|Date=2026/07/06
|DS=DS2
|Download=ICFCA-2017-T08.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026/07/06
|DS=DS3
|Download=05 attribute exploration.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Tutorial 9
|Room=APB E005
|Date=2026/07/13
|DS=DS2
|Download=ICFCA-2017-T09.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Q/A Session
|Room=APB E005
|Date=2026/07/13
|DS=DS3
|Download=06 trifca.pdf
}}

Introduction to Formal Concept Analysis (SS2026)

2026-04-09T20:32:40Z

Sebastian Rudolph:

Introduction to Formal Concept Analysis (SS2026)

2026-04-09T20:31:19Z

Sebastian Rudolph: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Introduction to Formal Concept Analysis |Research group=Computational Logic |Lecturers=Sebastian Rudolph |Term=SS |Year=2026 |Module=INF-BAS2, MCL-KR, MCL-PI, INF-E-3, CMS-LM-ADV, CMS-LM-AI |SWSLecture=2 |SWSExercise=2 |SWSPractical=0 |Exam type=mündliche Prüfung |Description=This course is an introduction into formal concept analysis (FCA), a mathematical theory oriented at applications in knowledge representation, knowledge acquisit…“

{{Vorlesung
|Title=Introduction to Formal Concept Analysis
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=INF-BAS2, MCL-KR, MCL-PI, INF-E-3, CMS-LM-ADV, CMS-LM-AI
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=This course is an introduction into formal concept analysis (FCA), a mathematical theory oriented at applications in knowledge representation, knowledge acquisition, data analysis and visualization. It provides tools for understanding the data by representing it as a hierarchy of concepts or, more exactly, a concept lattice. FCA can help in processing a wide class of data types providing a framework in which various data analysis and knowledge acquisition techniques can be formulated. In this course, we focus on some of these techniques, as well as cover the theoretical foundations and algorithmic issues of FCA.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 11:10-12:40 (DS 3) in room APB E005.
The lecture is scheduled for Mondays, 11:10-12:40 (DS 3) in room APB E005 and the tutorial for Mondays, 9:20-10:50 (DS2) in room APB E005.
|Literature=*Bernhard Ganter and Rudolf Wille, Formal Concept Analysis: Mathematical Foundations, Springer, Berlin/Heidelberg, 1999.
*Claudio Carpineto and Giovanni Romano, Concept Data Analysis: Theory and Applications, Wiley, 2004.
*Proceedings of the International Conference on Formal Concept Analysis, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, 2004-2012.
}}

Introduction to Existential Rules (SS2026)

2026-04-09T20:28:10Z

Sebastian Rudolph:

Introduction to Existential Rules (SS2026)

2026-04-09T20:27:07Z

Sebastian Rudolph: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Introduction to Existential Rules |Research group=Computational Logic |Lecturers=Sebastian Rudolph |Term=SS |Year=2026 |Module=INF-BAS2, INF-VERT2 |SWSLecture=2 |SWSExercise=0 |SWSPractical=0 |Exam type=mündliche Prüfung |Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and datab…“

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=SS
|Year=2026
|Module=INF-BAS2, INF-VERT2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th April 2026, 14:50-16:20 (DS 5) in room APB E005.
The lecture is scheduled for Mondays, 14:50-16:20 (DS 5) in room APB E005 on the dates indicated in the schedule.
}}

SEMECO-Q2

2026-02-22T17:40:42Z

Sebastian Rudolph:

{{Projekt
|Kurzname=SEMECO-Q2
|Name=Sichere Medizinische Mikrosysteme und Kommunikation: KI-assistierte Regulatorik für Medizin und Cybersecurity
|Name EN=Secure Medical Microsystems and Communications: AI-assisted Regulatory Affairs for Medicine and Cybersecurity
|Beschreibung DE=SEMECO-Q2 entwickelt eine auf Wissensrepräsentation und symbolischer KI basierte Lösung, die den
regulatorischen Prozess, die Agilität des eigentlichen Systementwurfs und der Softwareentwicklung cybermedizinischer Mikrosysteme widerspiegelt. Gleichzeitig werden die kulturellen
und arbeitsorganisatorischen Barrieren zwischen Systementwicklung und Sicherheitsdokumentation überwunden. Damit wird eine grundlegende Verbesserung der Sicherheit, Transparenz und der Zertifizierung von PEMS erreicht und die Entwicklung dezidierter medizinischer
Mikrosysteme drastisch erleichtert bzw. erst ermöglicht.
|Beschreibung EN=SEMECO-Q2 develops a method for modelling risk management for safety and security in the context of medical microsystems. The method will be based on knowledge representation and more broadly on symbolic AI, and will unify design and development of systems with creating and maintaing risk management documentation.
|Kontaktperson=Hannes Straß
|URL=https://digitalhealth.tu-dresden.de/projects/semeco/
|Start=01.05.2023
|Ende=30.04.2026
|Finanziert von=BMBF
|Projektstatus=aktiv
|Logo=Semeco-logo.png
|Person=Hannes Straß, Martin Diller
|Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Semantische Technologien
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Regelbasiertes Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Nichtmonotones Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Article3118

2026-02-13T15:21:06Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Manuel
|ErsterAutorNachname=Bodirsky
|FurtherAuthors=Simon Knäuer; Sebastian Rudolph
}}
{{Article
|Referiert=1
|Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic
|To appear=0
|Year=2026
|Journal=ACM Transactions on Computational Logic
|Volume=27
|Number=2
|Pages=1-42
|Publisher=ACM
}}
{{Publikation Details
|Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class 𝒞 of finite structures that can be expressed in MSO and is closed under homomorphisms, and for all integers ℓ,𝑘, there exists a canonical Datalog program Π of width (ℓ,𝑘) in the sense of Feder and Verdi. The same characterisations also hold for Guarded Second-order Logic (GSO), which properly extends MSO. To prove our results, we show that every class 𝒞 in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of countably ω-categorical structures. The intersection of MSO and Datalog is known to contain the class of nested monadically defined queries (Nemodeq); likewise, we show that the intersection of GSO and Datalog contains all problems that can be expressed by the more expressive language of nested guarded queries. Yet, by exploiting our results, we can show that neither of the two query languages can serve as a characterization, as we exhibit a CSP whose complement corresponds to a query in the intersection of MSO and Datalog that is not expressible in nested guarded queries.
|ISSN=1529-3785
|Download=3779418.pdf
|Link=https://doi.org/10.1145/3779418
|DOI Name=10.1145/3779418
|Projekt=DeciGUT
|Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic
}}

Inproceedings3450

2026-01-11T16:25:03Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Non-Monotonic S4F Standpoint Logic
|To appear=1
|Year=2026
|Month=Januar
|Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26)
}}
{{Publikation Details
|Abstract=Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics — in particular using the modal logic S4F.
In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and propositional standpoint logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.
|Download=Gorczyca-strass2025non-monotonic-s4f-standpoint-logic.pdf
|Projekt=KIMEDS, MEDGE, SECAI, SEMECO-Q2
|Forschungsgruppe=Computational Logic
}}

Foundations of Knowledge Representation (WS2025)

2026-01-11T16:16:44Z

Sebastian Rudolph:

{{Vorlesung
|Title=Foundations of Knowledge Representation
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Tutors=Jonas Karge
|Term=WS
|Year=2025
|Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description==== Important Information Regarding Exercise Sessions ===
Due to low demand, the exercise sessions will switch to 'on-demand' sessions. If you are a student who would like to discuss the problems from the weekly exercise sheets, please send an email to [mailto:jonas.karge@tu-dresden.de jonas.karge@tu-dresden.de]

=== Beginning of Semester ===

The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).

=== Synopsis ===

In this lecture, we will review the most popular logical formalisms for knowledge representation and discuss relevant aspects arising in practice, such as dealing with uncertain and inconsistent knowledge.

=== Exam ===

To take an exam in the course, you must:

# Register for the exam
#* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly.
# Apply for a date/time slot
#* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction
|Room=APB E005
|Date=2025-10-13
|DS=DS6
|Download=Fkr-00-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-20
|DS=DS5
|Download=Fkr-01-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-10-20
|DS=DS6
|Download=Fkr-02-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-27
|DS=DS5
|Download=KRR exercises 1 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-10-27
|DS=DS6
|Download=Fkr-03-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-03
|DS=DS5
|Download=Fkr-04-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-03
|DS=DS6
|Download=Fkr-05-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-11-10
|DS=DS5
|Download=KRR exercises 2 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-11-10
|DS=DS6
|Download=KRR exercises 3 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-17
|DS=DS5
|Download=KRR exercises 4 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-17
|DS=DS6
|Download=KRR exercises 5 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-11-24
|DS=DS5
|Download=Fkr-06-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-11-24
|DS=DS6
|Download=Fkr-07-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-12-01
|DS=DS5
|Download=KRR exercises (7).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-12-01
|DS=DS6
|Download=KRR exercises (9).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Exercise Sessions
|Room=APB E005
|Date=2025-12-08
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Lecture
|Room=APB E005
|Date=2025-12-08
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2025-12-15
|DS=DS5
|Download=Fkr-08-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-05
|DS=DS5
|Download=Fkr-09-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2026-01-12
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-12
|DS=DS5
|Download=Fkr-10-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-19
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=TBA
|Room=APB E005
|Date=2026-01-19
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=TBA
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Q&A
|Room=APB E005
|Date=2026-02-02
|DS=DS6
}}

Datei:Fkr-10-WS2025.pdf

2026-01-11T16:16:40Z

Sebastian Rudolph:

Introduction to Existential Rules (WS2025)

2026-01-06T11:59:19Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=WS
|Year=2025
|Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.
The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2025-10-13
|DS=DS2
|Download=ER-Rudolph-Lecture01-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2025-10-20
|DS=DS2
|Download=ER-Rudolph-Lecture02-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2025-10-27
|DS=DS2
|Download=ER-Rudolph-Lecture03-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2025-11-03
|DS=DS2
|Download=ER-Rudolph-Lecture04-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5.a
|Room=APB E005
|Date=2025-11-24
|DS=DS2
|Download=ER-Rudolph-Lecture05-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5.b
|Room=APB E005
|Date=2025-12-15
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2026-01-05
|DS=DS2
|Download=ER-Rudolph-Lecture06-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E005
|Date=2026-01-12
|DS=DS2
|Download=ER-Rudolph-Lecture07-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E005
|Date=2026-01-19
|DS=DS2
|Download=ER-Rudolph-Lecture08-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E005
|Date=2026-01-26
|DS=DS2
|Download=ER-Rudolph-Lecture09-WS2025.pdf
}}

Datei:ER-Rudolph-Lecture09-WS2025.pdf

2026-01-06T11:58:49Z

Sebastian Rudolph:

Datei:ER-Rudolph-Lecture08-WS2025.pdf

2026-01-06T11:58:13Z

Sebastian Rudolph:

Datei:ER-Rudolph-Lecture07-WS2025.pdf

2026-01-06T11:56:57Z

Sebastian Rudolph:

DeciGUT

2026-01-02T15:48:10Z

Sebastian Rudolph:

{{Projekt
|Kurzname=DeciGUT
|Name=A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
|Name EN=A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
|Beschreibung DE=[[Datei:LOGO-ERC-small.jpg|200px|rahmenlos|rechts]]
Das Projekt befasst sich mit den formalen Grundlagen der Wissensverarbeitung und ihren Anwendungen in der heutigen Informationsgesellschaft. Zu deren grundlegenden Herausforderungen zählen der intelligente Zugriff auf digitale Datenbestände sowie die automatische Verknüpfung von Informationen aus verschiedenen Quellen. Hilfreich bei der Bewältigung dieser Aufgaben sind sogenannte Ontologien, in welchen relevantes Hintergrundwissen formallogisch beschrieben wird. Der Einsatz von Ontologien und Techniken des automatischen Schlussfolgerns ermöglicht einen besseren, "bedeutungsgerechten" Umgang mit den Daten.

Leider lässt sich automatisches Schlussfolgern für sehr ausdrucksstarke Ontologiesprachen nicht algorithmisch umsetzen – sie sind unentscheidbar. Die Suche nach "guten" Ontologiesprachen besteht also darin, möglichst ausdrucksstarke aber immer noch entscheidbare logische Formalismen zu identifizieren. Bisher sind die erzielten Resultate in diesem Gebiet jedoch uneinheitlich und fragmentarisch.

Ziel des Projekts DeciGUT ist die Schaffung einer vereinheitlichten Theorie der Entscheidbarkeit, welche dann wiederum die Definition neuer, fortgeschrittener Ontologiesprachen ermöglichen wird.

Das Projekt hat eine hohe Relevanz für diverse Wissenschaftsfelder wie mathematische Logik, künstliche Intelligenz und Datenbanktheorie mit potenziell weitreichenden praktischen Auswirkungen, etwa in den Bereichen Semantische Technologien und Informationssysteme.
|Beschreibung EN=[[Datei:LOGO-ERC-small.jpg|200px|rahmenlos|rechts]]
The project deals with the formal foundations of knowledge management as well as their application in today's information society. Among the biggest challenges in this area are the intelligent access to digital information as well as the automated composition of information from diverse sources. For these purposes, logical specifications of background knowledge - so-called ontologies - can be used together with automated reasoning techniques in order to enable a "meaning-aware" handling of data.

Unfortunately, reasoning in ontology languages of high expressivity is impossible to capture algorithmically – they are undecidable. Therefore, the quest for "good" ontology languages consists in identifying logical formalisms which are as expressive as possible, yet still decidable. Hitherto, the obtained results in this area have, however, been patchy and fragmented.

The goal of the DeciGUT project is the creation of a unified theory of decidability, which in turn will enable the definition of new, advanced ontology languages.

The project is of high relevance to diverse scientific fields like mathematical logic, artificial intelligence, and database theory with potentially far-reaching impact in areas such as semantic technologies and information systems.
|Kontaktperson=Sebastian Rudolph
|Start=2018/10/01
|Ende=2025/03/31
|Finanziert von=European Research Council
|Projektstatus=abgeschlossen
|Logo=DeciGUT-logo-final.png
|Person=Sebastian Rudolph, Thomas Feller, Bartosz Bednarczyk, Tim Lyon, Piotr Ostropolski-Nalewaja
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}
{{Forschungsgebiet Auswahl}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Semantische Technologien
}}

Foundations of Knowledge Representation (WS2025)

2025-12-27T18:05:36Z

Sebastian Rudolph:

{{Vorlesung
|Title=Foundations of Knowledge Representation
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Tutors=Jonas Karge
|Term=WS
|Year=2025
|Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description==== Important Information Regarding Exercise Sessions ===
Due to low demand, the exercise sessions will switch to 'on-demand' sessions. If you are a student who would like to discuss the problems from the weekly exercise sheets, please send an email to [mailto:jonas.karge@tu-dresden.de jonas.karge@tu-dresden.de]

=== Beginning of Semester ===

The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).

=== Synopsis ===

In this lecture, we will review the most popular logical formalisms for knowledge representation and discuss relevant aspects arising in practice, such as dealing with uncertain and inconsistent knowledge.

=== Exam ===

To take an exam in the course, you must:

# Register for the exam
#* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly.
# Apply for a date/time slot
#* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction
|Room=APB E005
|Date=2025-10-13
|DS=DS6
|Download=Fkr-00-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-20
|DS=DS5
|Download=Fkr-01-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-10-20
|DS=DS6
|Download=Fkr-02-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-27
|DS=DS5
|Download=KRR exercises 1 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-10-27
|DS=DS6
|Download=Fkr-03-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-03
|DS=DS5
|Download=Fkr-04-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-03
|DS=DS6
|Download=Fkr-05-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-11-10
|DS=DS5
|Download=KRR exercises 2 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-11-10
|DS=DS6
|Download=KRR exercises 3 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-17
|DS=DS5
|Download=KRR exercises 4 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-17
|DS=DS6
|Download=KRR exercises 5 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-11-24
|DS=DS5
|Download=Fkr-06-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-11-24
|DS=DS6
|Download=Fkr-07-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-12-01
|DS=DS5
|Download=KRR exercises (7).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-12-01
|DS=DS6
|Download=KRR exercises (9).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Exercise Sessions
|Room=APB E005
|Date=2025-12-08
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Lecture
|Room=APB E005
|Date=2025-12-08
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2025-12-15
|DS=DS5
|Download=Fkr-08-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-05
|DS=DS5
|Download=Fkr-09-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2026-01-12
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-12
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-19
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=TBA
|Room=APB E005
|Date=2026-01-19
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=TBA
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Q&A
|Room=APB E005
|Date=2026-02-02
|DS=DS6
}}

Datei:Fkr-09-WS2025.pdf

2025-12-27T18:05:31Z

Sebastian Rudolph:

Foundations of Knowledge Representation (WS2025)

2025-12-27T18:04:17Z

Sebastian Rudolph:

{{Vorlesung
|Title=Foundations of Knowledge Representation
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Tutors=Jonas Karge
|Term=WS
|Year=2025
|Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description==== Important Information Regarding Exercise Sessions ===
Due to low demand, the exercise sessions will switch to 'on-demand' sessions. If you are a student who would like to discuss the problems from the weekly exercise sheets, please send an email to [mailto:jonas.karge@tu-dresden.de jonas.karge@tu-dresden.de]

=== Beginning of Semester ===

The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).

=== Synopsis ===

In this lecture, we will review the most popular logical formalisms for knowledge representation and discuss relevant aspects arising in practice, such as dealing with uncertain and inconsistent knowledge.

=== Exam ===

To take an exam in the course, you must:

# Register for the exam
#* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly.
# Apply for a date/time slot
#* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction
|Room=APB E005
|Date=2025-10-13
|DS=DS6
|Download=Fkr-00-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-20
|DS=DS5
|Download=Fkr-01-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-10-20
|DS=DS6
|Download=Fkr-02-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-27
|DS=DS5
|Download=KRR exercises 1 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-10-27
|DS=DS6
|Download=Fkr-03-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-03
|DS=DS5
|Download=Fkr-04-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-03
|DS=DS6
|Download=Fkr-05-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-11-10
|DS=DS5
|Download=KRR exercises 2 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-11-10
|DS=DS6
|Download=KRR exercises 3 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-17
|DS=DS5
|Download=KRR exercises 4 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-17
|DS=DS6
|Download=KRR exercises 5 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-11-24
|DS=DS5
|Download=Fkr-06-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-11-24
|DS=DS6
|Download=Fkr-07-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-12-01
|DS=DS5
|Download=KRR exercises (7).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-12-01
|DS=DS6
|Download=KRR exercises (9).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Exercise Sessions
|Room=APB E005
|Date=2025-12-08
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Lecture
|Room=APB E005
|Date=2025-12-08
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2025-12-15
|DS=DS5
|Download=Fkr-08-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-05
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2026-01-12
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-12
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-19
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=TBA
|Room=APB E005
|Date=2026-01-19
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=TBA
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Q&A
|Room=APB E005
|Date=2026-02-02
|DS=DS6
}}

Foundations of Knowledge Representation (WS2025)

2025-12-27T17:59:01Z

Sebastian Rudolph:

{{Vorlesung
|Title=Foundations of Knowledge Representation
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Tutors=Jonas Karge
|Term=WS
|Year=2025
|Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description==== Important Information Regarding Exercise Sessions ===
Due to low demand, the exercise sessions will switch to 'on-demand' sessions. If you are a student who would like to discuss the problems from the weekly exercise sheets, please send an email to [mailto:jonas.karge@tu-dresden.de jonas.karge@tu-dresden.de]

=== Beginning of Semester ===

The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).

=== Synopsis ===

In this lecture, we will review the most popular logical formalisms for knowledge representation and discuss relevant aspects arising in practice, such as dealing with uncertain and inconsistent knowledge.

=== Exam ===

To take an exam in the course, you must:

# Register for the exam
#* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly.
# Apply for a date/time slot
#* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction
|Room=APB E005
|Date=2025-10-13
|DS=DS6
|Download=Fkr-00-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-20
|DS=DS5
|Download=Fkr-01-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-10-20
|DS=DS6
|Download=Fkr-02-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-27
|DS=DS5
|Download=KRR exercises 1 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-10-27
|DS=DS6
|Download=Fkr-03-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-03
|DS=DS5
|Download=Fkr-04-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-03
|DS=DS6
|Download=Fkr-05-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-11-10
|DS=DS5
|Download=KRR exercises 2 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-11-10
|DS=DS6
|Download=KRR exercises 3 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-17
|DS=DS5
|Download=KRR exercises 4 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-17
|DS=DS6
|Download=KRR exercises 5 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-11-24
|DS=DS5
|Download=Fkr-06-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-11-24
|DS=DS6
|Download=Fkr-07-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-12-01
|DS=DS5
|Download=KRR exercises (7).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-12-01
|DS=DS6
|Download=KRR exercises (9).pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Exercise Sessions
|Room=APB E005
|Date=2025-12-08
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Lecture
|Room=APB E005
|Date=2025-12-08
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2025-12-15
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-05
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2026-01-12
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-12
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-19
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=TBA
|Room=APB E005
|Date=2026-01-19
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=TBA
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Q&A
|Room=APB E005
|Date=2026-02-02
|DS=DS6
}}

Introduction to Existential Rules (WS2025)

2025-12-27T17:55:22Z

Sebastian Rudolph:

Datei:ER-Rudolph-Lecture06-WS2025.pdf

2025-12-27T17:55:18Z

Sebastian Rudolph:

Article3118

2025-12-22T09:20:37Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Manuel
|ErsterAutorNachname=Bodirsky
|FurtherAuthors=Simon Knäuer; Sebastian Rudolph
}}
{{Article
|Referiert=1
|Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic
|To appear=1
|Year=2025
|Journal=ACM Transactions on Computational Logic
|Publisher=ACM
}}
{{Publikation Details
|Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class 𝒞 of finite structures that can be expressed in MSO and is closed under homomorphisms, and for all integers ℓ,𝑘, there exists a canonical Datalog program Π of width (ℓ,𝑘) in the sense of Feder and Verdi. The same characterisations also hold for Guarded Second-order Logic (GSO), which properly extends MSO. To prove our results, we show that every class 𝒞 in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of countably ω-categorical structures. The intersection of MSO and Datalog is known to contain the class of nested monadically defined queries (Nemodeq); likewise, we show that the intersection of GSO and Datalog contains all problems that can be expressed by the more expressive language of nested guarded queries. Yet, by exploiting our results, we can show that neither of the two query languages can serve as a characterization, as we exhibit a CSP whose complement corresponds to a query in the intersection of MSO and Datalog that is not expressible in nested guarded queries.
|Download=3779418.pdf
|Link=https://dl.acm.org/doi/10.1145/3779418
|DOI Name=10.1145/3779418
|Projekt=DeciGUT
|Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic
}}

Datei:Fkr-08-WS2025.pdf

2025-12-15T13:36:51Z

Sebastian Rudolph:

Article3118

2025-12-12T16:17:19Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Manuel
|ErsterAutorNachname=Bodirsky
|FurtherAuthors=Simon Knäuer; Sebastian Rudolph
}}
{{Article
|Referiert=1
|Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic
|To appear=1
|Year=2025
|Journal=ACM Transactions on Computational Logic
|Publisher=ACM
}}
{{Publikation Details
|Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class 𝒞 of finite structures that can be expressed in MSO and is closed under homomorphisms, and for all integers ℓ,𝑘, there exists a canonical Datalog program Π of width (ℓ,𝑘) in the sense of Feder and Verdi. The same characterisations also hold for Guarded Second-order Logic (GSO), which properly extends MSO. To prove our results, we show that every class 𝒞 in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of countably categorical structures. The intersection of MSO and Datalog is known to contain the class of nested monadically defined queries (Nemodeq); likewise, we show that the intersection of GSO and Datalog contains all problems that can be expressed by the more expressive language of nested guarded queries. Yet, by exploiting our results, we can show that neither of the two query languages can serve as a characterization, as we exhibit a CSP whose complement corresponds to a query in the intersection of MSO and Datalog that is not expressible in nested guarded queries.
|Download=3779418.pdf
|Link=https://dl.acm.org/doi/10.1145/3779418
|DOI Name=10.1145/3779418
|Projekt=DeciGUT
|Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic
}}

Article3118

2025-12-12T16:13:16Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Manuel
|ErsterAutorNachname=Bodirsky
|FurtherAuthors=Simon Knäuer; Sebastian Rudolph
}}
{{Article
|Referiert=1
|Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic
|To appear=1
|Year=2025
|Journal=ACM Transactions on Computational Logic
|Publisher=ACM
}}
{{Publikation Details
|Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class 𝒞 of finite structures that can be expressed in MSO and is closed under homomorphisms, and for all integers l,k, there exists a canonical Datalog program Π of width (l,k) in the sense of Feder and Verdi. The same characterisations also hold for Guarded Second-order Logic (GSO), which properly extends MSO. To prove our results, we show that every class 𝒞 in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of countably categorical structures. The intersection of MSO and Datalog is known to contain the class of nested monadically defined queries (Nemodeq); likewise, we show that the intersection of GSO and Datalog contains all problems that can be expressed by the more expressive language of nested guarded queries. Yet, by exploiting our results, we can show that neither of the two query languages can serve as a characterization, as we exhibit a CSP whose complement corresponds to a query in the intersection of MSO and Datalog that is not expressible in nested guarded queries.
|Download=3779418.pdf
|Link=https://dl.acm.org/doi/10.1145/3779418
|DOI Name=10.1145/3779418
|Projekt=DeciGUT
|Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic
}}

Article3118

2025-12-12T16:10:19Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Manuel
|ErsterAutorNachname=Bodirsky
|FurtherAuthors=Simon Knäuer; Sebastian Rudolph
}}
{{Article
|Referiert=1
|Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic
|To appear=1
|Year=2025
|Journal=ACM Transactions on Computational Logic
|Publisher=ACM
}}
{{Publikation Details
|Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class C of finite structures that can be expressed in MSO and is closed under homomorphisms, and for all integers l,k, there exists a canonical Datalog program Π of width (l,k) in the sense of Feder and Verdi. The same characterisations also hold for Guarded Second-order Logic (GSO), which properly extends MSO. To prove our results, we show that every class C in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of countably categorical structures. The intersection of MSO and Datalog is known to contain the class of nested monadically defined queries (Nemodeq); likewise, we show that the intersection of GSO and Datalog contains all problems that can be expressed by the more expressive language of nested guarded queries. Yet, by exploiting our results, we can show that neither of the two query languages can serve as a characterization, as we exhibit a CSP whose complement corresponds to a query in the intersection of MSO and Datalog that is not expressible in nested guarded queries.
|Download=3779418.pdf
|Link=https://dl.acm.org/doi/10.1145/3779418
|DOI Name=10.1145/3779418
|Projekt=DeciGUT
|Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic
}}

Article3118

2025-12-12T16:07:58Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Manuel
|ErsterAutorNachname=Bodirsky
|FurtherAuthors=Simon Knäuer; Sebastian Rudolph
}}
{{Article
|Referiert=1
|Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic
|To appear=1
|Year=2025
|Journal=ACM Transactions on Computational Logic
|Publisher=ACM
}}
{{Publikation Details
|Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class C of finite structures that can be expressed in MSO and is closed under homomorphisms, and for all integers l,k, there exists a canonical Datalog program Pi of width (l,k) in the sense of Feder and Verdi. The same characterisations also hold for Guarded Second-order Logic (GSO), which properly extends MSO. To prove our results, we show that every class C in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of countably categorical structures. The intersection of MSO and Datalog is known to contain the class of nested monadically defined queries (Nemodeq); likewise, we show that the intersection of GSO and Datalog contains all problems that can be expressed by the more expressive language of nested guarded queries. Yet, by exploiting our results, we can show that neither of the two query languages can serve as a characterization, as we exhibit a CSP whose complement corresponds to a query in the intersection of MSO and Datalog that is not expressible in nested guarded queries.
|Download=3779418.pdf
|Link=https://dl.acm.org/doi/10.1145/3779418
|DOI Name=10.1145/3779418
|Projekt=DeciGUT
|Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic
}}

Datei:3779418.pdf

2025-12-12T16:06:39Z

Sebastian Rudolph:

Article3118

2025-12-10T17:04:36Z

Sebastian Rudolph: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Manuel |ErsterAutorNachname=Bodirsky |FurtherAuthors=Simon Knäuer; Sebastian Rudolph }} {{Article |Referiert=1 |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic |To appear=1 |Year=2025 |Journal=ACM Transactions on Computational Logic |Publisher=ACM }} {{Publikation Details |Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equiva…“

{{Publikation Erster Autor
|ErsterAutorVorname=Manuel
|ErsterAutorNachname=Bodirsky
|FurtherAuthors=Simon Knäuer; Sebastian Rudolph
}}
{{Article
|Referiert=1
|Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic
|To appear=1
|Year=2025
|Journal=ACM Transactions on Computational Logic
|Publisher=ACM
}}
{{Publikation Details
|Abstract=We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class C of finite structures that can be expressed in MSO and is closed under homomorphisms, and for all integers l,k, there exists a canonical Datalog program Pi of width (l,k) in the sense of Feder and Verdi. The same characterisations also hold for Guarded Second-order Logic (GSO), which properly extends MSO. To prove our results, we show that every class C in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of countably categorical structures. The intersection of MSO and Datalog is known to contain the class of nested monadically defined queries (Nemodeq); likewise, we show that the intersection of GSO and Datalog contains all problems that can be expressed by the more expressive language of nested guarded queries. Yet, by exploiting our results, we can show that neither of the two query languages can serve as a characterization, as we exhibit a CSP whose complement corresponds to a query in the intersection of MSO and Datalog that is not expressible in nested guarded queries.
|DOI Name=10.1145/3779418
|Projekt=DeciGUT
|Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic
}}

Introduction to Existential Rules (WS2025)

2025-11-24T13:33:50Z

Sebastian Rudolph:

{{Vorlesung
|Title=Introduction to Existential Rules
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=WS
|Year=2025
|Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description=Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. In this lecture, we will provide a formal introduction into the existential rules framework, discuss existing techniques to reason over decidable fragments of this language and investigate the limits of the expressivity of existential rules.

<h4>Prerequisites</h4>
*basic knowledge of propositional and first-order logic
*some familiarity with computational complexity

<h4>Organisation</h4>
The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.
The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E005
|Date=2025-10-13
|DS=DS2
|Download=ER-Rudolph-Lecture01-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E005
|Date=2025-10-20
|DS=DS2
|Download=ER-Rudolph-Lecture02-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E005
|Date=2025-10-27
|DS=DS2
|Download=ER-Rudolph-Lecture03-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E005
|Date=2025-11-03
|DS=DS2
|Download=ER-Rudolph-Lecture04-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E005
|Date=2025-11-24
|DS=DS2
|Download=ER-Rudolph-Lecture05-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E005
|Date=2025-12-15
|DS=DS2
}}

Foundations of Knowledge Representation (WS2025)

2025-11-21T22:00:57Z

Sebastian Rudolph:

{{Vorlesung
|Title=Foundations of Knowledge Representation
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Tutors=Jonas Karge
|Term=WS
|Year=2025
|Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI
|SWSLecture=2
|SWSExercise=2
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description==== Important Information Regarding Exercise Sessions ===
Due to low demand, the exercise sessions will switch to 'on-demand' sessions. If you are a student who would like to discuss the problems from the weekly exercise sheets, please send an email to [mailto:jonas.karge@tu-dresden.de jonas.karge@tu-dresden.de]

=== Beginning of Semester ===

The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).

=== Synopsis ===

In this lecture, we will review the most popular logical formalisms for knowledge representation and discuss relevant aspects arising in practice, such as dealing with uncertain and inconsistent knowledge.

=== Exam ===

To take an exam in the course, you must:

# Register for the exam
#* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly.
# Apply for a date/time slot
#* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction
|Room=APB E005
|Date=2025-10-13
|DS=DS6
|Download=Fkr-00-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-20
|DS=DS5
|Download=Fkr-01-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-10-20
|DS=DS6
|Download=Fkr-02-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Logics for Knowledge Representation
|Room=APB E005
|Date=2025-10-27
|DS=DS5
|Download=KRR exercises 1 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-10-27
|DS=DS6
|Download=Fkr-03-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-03
|DS=DS5
|Download=Fkr-04-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-03
|DS=DS6
|Download=Fkr-05-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Horn Logics and Datalog
|Room=APB E005
|Date=2025-11-10
|DS=DS5
|Download=KRR exercises 2 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics I
|Room=APB E005
|Date=2025-11-10
|DS=DS6
|Download=KRR exercises 3 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Syntax and Semantics II
|Room=APB E005
|Date=2025-11-17
|DS=DS5
|Download=KRR exercises 4 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Description Logics – Reasoning with Data
|Room=APB E005
|Date=2025-11-17
|DS=DS6
|Download=KRR exercises 5 25.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-11-24
|DS=DS5
|Download=Fkr-06-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-11-24
|DS=DS6
|Download=Fkr-07-WS2025.pdf
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning I
|Room=APB E005
|Date=2025-12-01
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Nonmonotonic Reasoning II
|Room=APB E005
|Date=2025-12-01
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Exercise Sessions
|Room=APB E005
|Date=2025-12-08
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Lecture
|Room=APB E005
|Date=2025-12-08
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2025-12-15
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Argumentation
|Room=APB E005
|Date=2025-12-15
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Exercise Sessions
|Room=APB E005
|Date=2026-01-05
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Entfällt
|Title=No Lecture
|Room=APB E005
|Date=2026-01-05
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Inconsistency Handling
|Room=APB E005
|Date=2026-01-12
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-12
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Argumentation
|Room=APB E005
|Date=2026-01-19
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=TBA
|Room=APB E005
|Date=2026-01-19
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=Uncertainty
|Room=APB E005
|Date=2026-01-26
|DS=DS5
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Title=TBA
|Room=APB E005
|Date=2026-01-26
|DS=DS6
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Q&A
|Room=APB E005
|Date=2026-02-02
|DS=DS6
}}

Datei:Fkr-07-WS2025.pdf

2025-11-21T22:00:51Z

Sebastian Rudolph: Sebastian Rudolph lud eine neue Version von Datei:Fkr-07-WS2025.pdf hoch

Datei:Fkr-06-WS2025.pdf

2025-11-21T21:59:53Z

Sebastian Rudolph:

Datei:Fkr-07-WS2025.pdf

2025-11-21T21:59:10Z

Sebastian Rudolph:

Inproceedings3421

2025-11-17T04:03:15Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Lucía
|ErsterAutorNachname=Gómez Álvarez
|FurtherAuthors=Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic
|To appear=0
|Year=2025
|Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning
|Pages=366–375
|Publisher=IJCAI Organization
|Editor=Magdalena Ortiz, Renata Wassermann, Torsten Schaub
}}
{{Publikation Details
|Abstract=Standpoint extensions of KR formalisms have been recently introduced to incorporate multi-perspective modelling and reasoning capabilities. In such modal extensions, the integration of conceptual modelling and perspective annotations can be more or less tight, with monodic standpoint extensions striking a good balance as they enable advanced modelling while preserving good reasoning complexities. <br>We consider the extension of C² – the counting two-variable fragment of first-order logic – by monodic standpoints. At the core of our treatise is a polytime translation of formulae in said formalism into standpoint-free C², requiring elaborate model-theoretic arguments. By virtue of this translation, the NEXPTIME-complete complexity of checking satisfiability in C² carries over to our formalism. As our formalism subsumes monodic S5 over C², our result also significantly advances the state of the art in research on first-order modal logics.<br>As a practical consequence, the very expressive description logics 𝒮ℋ𝒪ℐ𝒬ℬs and 𝒮ℛ𝒪ℐ𝒬ℬs which subsume the popular W3C-standardized OWL 1 and OWL 2 ontology languages, are shown to allow for monodic standpoint extensions without any increase of standard reasoning complexity.<br>We prove that NEXPTIME-hardness already occurs in much less expressive DLs as long as they feature both nominals and monodic standpoints. We also show that, with inverses, functionality, and nominals present, minimally lifting the monodicity restriction leads to undecidability.
|ISBN=978-1-956792-08-9
|ISSN=2334-1033
|Download=GAR-KE-2025-StandpointC2.pdf
|Slides=KR2025-Standpoint-C2.pdf
|Link=https://proceedings.kr.org/2025/36/
|DOI Name=10.24963/kr.2025/36
|Projekt=CPEC, SECAI, ScaDS.AI
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Semantische Technologien
}}

Datei:KR2025-Standpoint-C2.pdf

2025-11-17T04:03:10Z

Sebastian Rudolph:

Inproceedings3449

2025-11-16T04:25:35Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Simon
|ErsterAutorNachname=Hosemann
|FurtherAuthors=Jean Christoph Jung; Carsten Lutz; Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=Fitting Ontologies and Constraints to Relational Structures
|To appear=0
|Year=2025
|Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning
|Pages=407–416
|Publisher=IJCAI Organization
|Editor=Magdalena Ortiz, Renata Wassermann, Torsten Schaub
}}
{{Publikation Details
|Abstract=We study the problem of fitting ontologies and constraints to positive and negative examples that take the form of a finite relational structure. As ontology and constraint languages, we consider the description logics EL and ELI as well as several classes of tuple-generating dependencies (TGDs): full, guarded, frontier-guarded, frontier-one, and unrestricted TGDs as well as inclusion dependencies. We pinpoint the exact computational complexity, design algorithms, and analyze the size of fitting ontologies and TGDs. We also investigate the related problem of constructing a finite basis of concept inclusions / TGDs for a given set of finite structures. While finite bases exist for EL, ELI, guarded TGDs, and inclusion dependencies, they in general do not exist for full, frontier-guarded and frontier-one TGDs.
|ISBN=978-1-956792-08-9
|ISSN=2334-1033
|Download=Kr2025-0040-hosemann-et-al.pdf
|Link=https://proceedings.kr.org/2025/40/
|DOI Name=10.24963/kr.2025/40
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}