2026-10-04T13:10:43Z

Sebastian Rudolph:

{{Vorlesung
|Title=Seminar „Knowledge Representation“
|Research group=Computational Logic
|Lecturers=Sebastian Rudolph
|Term=WS
|Year=2026
|Module=INF-25-Ma-FTK-Sem
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|Exam type=nach Modulbeschreibung
|Description=This seminar deals with traditional topics in the field of Knowledge Representation and Reasoning.

=== Registration ===

To register for this seminar, please complete the poll available [[here https://bildungsportal.sachsen.de/umfragen/limesurvey/index.php/322922?lang=en]] by October 18, 2026. Seminar places for the module INF-25-Ma-FTK-Sem “Seminar Theoretical Computer Science and Symbolic AI" will be assigned based on the preferences indicated in this form.

=== Prerequisites ===

For the seminar, profound knowledge in theoretical computer science and logics is presumed.

=== Dates ===

The first get-together will be on Monday, the 19th of October. At this date the topics will be introduced and the process of the seminar explained. Consecutively, each participant will then be assigned a topic.
The required presentations and question-and-answer sessions will be held during the lecture period of the semester. The specific dates of the talks will be announced later.

=== Examination ===

'''Master Computer Science (PO 2025)'''
* {{ModuleLink|INF-25-Ma-FTK-Sem}}: ''Komplexe Leistung'' (40 hours)

'''Diplom Informatik (PO 2025)'''
* {{ModuleLink|INF-25-Ma-FTK-Sem}}: ''Komplexe Leistung'' (40 hours)

The ''Komplexe Leistung'' (complex or multi-part examination) consists of a presentation (45 minutes) and an oral question-and-answer session (15 minutes).

=== Contact ===

In case of organizational questions, please send an e-mail to [mailto:sebastian.rudolph@tu-dresden.de sebastian.rudolph@tu-dresden.de].
|Title_EN=Seminar “Knowledge Representation”
|Language=EN
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Introduction
|Room=APB E005
|Date=2026-10-19
|DS=DS6
|Download=KRR Seminar Talk Outlines and Bibliography.pdf
}}

Seminar Knowledge Representation (WS2026)

2026-09-27T17:22:59Z

Sebastian Rudolph:

Seminar Knowledge Representation (WS2026)

2026-09-26T09:56:19Z

Sebastian Rudolph:

2026-09-25T10:26:40Z

Sebastian Rudolph:

Seminar Knowledge Representation (WS2026)

2026-09-23T19:08:06Z

Sebastian Rudolph:

Seminar Knowledge Representation (WS2026)

2026-09-23T19:01:22Z

Sebastian Rudolph:

2026-08-05T00:11:42Z

Sebastian Rudolph:

Inproceedings3475

2026-08-05T00:10:23Z

Sebastian Rudolph:

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

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

Inproceedings3475

2026-08-05T00:09:40Z

Sebastian Rudolph:

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

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

Inproceedings3475

2026-08-05T00:09:21Z

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

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

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

Sebastian Rudolph

2026-08-01T12:55:05Z

Sebastian Rudolph:

{{Mitarbeiter
|Vorname=Sebastian
|Nachname=Rudolph
|Akademischer Titel=Prof. Dr.
|Forschungsgruppe=Computational Logic
|Stellung=Professor
|Ehemaliger=0
|Telefon=+49 351 463 38516
|Fax=+49 351 463 32827
|Email=sebastian.rudolph@tu-dresden.de
|Sekretariat Mail=cl@tu-dresden.de
|Raum=APB 2035
|Bild=SR2019-webseite.png
|Info=Ich bin seit April 2013 Professor für [[Computational Logic]] am [https://tu-dresden.de/ing/informatik/ki Institut für Künstliche Intelligenz] der [http://inf.tu-dresden.de Fakultät Informatik] der [https://tu-dresden.de Technischen Universität Dresden], seit 2021 auch Zweitmitglied der [https://tu-dresden.de/mn/math Fakultät Mathematik]. Meine Forschungsinteressen umfassen Künstliche Intelligenz, insbesondere [[Wissensrepräsentation und logisches Schließen]] mithilfe diverser Formalismen (u.a. [[Beschreibungslogiken]], [[Existenzielle Regeln]] und [[Formale Begriffsanalyse]]) und ihren Anwendungen beispielsweise im Bereich [[Semantische Technologien|Semantischer Technologien]]. Dabei befasse ich mich mit Fragestellungen die von den theoretischen Grundlagen (z.B. Entscheidbarkeit und Komplexität von Inferenzproblemen) bis hin zum praktischen Einsatz (Ontologiemodellierung, interaktive Wissensakquise) reichen. 2017 erhielt ich ein [[News34|ERC Consolidator Grant]], im Rahmen dessen ich mich mit allgemeinen Prinzipien der Entscheidbarkeit in der logikbasierten Wissensrepräsentation befasste.

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

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

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

Before returning to Dresden, I spend the years 2006 to 2013 as a postdoctoral researcher, project leader and later Privatdozent in [http://en.wikipedia.org/wiki/Rudi_Studer Rudi Studer]'s [http://www.aifb.kit.edu/web/Wissensmanagement/en Knowledge Management group] at the [http://www.aifb.kit.edu/web/Hauptseite/en Institute AIFB] of the [http://www.kit.edu/english/index.php Karlsruhe Institute of Technology], where I obtained my habilitation in 2011. Before I had completed my PhD in Algebra and my studies for highschool teaching in mathematics, physics and computer science at the [http://tu-dresden.de/en TU Dresden].
|DBLP=https://dblp.uni-trier.de/pid/79/6633.html
|Google Scholar=http://scholar.google.de/citations?user=b3qVb6IAAAAJ&hl=en
|Alternative URI=http://sebastian-rudolph.de
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
|Projekte anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Formale Begriffsanalyse
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Semantische Technologien
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Constraint Satisfaction Problems
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Automatentheorie und formale Sprachen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Verstehen natürlicher Sprache
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Multiagentensysteme
}}

Sebastian Rudolph

2026-08-01T12:53:49Z

Sebastian Rudolph:

CPEC

2026-07-28T14:40:52Z

Sebastian Rudolph:

{{Projekt
|Kurzname=CPEC
|Name=Grundlagen verständlicher Softwaresysteme
|Name EN=Center for Perspicuous Computing
|Beschreibung DE=Der Sonderforschungsbereich 248 '''Grundlagen verständlicher Softwaresysteme''' (Center for Perspicuous Computing, CPEC) zielt darauf ab, die cyber-physikalische Welt für Menschen nachvollziehbar zu gestalten.

Computergestützte Systeme treffen zunehmend Entscheidungen, die Auswirkungen auf den Menschen haben. Darum
müssen sie in der Lage sein, dem Menschen zu kommunizieren, wie einzelne Entscheidungen zustande kommen. Der
SFB/Transregio „Grundlagen verständlicher Softwaresysteme – Für eine nachvollziehbare cyber-physische Welt“
widmet sich den wissenschaftlichen Grundlagen nachvollziehbarer Software. Die neu gewonnenen Erkenntnisse werden
in die Entwicklung softwarebasierter Systeme einfließen, die vorhersagbar und nachvollziehbar agieren.
|Beschreibung EN=The Transregional Collaborative Research Centre 248 '''Center for Perspicuous Computing''' (CPEC) aims at enabling comprehension in a cyber-physical world with the human in the loop.

From autonomous vehicles to Industry 4.0, from smart homes to smart cities – increasingly computer programs participate in actions and decisions that affect humans. However, our understanding of how these applications interact and what is the cause of a specific automated decision is lagging far behind. With the increase in cyber-physical technology impacting our lives, the consequences of this gradual loss in understanding are becoming severe. Systems lack support for making their behaviour plausible to their users. And even for technology experts it is nowadays virtually impossible to provide scientifically well-founded answers to questions about the exact reasons that lead to a particular decision, or about the responsibility for a malfunctioning. The root cause of the problem is that contemporary systems do not have any built-in concepts to explicate their behaviour. They calculate and propagate outcomes of computations, but are not designed to provide explanations. They are not perspicuous.

The key to enable comprehension in a cyber-physical world is a science of perspicuous computing, and it is the overarching goal of CPEC to develop the necessary tools and methods to support this. To this end, CPEC brings together researchers from formal methods, artificial intelligence, and human-computer interaction in a closely connected consortium of researchers from TU Dresden, Saarland University, and selected partners at two Max-Planck Institutes and the University of Tübingen.
|Kontaktperson=Raimund Dachselt
|URL=https://perspicuous-computing.science/
|Start=2019/01/01
|Ende=2026/12/31
|Finanziert von=DFG
|Projektstatus=aktiv
|Logo=CPEC-logo.png
|Person=Franz Baader, Christel Baier, Stefan Borgwardt, Markus Krötzsch, Ali Elhalawati, Irina Dragoste, Lukas Gerlach, Stephan Mennicke, Simon Razniewski, Sebastian Rudolph
|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik, Automatentheorie, Computational Logic, Knowledge-aware Artificial Intelligence, Wissensbasierte Systeme
|Partner=Universität des Saarlandes, Max-Planck-Institut für Softwaresysteme, Max-Planck-Institut für Informatik
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Beschreibungslogiken
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Semantische Technologien
}}

News112

2026-07-15T15:28:17Z

Sebastian Rudolph:

{{Neuigkeit
|Titel DE=Jonas Karge verteidigt erfolgreich seine Dissertation über Multi-Agent Belief Management
|Titel EN=Jonas Karge Successfully Defends PhD Thesis on Multi-Agent Belief Management
|Beschreibung DE=Wir freuen uns, bekannt geben zu dürfen, dass Jonas Karge seine Dissertation mit dem Titel „Multi-Agent Belief Management" erfolgreich verteidigt hat. In seiner Arbeit untersuchte Jonas, wie Gruppen zu verlässlichen Schlussfolgerungen gelangen können, wenn individuelle Urteile unsicher, qualitativ ungleich oder durch gemeinsame Verzerrungen geprägt sind. Seine Arbeit entwickelt mathematische Modelle, die erklären, wann kollektive Entscheidungen trotz unterschiedlicher Expertise, Abhängigkeiten zwischen Abstimmenden und unvollständiger Informationen die Wahrheit noch nachverfolgen können.
<br>

Die Dissertation führt darüber hinaus neue Methoden zur Kombination impräziser Wahrscheinlichkeitsschätzungen ein und untersucht, wie Faktoren wie Diversität, geteilter Einfluss und Aggregationsdesign die Genauigkeit und Robustheit von Gruppenentscheidungen beeinflussen. Die Arbeit wurde durch SECAI (School of Embedded Composite AI) und den DAAD (Deutscher Akademischer Austauschdienst) gefördert. Wir gratulieren Dr. Karge herzlich und wünschen ihm für alle zukünftigen Vorhaben viel Erfolg.

Siehe auch weitere Beiträge hierzu:
* [https://bsky.app/profile/clgroup-tud.bsky.social/post/3mq2nqeo5yk2l Bluesky]
* [https://www.linkedin.com/feed/update/urn:li:activity:7479343403340627968 LinkedIn]
* [https://secai.org/content/news/106 SECAI News]
|Beschreibung EN=We are pleased to announce that Jonas Karge has successfully defended his doctoral thesis entitled "Multi-Agent Belief Management." In his dissertation, Jonas investigated how groups can reach reliable conclusions when individual judgments are uncertain, uneven in quality, or shaped by shared bias. His work develops mathematical models that explain when collective decisions can still track the truth despite differences in expertise, dependence between voters, and incomplete information.
<br>

The thesis also introduces new methods for combining imprecise probability estimates and studies how factors such as diversity, shared influence, and aggregation design affect the accuracy and robustness of group decisions. The work was funded by SECAI (School of Embedded Composite AI) and DAAD (German Academic Exchange Service). We extend our warmest congratulations to Dr. Karge and wish him every success in his future endeavors.

See also our posts about this on social media:
* [https://bsky.app/profile/clgroup-tud.bsky.social/post/3mq2nqeo5yk2l Bluesky]
* [https://www.linkedin.com/feed/update/urn:li:activity:7479343403340627968 LinkedIn]
* [https://secai.org/content/news/106 SECAI News]
|Datum=2026-07-07
|Bild=1783214424880.jpg
|Forschungsgruppe=Computational Logic
}}

Computational Logic

2026-06-25T07:53:56Z

Sebastian Rudolph:

{{Forschungsgruppe
|Name EN=Computational Logic
|Kurzname=CL
|Beschreibung DE=Die Forschungsgruppe Computational Logic (CL) befasst sich mit Modellierung und automatischem Schließen in der logikbasierten Wissensrepräsentation. Dabei gilt unser Interesse sowohl den mathematischen und formalen Grundlagen diverser Paradigmen der Wissensrepräsentation als auch deren Anwendungen in Gebieten wie dem Semantic Web, Wissensakquise, Argumentation, etc.
Inspiriert durch diesen Gebieten entstammende Fragestellungen befassen wir uns auch mit Themen aus angrenzenden Forschungsfeldern wie beispielsweise Datenbanktheorie und Computerlinguistik.<br>
Die Computational Logic Group ist außerdem auf [https://www.linkedin.com/company/computational-logic-group-tu-dresden/ LinkedIn], [https://www.facebook.com/computational.logic.group Facebook], [https://bsky.app/profile/clgroup-tud.bsky.social Bluesky] und [https://www.youtube.com/c/ComputationalLogicGroupTUDresden YouTube] präsent.
|Beschreibung EN=The Computational Logic (CL) group is focusing on modeling and reasoning aspects of logic-based knowledge representation. We are interested both in the mathematical and formal foundations of diverse knowledge representation paradigms but also in their application in areas like the Semantic Web, knowledge acquisition, argumentation, etc. Motivated by requirements encountered in these fields, we also conduct research in adjacent areas like database theory and computational linguistics.<br>
The Computational Logic Group also has a [https://www.linkedin.com/company/computational-logic-group-tu-dresden/ LinkedIn page], a [https://www.facebook.com/computational.logic.group Facebook page], a [https://bsky.app/profile/clgroup-tud.bsky.social Bluesky account], and a [https://www.youtube.com/c/ComputationalLogicGroupTUDresden YouTube channel].
|Forschungsgruppenleiter=Sebastian Rudolph
|Sekretariat Mail=cl@tu-dresden.de
|Bild=CLG-zoom.png
|Logo=CLGroup-big.png
|Ehemalige Forschungsgruppe=0
}}

Inproceedings3471

2026-06-20T19:32:26Z

Sebastian Rudolph: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Nicholas |ErsterAutorNachname=Leisegang |FurtherAuthors=Thomas Meyer; Sebastian Rudolph }} {{Inproceedings |Referiert=1 |Title=Standpoint Logics with Defeasible Beliefs |To appear=1 |Year=2026 |Booktitle=Proceedings of the 24th International Workshop on Non-Monotonic Reasoning (NMR 2025) |Editor=Ana Ozaki, Nico Potyka |Series=CEUR }} {{Publikation Details |Abstract=In this paper, we integrate the defeasible l…“

{{Publikation Erster Autor
|ErsterAutorVorname=Nicholas
|ErsterAutorNachname=Leisegang
|FurtherAuthors=Thomas Meyer; Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=Standpoint Logics with Defeasible Beliefs
|To appear=1
|Year=2026
|Booktitle=Proceedings of the 24th International Workshop on Non-Monotonic Reasoning (NMR 2025)
|Editor=Ana Ozaki, Nico Potyka
|Series=CEUR
}}
{{Publikation Details
|Abstract=In this paper, we integrate the defeasible logic of Kraus, Lehmann and Magidor (KLM) with the standpoint logic framework of Gómez Álvarez and Rudolph. This is done with the goal of formally expressing knowledge taking into account multiple (possibly contradicting) viewpoints, which in turn may hold defeasible beliefs. In doing so, we utilise Defeasible Restricted Standpoint Logics (DRSL), introduced by Leisegang et al. Our work expands on previous work by providing a foundational representation result for DRSL semantics and systematically lifting several well-known entailment relations from the propositional case to the standpoint-enhanced setting. In particular, we characterise the semantics for DRSL through a set of KLM-style postulates adapted for the standpoints case. We furthermore provide a means to lift preferential entailment, and the class of entailment relations based on single ranking functions from the purely propositional to the standpoint-enhanced context, including rational and lexicographic closure. We show this can be done equivalently through semantic and algorithmic means. Furthermore, we show that, for each considered form of entailment, the complexity class of entailment checking does not change when moving from propositional KLM to DRSL.
|Download=LeisegangMeyerRudolph-NMR2026.pdf
|Projekt=SECAI, ScaDS.AI
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Nichtmonotones Schließen
}}

Datei:LeisegangMeyerRudolph-NMR2026.pdf

2026-06-20T19:31:15Z

Sebastian Rudolph:

Article3118

2026-06-17T08:41:19Z

Sebastian Rudolph:

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

Article3111

2026-06-17T08:39:09Z

Sebastian Rudolph:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Article
|Referiert=1
|Title=AGM Belief Revision, Semantically
|To appear=0
|Year=2025
|Journal=ACM Transactions on Computational Logic
|Volume=26
|Number=4
|Pages=23:1-23:54
}}
{{Publikation Details
|Abstract=We establish a generic, model-theoretic characterization of rational belief revision operators implementing the paradigm of minimal change according to the seminal work by Alchourrón, Gärdenfors, and Makinson (AGM). Our characterization applies to all Tarskian logics, that is, all logics with a classical model-theoretic semantics, and hence a wide variety of formalisms used in knowledge representation and beyond, including many for which a model-theoretic characterization has hitherto been lacking. Our starting point is the approach by Katsuno and Mendelzon (K&M), who provided such a characterization for propositional logic over finite signatures. We generalize K&M’s approach to the setting of AGM-style revision over bases in arbitrary Tarskian logics, where base may refer to one of the various ways of representing an agent’s beliefs (such as belief sets, arbitrary or finite sets of sentences, or single sentences). Our first core result is a representation theorem providing a two-way correspondence between AGM-style revision operators and specific assignments: functions associating every base to a “preference” relation over interpretations, which must be total but is – in contrast to prior approaches – not always transitive. As our second core contribution, we provide a characterization of all logics for which our result can be strengthened to assignments producing transitive preference relations (as in K&M’s original work). Alongside these main contributions, we discuss diverse variants of our findings as well as ramifications for other areas of belief revision theory.
|Download=FRS-TOCL-2025-AGMsemantically.pdf
|DOI Name=10.1145/3763234
|Projekt=DeciGUT, SECAI, ScaDS.AI
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Nichtmonotones Schließen
}}

Datei:CONCEPTS2026-Rudolph-PCF.pdf

2026-06-17T08:28:47Z

Sebastian Rudolph:

Introduction to Existential Rules (SS2026)

2026-05-17T17:00:40Z

Sebastian Rudolph:

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

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

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

Datei:ER-Rudolph-Lecture04-SS26.pdf

2026-05-17T17:00:28Z

Sebastian Rudolph:

Datei:ER-Rudolph-Lecture03-SS26.pdf

2026-05-17T16:58:47Z

Sebastian Rudolph: