https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Sebastian+Rudolph 2026-04-05T21:51:54Z Benutzerbeiträge MediaWiki 1.43.1 https://iccl.inf.tu-dresden.de/w/index.php?title=SEMECO-Q2&diff=44041 2026-02-22T17:40:42Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Projekt<br /> |Kurzname=SEMECO-Q2<br /> |Name=Sichere Medizinische Mikrosysteme und Kommunikation: KI-assistierte Regulatorik für Medizin und Cybersecurity<br /> |Name EN=Secure Medical Microsystems and Communications: AI-assisted Regulatory Affairs for Medicine and Cybersecurity<br /> |Beschreibung DE=SEMECO-Q2 entwickelt eine auf Wissensrepräsentation und symbolischer KI basierte Lösung, die den<br /> regulatorischen Prozess, die Agilität des eigentlichen Systementwurfs und der Softwareentwicklung cybermedizinischer Mikrosysteme widerspiegelt. Gleichzeitig werden die kulturellen<br /> 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<br /> Mikrosysteme drastisch erleichtert bzw. erst ermöglicht.<br /> |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.<br /> |Kontaktperson=Hannes Straß<br /> |URL=https://digitalhealth.tu-dresden.de/projects/semeco/<br /> |Start=01.05.2023<br /> |Ende=30.04.2026<br /> |Finanziert von=BMBF<br /> |Projektstatus=aktiv<br /> |Logo=Semeco-logo.png<br /> |Person=Hannes Straß, Martin Diller<br /> |Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Semantische Technologien<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Regelbasiertes Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Nichtmonotones Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Article3118&diff=44014 2026-02-13T15:21:06Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Manuel<br /> |ErsterAutorNachname=Bodirsky<br /> |FurtherAuthors=Simon Knäuer; Sebastian Rudolph<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic<br /> |To appear=0<br /> |Year=2026<br /> |Journal=ACM Transactions on Computational Logic<br /> |Volume=27<br /> |Number=2<br /> |Pages=1-42<br /> |Publisher=ACM<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |ISSN=1529-3785<br /> |Download=3779418.pdf<br /> |Link=https://doi.org/10.1145/3779418<br /> |DOI Name=10.1145/3779418<br /> |Projekt=DeciGUT<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3450&diff=43885 2026-01-11T16:25:03Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Piotr<br /> |ErsterAutorNachname=Gorczyca<br /> |FurtherAuthors=Hannes Straß<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Non-Monotonic S4F Standpoint Logic<br /> |To appear=1<br /> |Year=2026<br /> |Month=Januar<br /> |Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26)<br /> }}<br /> {{Publikation Details<br /> |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.<br /> 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.<br /> |Download=Gorczyca-strass2025non-monotonic-s4f-standpoint-logic.pdf<br /> |Projekt=KIMEDS, MEDGE, SECAI, SEMECO-Q2<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Knowledge_Representation_(WS2025)&diff=43884 2026-01-11T16:16:44Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Knowledge Representation<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Jonas Karge<br /> |Term=WS<br /> |Year=2025<br /> |Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description==== Important Information Regarding Exercise Sessions ===<br /> 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] <br /> <br /> === Beginning of Semester ===<br /> <br /> The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).<br /> <br /> === Synopsis ===<br /> <br /> 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.<br /> <br /> === Exam ===<br /> <br /> To take an exam in the course, you must:<br /> <br /> # Register for the exam<br /> #* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly. <br /> # Apply for a date/time slot<br /> #* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS6<br /> |Download=Fkr-00-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS5<br /> |Download=Fkr-01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS6<br /> |Download=Fkr-02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS5<br /> |Download=KRR exercises 1 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS6<br /> |Download=Fkr-03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS5<br /> |Download=Fkr-04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS6<br /> |Download=Fkr-05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS5<br /> |Download=KRR exercises 2 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS6<br /> |Download=KRR exercises 3 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS5<br /> |Download=KRR exercises 4 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS6<br /> |Download=KRR exercises 5 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS5<br /> |Download=Fkr-06-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS6<br /> |Download=Fkr-07-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS5<br /> |Download=KRR exercises (7).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS6<br /> |Download=KRR exercises (9).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS5<br /> |Download=Fkr-08-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS5<br /> |Download=Fkr-09-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS5<br /> |Download=Fkr-10-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-02-02<br /> |DS=DS6<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-10-WS2025.pdf&diff=43883 2026-01-11T16:16:40Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Introduction_to_Existential_Rules_(WS2025)&diff=43828 2026-01-06T11:59:19Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Introduction to Existential Rules<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |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.<br /> <br /> &lt;h4&gt;Prerequisites&lt;/h4&gt;<br /> *basic knowledge of propositional and first-order logic<br /> *some familiarity with computational complexity<br /> <br /> &lt;h4&gt;Organisation&lt;/h4&gt;<br /> The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.<br /> The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 1<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 2<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 3<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 4<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 5.a<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 5.b<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS2<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 6<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture06-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 7<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture07-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 8<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture08-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 9<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture09-WS2025.pdf<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture09-WS2025.pdf&diff=43827 2026-01-06T11:58:49Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture08-WS2025.pdf&diff=43826 2026-01-06T11:58:13Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture07-WS2025.pdf&diff=43825 2026-01-06T11:56:57Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=DeciGUT&diff=43810 2026-01-02T15:48:10Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Projekt<br /> |Kurzname=DeciGUT<br /> |Name=A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation<br /> |Name EN=A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation<br /> |Beschreibung DE=[[Datei:LOGO-ERC-small.jpg|200px|rahmenlos|rechts]]<br /> 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, &quot;bedeutungsgerechten&quot; Umgang mit den Daten.<br /> <br /> Leider lässt sich automatisches Schlussfolgern für sehr ausdrucksstarke Ontologiesprachen nicht algorithmisch umsetzen – sie sind unentscheidbar. Die Suche nach &quot;guten&quot; 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.<br /> <br /> Ziel des Projekts DeciGUT ist die Schaffung einer vereinheitlichten Theorie der Entscheidbarkeit, welche dann wiederum die Definition neuer, fortgeschrittener Ontologiesprachen ermöglichen wird.<br /> <br /> 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.<br /> |Beschreibung EN=[[Datei:LOGO-ERC-small.jpg|200px|rahmenlos|rechts]]<br /> 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 &quot;meaning-aware&quot; handling of data.<br /> <br /> Unfortunately, reasoning in ontology languages of high expressivity is impossible to capture algorithmically – they are undecidable. Therefore, the quest for &quot;good&quot; 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.<br /> <br /> 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.<br /> <br /> 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.<br /> |Kontaktperson=Sebastian Rudolph<br /> |Start=2018/10/01<br /> |Ende=2025/03/31<br /> |Finanziert von=European Research Council<br /> |Projektstatus=abgeschlossen<br /> |Logo=DeciGUT-logo-final.png<br /> |Person=Sebastian Rudolph, Thomas Feller, Bartosz Bednarczyk, Tim Lyon, Piotr Ostropolski-Nalewaja<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Existenzielle Regeln<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}<br /> {{Forschungsgebiet Auswahl}}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Semantische Technologien<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Knowledge_Representation_(WS2025)&diff=43805 2025-12-27T18:05:36Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Knowledge Representation<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Jonas Karge<br /> |Term=WS<br /> |Year=2025<br /> |Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description==== Important Information Regarding Exercise Sessions ===<br /> 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] <br /> <br /> === Beginning of Semester ===<br /> <br /> The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).<br /> <br /> === Synopsis ===<br /> <br /> 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.<br /> <br /> === Exam ===<br /> <br /> To take an exam in the course, you must:<br /> <br /> # Register for the exam<br /> #* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly. <br /> # Apply for a date/time slot<br /> #* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS6<br /> |Download=Fkr-00-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS5<br /> |Download=Fkr-01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS6<br /> |Download=Fkr-02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS5<br /> |Download=KRR exercises 1 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS6<br /> |Download=Fkr-03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS5<br /> |Download=Fkr-04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS6<br /> |Download=Fkr-05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS5<br /> |Download=KRR exercises 2 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS6<br /> |Download=KRR exercises 3 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS5<br /> |Download=KRR exercises 4 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS6<br /> |Download=KRR exercises 5 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS5<br /> |Download=Fkr-06-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS6<br /> |Download=Fkr-07-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS5<br /> |Download=KRR exercises (7).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS6<br /> |Download=KRR exercises (9).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS5<br /> |Download=Fkr-08-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS5<br /> |Download=Fkr-09-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-02-02<br /> |DS=DS6<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-09-WS2025.pdf&diff=43804 2025-12-27T18:05:31Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Knowledge_Representation_(WS2025)&diff=43803 2025-12-27T18:04:17Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Knowledge Representation<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Jonas Karge<br /> |Term=WS<br /> |Year=2025<br /> |Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description==== Important Information Regarding Exercise Sessions ===<br /> 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] <br /> <br /> === Beginning of Semester ===<br /> <br /> The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).<br /> <br /> === Synopsis ===<br /> <br /> 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.<br /> <br /> === Exam ===<br /> <br /> To take an exam in the course, you must:<br /> <br /> # Register for the exam<br /> #* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly. <br /> # Apply for a date/time slot<br /> #* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS6<br /> |Download=Fkr-00-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS5<br /> |Download=Fkr-01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS6<br /> |Download=Fkr-02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS5<br /> |Download=KRR exercises 1 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS6<br /> |Download=Fkr-03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS5<br /> |Download=Fkr-04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS6<br /> |Download=Fkr-05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS5<br /> |Download=KRR exercises 2 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS6<br /> |Download=KRR exercises 3 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS5<br /> |Download=KRR exercises 4 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS6<br /> |Download=KRR exercises 5 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS5<br /> |Download=Fkr-06-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS6<br /> |Download=Fkr-07-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS5<br /> |Download=KRR exercises (7).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS6<br /> |Download=KRR exercises (9).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS5<br /> |Download=Fkr-08-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-02-02<br /> |DS=DS6<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Knowledge_Representation_(WS2025)&diff=43802 2025-12-27T17:59:01Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Knowledge Representation<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Jonas Karge<br /> |Term=WS<br /> |Year=2025<br /> |Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description==== Important Information Regarding Exercise Sessions ===<br /> 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] <br /> <br /> === Beginning of Semester ===<br /> <br /> The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).<br /> <br /> === Synopsis ===<br /> <br /> 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.<br /> <br /> === Exam ===<br /> <br /> To take an exam in the course, you must:<br /> <br /> # Register for the exam<br /> #* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly. <br /> # Apply for a date/time slot<br /> #* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS6<br /> |Download=Fkr-00-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS5<br /> |Download=Fkr-01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS6<br /> |Download=Fkr-02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS5<br /> |Download=KRR exercises 1 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS6<br /> |Download=Fkr-03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS5<br /> |Download=Fkr-04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS6<br /> |Download=Fkr-05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS5<br /> |Download=KRR exercises 2 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS6<br /> |Download=KRR exercises 3 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS5<br /> |Download=KRR exercises 4 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS6<br /> |Download=KRR exercises 5 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS5<br /> |Download=Fkr-06-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS6<br /> |Download=Fkr-07-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS5<br /> |Download=KRR exercises (7).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS6<br /> |Download=KRR exercises (9).pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-02-02<br /> |DS=DS6<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Introduction_to_Existential_Rules_(WS2025)&diff=43801 2025-12-27T17:55:22Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Introduction to Existential Rules<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |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.<br /> <br /> &lt;h4&gt;Prerequisites&lt;/h4&gt;<br /> *basic knowledge of propositional and first-order logic<br /> *some familiarity with computational complexity<br /> <br /> &lt;h4&gt;Organisation&lt;/h4&gt;<br /> The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.<br /> The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 1<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 2<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 3<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 4<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 5.a<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 5.b<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS2<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 6<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture06-WS2025.pdf<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture06-WS2025.pdf&diff=43800 2025-12-27T17:55:18Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Article3118&diff=43799 2025-12-22T09:20:37Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Manuel<br /> |ErsterAutorNachname=Bodirsky<br /> |FurtherAuthors=Simon Knäuer; Sebastian Rudolph<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic<br /> |To appear=1<br /> |Year=2025<br /> |Journal=ACM Transactions on Computational Logic<br /> |Publisher=ACM<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |Download=3779418.pdf<br /> |Link=https://dl.acm.org/doi/10.1145/3779418<br /> |DOI Name=10.1145/3779418<br /> |Projekt=DeciGUT<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-08-WS2025.pdf&diff=43767 2025-12-15T13:36:51Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Article3118&diff=43756 2025-12-12T16:17:19Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Manuel<br /> |ErsterAutorNachname=Bodirsky<br /> |FurtherAuthors=Simon Knäuer; Sebastian Rudolph<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic<br /> |To appear=1<br /> |Year=2025<br /> |Journal=ACM Transactions on Computational Logic<br /> |Publisher=ACM<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |Download=3779418.pdf<br /> |Link=https://dl.acm.org/doi/10.1145/3779418<br /> |DOI Name=10.1145/3779418<br /> |Projekt=DeciGUT<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Article3118&diff=43755 2025-12-12T16:13:16Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Manuel<br /> |ErsterAutorNachname=Bodirsky<br /> |FurtherAuthors=Simon Knäuer; Sebastian Rudolph<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic<br /> |To appear=1<br /> |Year=2025<br /> |Journal=ACM Transactions on Computational Logic<br /> |Publisher=ACM<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |Download=3779418.pdf<br /> |Link=https://dl.acm.org/doi/10.1145/3779418<br /> |DOI Name=10.1145/3779418<br /> |Projekt=DeciGUT<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Article3118&diff=43754 2025-12-12T16:10:19Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Manuel<br /> |ErsterAutorNachname=Bodirsky<br /> |FurtherAuthors=Simon Knäuer; Sebastian Rudolph<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic<br /> |To appear=1<br /> |Year=2025<br /> |Journal=ACM Transactions on Computational Logic<br /> |Publisher=ACM<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |Download=3779418.pdf<br /> |Link=https://dl.acm.org/doi/10.1145/3779418<br /> |DOI Name=10.1145/3779418<br /> |Projekt=DeciGUT<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Article3118&diff=43753 2025-12-12T16:07:58Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Manuel<br /> |ErsterAutorNachname=Bodirsky<br /> |FurtherAuthors=Simon Knäuer; Sebastian Rudolph<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic<br /> |To appear=1<br /> |Year=2025<br /> |Journal=ACM Transactions on Computational Logic<br /> |Publisher=ACM<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |Download=3779418.pdf<br /> |Link=https://dl.acm.org/doi/10.1145/3779418<br /> |DOI Name=10.1145/3779418<br /> |Projekt=DeciGUT<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:3779418.pdf&diff=43752 2025-12-12T16:06:39Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Article3118&diff=43745 2025-12-10T17:04:36Z

<p>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…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Manuel<br /> |ErsterAutorNachname=Bodirsky<br /> |FurtherAuthors=Simon Knäuer; Sebastian Rudolph<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Datalog-Expressibility for Monadic and Guarded Second-Order Logic<br /> |To appear=1<br /> |Year=2025<br /> |Journal=ACM Transactions on Computational Logic<br /> |Publisher=ACM<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |DOI Name=10.1145/3779418<br /> |Projekt=DeciGUT<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Computational Logic<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Introduction_to_Existential_Rules_(WS2025)&diff=43632 2025-11-24T13:33:50Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Introduction to Existential Rules<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |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.<br /> <br /> &lt;h4&gt;Prerequisites&lt;/h4&gt;<br /> *basic knowledge of propositional and first-order logic<br /> *some familiarity with computational complexity<br /> <br /> &lt;h4&gt;Organisation&lt;/h4&gt;<br /> The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.<br /> The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 1<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 2<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 3<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 4<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 5<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 6<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS2<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Knowledge_Representation_(WS2025)&diff=43619 2025-11-21T22:00:57Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Knowledge Representation<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Jonas Karge<br /> |Term=WS<br /> |Year=2025<br /> |Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description==== Important Information Regarding Exercise Sessions ===<br /> 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] <br /> <br /> === Beginning of Semester ===<br /> <br /> The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).<br /> <br /> === Synopsis ===<br /> <br /> 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.<br /> <br /> === Exam ===<br /> <br /> To take an exam in the course, you must:<br /> <br /> # Register for the exam<br /> #* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly. <br /> # Apply for a date/time slot<br /> #* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS6<br /> |Download=Fkr-00-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS5<br /> |Download=Fkr-01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS6<br /> |Download=Fkr-02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS5<br /> |Download=KRR exercises 1 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS6<br /> |Download=Fkr-03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS5<br /> |Download=Fkr-04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS6<br /> |Download=Fkr-05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS5<br /> |Download=KRR exercises 2 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS6<br /> |Download=KRR exercises 3 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS5<br /> |Download=KRR exercises 4 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS6<br /> |Download=KRR exercises 5 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS5<br /> |Download=Fkr-06-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS6<br /> |Download=Fkr-07-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-02-02<br /> |DS=DS6<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-07-WS2025.pdf&diff=43618 2025-11-21T22:00:51Z

<p>Sebastian Rudolph: Sebastian Rudolph lud eine neue Version von Datei:Fkr-07-WS2025.pdf hoch</p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-06-WS2025.pdf&diff=43617 2025-11-21T21:59:53Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-07-WS2025.pdf&diff=43616 2025-11-21T21:59:10Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3421&diff=43582 2025-11-17T04:03:15Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Lucía<br /> |ErsterAutorNachname=Gómez Álvarez<br /> |FurtherAuthors=Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic<br /> |To appear=0<br /> |Year=2025<br /> |Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning<br /> |Pages=366–375<br /> |Publisher=IJCAI Organization<br /> |Editor=Magdalena Ortiz, Renata Wassermann, Torsten Schaub<br /> }}<br /> {{Publikation Details<br /> |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. &lt;br&gt;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.&lt;br&gt;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.&lt;br&gt;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.<br /> |ISBN=978-1-956792-08-9<br /> |ISSN=2334-1033<br /> |Download=GAR-KE-2025-StandpointC2.pdf<br /> |Slides=KR2025-Standpoint-C2.pdf<br /> |Link=https://proceedings.kr.org/2025/36/<br /> |DOI Name=10.24963/kr.2025/36<br /> |Projekt=CPEC, SECAI, ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Semantische Technologien<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:KR2025-Standpoint-C2.pdf&diff=43581 2025-11-17T04:03:10Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3449&diff=43578 2025-11-16T04:25:35Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Simon<br /> |ErsterAutorNachname=Hosemann<br /> |FurtherAuthors=Jean Christoph Jung; Carsten Lutz; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Fitting Ontologies and Constraints to Relational Structures<br /> |To appear=0<br /> |Year=2025<br /> |Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning<br /> |Pages=407–416<br /> |Publisher=IJCAI Organization<br /> |Editor=Magdalena Ortiz, Renata Wassermann, Torsten Schaub<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |ISBN=978-1-956792-08-9<br /> |ISSN=2334-1033<br /> |Download=Kr2025-0040-hosemann-et-al.pdf<br /> |Link=https://proceedings.kr.org/2025/40/<br /> |DOI Name=10.24963/kr.2025/40<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Existenzielle Regeln<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3421&diff=43577 2025-11-16T04:25:31Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Lucía<br /> |ErsterAutorNachname=Gómez Álvarez<br /> |FurtherAuthors=Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic<br /> |To appear=0<br /> |Year=2025<br /> |Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning<br /> |Pages=366–375<br /> |Publisher=IJCAI Organization<br /> |Editor=Magdalena Ortiz, Renata Wassermann, Torsten Schaub<br /> }}<br /> {{Publikation Details<br /> |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. &lt;br&gt;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.&lt;br&gt;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.&lt;br&gt;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.<br /> |ISBN=978-1-956792-08-9<br /> |ISSN=2334-1033<br /> |Download=GAR-KE-2025-StandpointC2.pdf<br /> |Link=https://proceedings.kr.org/2025/36/<br /> |DOI Name=10.24963/kr.2025/36<br /> |Projekt=CPEC, SECAI, ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Semantische Technologien<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3449&diff=43575 2025-11-16T04:20:41Z

<p>Sebastian Rudolph: Die Seite wurde neu angelegt: „{{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 }} {{Publikation Details |Abstract=We study the pro…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Simon<br /> |ErsterAutorNachname=Hosemann<br /> |FurtherAuthors=Jean Christoph Jung; Carsten Lutz; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Fitting Ontologies and Constraints to Relational Structures<br /> |To appear=0<br /> |Year=2025<br /> |Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning<br /> |Pages=407–416<br /> }}<br /> {{Publikation Details<br /> |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.<br /> |ISBN=978-1-956792-08-9<br /> |ISSN=2334-1033<br /> |Download=Kr2025-0040-hosemann-et-al.pdf<br /> |Link=https://proceedings.kr.org/2025/40/<br /> |DOI Name=10.24963/kr.2025/40<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Existenzielle Regeln<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Kr2025-0040-hosemann-et-al.pdf&diff=43574 2025-11-16T04:20:37Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3421&diff=43573 2025-11-16T04:12:17Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Lucía<br /> |ErsterAutorNachname=Gómez Álvarez<br /> |FurtherAuthors=Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic<br /> |To appear=0<br /> |Year=2025<br /> |Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning<br /> |Pages=366–375<br /> |Editor=Magdalena Ortiz, Renata Wassermann, Torsten Schaub<br /> }}<br /> {{Publikation Details<br /> |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. &lt;br&gt;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.&lt;br&gt;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.&lt;br&gt;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.<br /> |ISBN=978-1-956792-08-9<br /> |ISSN=2334-1033<br /> |Download=GAR-KE-2025-StandpointC2.pdf<br /> |Link=https://proceedings.kr.org/2025/36/<br /> |DOI Name=10.24963/kr.2025/36<br /> |Projekt=CPEC, SECAI, ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Semantische Technologien<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Knowledge_Representation_(WS2025)&diff=43466 2025-11-01T15:31:50Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Knowledge Representation<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Jonas Karge<br /> |Term=WS<br /> |Year=2025<br /> |Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description==== Beginning of Semester ===<br /> <br /> The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).<br /> <br /> === Synopsis ===<br /> <br /> 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.<br /> <br /> === Exam ===<br /> <br /> To take an exam in the course, you must:<br /> <br /> # Register for the exam<br /> #* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly. <br /> # Apply for a date/time slot<br /> #* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS6<br /> |Download=Fkr-00-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS5<br /> |Download=Fkr-01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS6<br /> |Download=Fkr-02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS5<br /> |Download=KRR exercises 1 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS6<br /> |Download=Fkr-03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS5<br /> |Download=Fkr-04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS6<br /> |Download=Fkr-05-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS5<br /> |Download=KRR exercises 2 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS6<br /> |Download=KRR exercises 3 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-02-02<br /> |DS=DS6<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-05-WS2025.pdf&diff=43465 2025-11-01T15:31:43Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-04-WS2025.pdf&diff=43464 2025-11-01T15:31:10Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Introduction_to_Existential_Rules_(WS2025)&diff=43463 2025-11-01T15:02:01Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Introduction to Existential Rules<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |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.<br /> <br /> &lt;h4&gt;Prerequisites&lt;/h4&gt;<br /> *basic knowledge of propositional and first-order logic<br /> *some familiarity with computational complexity<br /> <br /> &lt;h4&gt;Organisation&lt;/h4&gt;<br /> The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.<br /> The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 1<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 2<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 3<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 4<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture04-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 5<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS1<br /> |Download=ER-Rudolph-Lecture05-WS2025.pdf<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture05-WS2025.pdf&diff=43462 2025-11-01T15:01:57Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture04-WS2025.pdf&diff=43461 2025-11-01T15:00:12Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Knowledge_Representation_(WS2025)&diff=43419 2025-10-25T21:01:45Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Knowledge Representation<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Jonas Karge<br /> |Term=WS<br /> |Year=2025<br /> |Module=CMS-LM-BAS, INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description==== Beginning of Semester ===<br /> <br /> The first lecture will take place on Monday 13 October in room APB E005 at 16:40 (DS6).<br /> <br /> === Synopsis ===<br /> <br /> 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.<br /> <br /> === Exam ===<br /> <br /> To take an exam in the course, you must:<br /> <br /> # Register for the exam<br /> #* Registration and registration deadlines may depend on your program of study. Make sure you know your particular requirements ahead of time and register accordingly. <br /> # Apply for a date/time slot<br /> #* write an e-mail to [mailto:cl@tu-dresden.de cl@tu-dresden.de] asking for a slot.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS6<br /> |Download=Fkr-00-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS5<br /> |Download=Fkr-01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS6<br /> |Download=Fkr-02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Logics for Knowledge Representation<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS5<br /> |Download=KRR exercises 1 25.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS6<br /> |Download=Fkr-03-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Horn Logics and Datalog<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics I<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Syntax and Semantics II<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Description Logics – Reasoning with Data<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning I<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Nonmonotonic Reasoning II<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Exercise Sessions<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No Lecture<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Inconsistency Handling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Argumentation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Uncertainty<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=TBA<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-02-02<br /> |DS=DS6<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Fkr-03-WS2025.pdf&diff=43418 2025-10-25T21:01:37Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Introduction_to_Existential_Rules_(WS2025)&diff=43417 2025-10-25T20:51:47Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Introduction to Existential Rules<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |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.<br /> <br /> &lt;h4&gt;Prerequisites&lt;/h4&gt;<br /> *basic knowledge of propositional and first-order logic<br /> *some familiarity with computational complexity<br /> <br /> &lt;h4&gt;Organisation&lt;/h4&gt;<br /> The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.<br /> The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 1<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 2<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture02-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 3<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture03-WS2025.pdf<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture03-WS2025.pdf&diff=43416 2025-10-25T20:51:38Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=SECAI&diff=43415 2025-10-25T14:06:30Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Projekt<br /> |Kurzname=SECAI<br /> |Name=School of Embedded Composite Artificial Intelligence<br /> |Name EN=School of Embedded Composite Artificial Intelligence<br /> |Beschreibung DE=Die School of Embedded Composite Artificial Intelligence (kurz: SECAI) ist eine der drei durch den DAAD geförderten Zuse Schools zur Stärkung von Ausbildung und Forschung im Bereich der Künstlichen Intelligenz (KI) in Deutschland. Das Konzept der Projektpartner TU Dresden und Universität Leipzig beruht auf der engen Verzahnung von Studium, Forschung und Anwendung, welche jungen Talenten vielfältige Karrierewege eröffnet um KI in Gesellschaft und Wirtschaft erfolgreich zu nutzen und weiter zu entwickeln. Fachlich setzt SECAI dabei zwei Schwerpunkte: die Entwicklung neuer KI-Methoden durch Zusammenführung der Vorteile bisher unvereinbarer Ansätze („composite“) und die Einbettung von KI-Algorithmen in maßgeschneiderte Mikroelektronik und intelligente Geräte („embedded“). Die exzellent ausgewiesene, interdisziplinäre KI-Forschung der beiden Partneruniversitäten ergänzt sich hierbei ideal mit den besonderen Stärken der sächsischen Hochtechnologiestandorte Dresden und Leipzig.<br /> <br /> Unter den vielfältigen Anwendungsgebieten der KI konzentriert sich SECAI besonders auf die digitale Medizin. Chancen entstehen hier einerseits durch die Entwicklung intelligenter Medizingeräte, vom chirurgischen Assistenzroboter bis zum intelligenten Herzschrittmacher. Andererseits ermöglicht KI bedeutende Fortschritte in der Medizin- und Bioinformatik, zum Beispiel zur Entwicklung personalisierter Medikamente und der verbesserten Krebsdiagnostik. Der Einsatz von KI in der Medizin wirft dabei nicht nur technische sondern auch rechtliche und ethische Fragen auf, die in SECAI ebenfalls thematisiert werden.<br /> <br /> Diese Kernthemen bestimmen die inhaltliche Ausrichtung zahlreicher der in SECAI geplanten Aktivitäten zur Förderung von Lehre, Forschung, Transfer und internationalem Austausch. Studierende an TU Dresden und Universität Leipzig werden durch Stipendien finanziell gefördert und beim Austausch mit Partnern aus Wirtschaft und Forschung unterstützt. KI‑bezogene Lehrangebote werden gestärkt und erweitert. Der Austausch mit internationalen Partneruniversitäten wie King‘s College London, ENS Paris und TU Wien wird vertieft. Gleichzeitig finanziert SECAI die Forschung von jeweils bis zu 30 Promovierenden und klinischen Forscher:innen an den KI‑Technologien von morgen. Der DAAD stellt für diese Maßnahmen von Mitte 2022 bis Ende 2027 insgesamt 13,2 Millionen EUR zur Verfügung.<br /> <br /> SECAI wird dabei auch die bereits vorhandenen Lehrangebote und Forschungsaktivitäten in Dresden und Leipzig einbeziehen und befördern. Bereits eingeschriebene Studierende in KI‑Studiengängen wie „Computational Modeling and Simulation“ (Dresden) oder „Data Science“ (Leipzig) profitieren ebenso von den Angeboten der Zuse School wie jene, die sich erst neu für das Studium in Dresden oder Leipzig entscheiden. Auch in der Forschung kooperiert SECAI eng mit existierenden Initiativen, wie dem Else-Kröner-Fresenius-Zentrum für Digitale Gesundheit (EKFZ), dem Dresdner Exzellenzcluster CeTI und dem [[ScaDS.AI|Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI Dresden-Leipzig)]]. <br /> <br /> Getragen wird die Zuse School von einem Team aus etwa 25 Forscherinnen und Forschern der Partneruniversitäten, die wissenschaftlich international hervorragend ausgewiesen sind und sich darüber hinaus besonders in Lehre und Transfer engagieren. SECAI steht außerdem in engem persönlichen Austausch mit Industrie, internationaler Wissenschaft und Start-Up-Szene. Ansprechpartner für die School of Embedded Composite AI ist Projektleiter Prof. [[Markus Krötzsch]] (TU Dresden).<br /> |Beschreibung EN=The School of Embedded Composite Artificial Intelligence (SECAI) is one of the three DAAD-funded Zuse Schools that foster education and research in artificial intelligence (AI) in Germany. The concept put forward by the SECAI host universities TU Dresden and Leipzig University is rooted in the tight integration of university studies, research, and applications, which will open up many career paths for young talents to successfully use and advance AI for the benefit of society and economy. Topically, SECAI is guided by two core themes: the development of novel AI methods that combine advantages of hitherto disparate approaches (“composite”), and the integration of AI algorithms into tailor-made microelectronics and intelligent devices (“embedded”). In pursuing these goals, SECAI benefits from the fruitful combination of the internationally renowned, interdisciplinary research of the parter universities and the regional strengths of the Saxon high-tech sites in Dresden and Leipzig.<br /> <br /> Among the many application areas of AI, SECAI will put a specific emphasis on digital medicine. Important opportunities in this field arise, on the one hand, through the development of intelligent medical devices, from surgical robotic assistants to intelligent pacemakers. On the other hand, AI also enables important advances in medical informatics and bioinformatics, for example in the development of personalised drugs and improved cancer diagnostics. However, the medical use of AI is not a mere technical challenge but also raises legal and ethical questions, which will likewise be investigated in SECAI.<br /> These core topics determine the thematic focus of many of the activities that are planned in SECAI to foster teaching, research, transfer, and international exchange. Students of TU Dresden and Leipzig University are sponsored through scholarships and are supported in their exchange with partners from industry and research. AI-related teaching programmes will be reinforced and expanded. TU Dresden has already fully internationalised all of its AI Master programmes, with English as the teaching language, and Leipzig University will strongly expand its English course offerings as well. The exchange with international partner universities, such as King’s College London, ENS Paris, and TU Vienna will be intensified. In addition, SECAI will fund up to 30 doctoral students and clinician scientists to develop the next generation of AI technologies. To enable these measures, DAAD will provide a total of 13.2 million EUR throughout the planned funding period from mid 2022 through 2027.<br /> <br /> In all of its activities, SECAI will also incorporate and nourish existing teaching programmes and research activities in Dresden and Leipzig. Students already enrolled in AI-related study programmes such as “Computational Modeling and Simulation” (Dresden) or “Data Science” (Leipzig) will benefit from the offers of the Zuse School just like students who newly decide to study in Dresden or Leipzig. In research, too, SECAI is collaborating closely with existing initiatives, such as the Else Kröner Fresenius Center for Digital Health (EKFZ), the Dresden-based Cluster of Excellence CeTI, and the [[ScaDS.AI/en|Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI Dresden-Leipzig)]].<br /> <br /> The Zuse School is carried by a team of around 25 researchers at the partner universities, who are, in addition to their international scientific renown, particularly active in teaching and transfer. SECAI moreover is engaged in close personal exchange with industry, international academia, and the start-up scene. The main contact person for the School of Embedded Composite AI is project coordinator Prof. [[Markus Krötzsch/en|Markus Krötzsch]] (TU Dresden).<br /> |Kontaktperson=Markus Krötzsch, Philipp Hanisch<br /> |URL=https://secai.org<br /> |Start=2022/07/01<br /> |Ende=2027/12/31<br /> |Finanziert von=German Academic Exchange Service (DAAD)<br /> |Projektstatus=aktiv<br /> |Logo=SECAI-SQUARE-SHORT.pdf<br /> |Person=Markus Krötzsch, Sebastian Rudolph, Christel Baier, Rajab Aghamov, Philipp Hanisch, Jonas Karge, Nils Küchenmeister, Pascal Kettmann, Christina Norkus<br /> |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik, Computational Logic, Wissensbasierte Systeme<br /> |Partner=Universität Leipzig<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Existenzielle Regeln<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Nichtmonotones Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Verstehen natürlicher Sprache<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Semantische Technologien<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Sebastian_Rudolph&diff=43394 2025-10-22T17:46:46Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Sebastian<br /> |Nachname=Rudolph<br /> |Akademischer Titel=Prof. Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Professor<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 38516<br /> |Fax=+49 351 463 32827<br /> |Email=sebastian.rudolph@tu-dresden.de<br /> |Sekretariat Mail=cl@tu-dresden.de<br /> |Raum=APB 2035<br /> |Bild=SR2019-webseite.png<br /> |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. <br /> <br /> 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].<br /> |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&amp;ln=en&amp;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.<br /> <br /> 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].<br /> |DBLP=https://dblp.uni-trier.de/pid/79/6633.html<br /> |Google Scholar=http://scholar.google.de/citations?user=b3qVb6IAAAAJ&amp;hl=en<br /> |Alternative URI=http://sebastian-rudolph.de<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> |Projekte anzeigen=0<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Datenbanktheorie<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Beschreibungslogiken<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Existenzielle Regeln<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Formale Begriffsanalyse<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Semantische Technologien<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Constraint Satisfaction Problems<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Verstehen natürlicher Sprache<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Multiagentensysteme<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Introduction_to_Existential_Rules_(WS2025)&diff=43350 2025-10-17T18:07:59Z

<p>Sebastian Rudolph: </p> <hr /> <div>{{Vorlesung<br /> |Title=Introduction to Existential Rules<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-VERT2, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |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.<br /> <br /> &lt;h4&gt;Prerequisites&lt;/h4&gt;<br /> *basic knowledge of propositional and first-order logic<br /> *some familiarity with computational complexity<br /> <br /> &lt;h4&gt;Organisation&lt;/h4&gt;<br /> The first lecture will be on Monday, 13th October 2025, 9:20-10:50 (DS 2) in room APB E005.<br /> The lecture is scheduled for Mondays, 9:20-10:50 (DS 2) in room APB E005 on the dates indicated in the schedule.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 1<br /> |Room=APB E005<br /> |Date=2025-10-13<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture01-WS2025.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Lecture 2<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS2<br /> |Download=ER-Rudolph-Lecture02-WS2025.pdf<br /> }}</div>

Sebastian Rudolph https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ER-Rudolph-Lecture02-WS2025.pdf&diff=43349 2025-10-17T18:07:54Z

<p>Sebastian Rudolph: </p> <hr /> <div></div>

Sebastian Rudolph