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

Thema3516

Sarah Gaggl — Tue, 21 Apr 2026 07:56:04 GMT

Die Seite wurde neu angelegt: „{{Abschlussarbeit |Titel DE=Explaining Projected Answer Sets Using Faceted Reasoning |Titel EN=Explaining Projected Answer Sets Using Faceted Reasoning |Vorname=Paramita |Nachname=Choudhury |Abschlussarbeitstyp=Master |Betreuer=Sarah Gaggl |Forschungsgruppe=Logische Programmierung und Argumentation |Abschlussarbeitsstatus=Abgeschlossen |Abgabe=2025-11-27 |Beschreibung DE=Answer Set Programming (ASP) is a declarative paradigm for knowledge representation…“

Neue Seite

{{Abschlussarbeit
|Titel DE=Explaining Projected Answer Sets Using Faceted Reasoning
|Titel EN=Explaining Projected Answer Sets Using Faceted Reasoning
|Vorname=Paramita
|Nachname=Choudhury
|Abschlussarbeitstyp=Master
|Betreuer=Sarah Gaggl
|Forschungsgruppe=Logische Programmierung und Argumentation
|Abschlussarbeitsstatus=Abgeschlossen
|Abgabe=2025-11-27
|Beschreibung DE=Answer Set Programming (ASP) is a declarative paradigm for knowledge representation
and reasoning, widely used for modeling combinatorial problems in artificial intelligence.
Modern ASP solvers can generate large numbers of answer sets, but exhaustive enumeration is often impractical due to computational constraints and the difficulty of interpreting
massive solution spaces. Projection addresses this challenge by reducing answer sets to
atoms of interest, but it introduces a new problem: users lack insight into what information was eliminated and whether the projected results adequately represent the underlying
diversity. This thesis presents a facet-based approach to explain projected answer sets in
ASP. We develop an algorithm that computes facet counts - measures of diversity based
on brave consequences - for projected-away solution spaces. By formulating integrity
constraints from projected answer sets and invoking facet-counting solvers, our approach
quantifies how much variation remains hidden behind each projection. We formalize this
through three key definitions and implement it as EPAS (Explaining Projected Answer
Sets), a tool supporting bounded-time execution and interactive navigation. Additionally, the system includes an interactive feature that enables users to explore structural
relationships within projected answer sets, transforming projection from a black-box reduction into a transparent analytical process.
|Beschreibung EN=Answer Set Programming (ASP) is a declarative paradigm for knowledge representation
and reasoning, widely used for modeling combinatorial problems in artificial intelligence.
Modern ASP solvers can generate large numbers of answer sets, but exhaustive enumeration is often impractical due to computational constraints and the difficulty of interpreting
massive solution spaces. Projection addresses this challenge by reducing answer sets to
atoms of interest, but it introduces a new problem: users lack insight into what information was eliminated and whether the projected results adequately represent the underlying
diversity. This thesis presents a facet-based approach to explain projected answer sets in
ASP. We develop an algorithm that computes facet counts - measures of diversity based
on brave consequences - for projected-away solution spaces. By formulating integrity
constraints from projected answer sets and invoking facet-counting solvers, our approach
quantifies how much variation remains hidden behind each projection. We formalize this
through three key definitions and implement it as EPAS (Explaining Projected Answer
Sets), a tool supporting bounded-time execution and interactive navigation. Additionally, the system includes an interactive feature that enables users to explore structural
relationships within projected answer sets, transforming projection from a black-box reduction into a transparent analytical process.
}}

Proof Theory and Sequent Systems (SS2026)

Tim Lyon — Mon, 20 Apr 2026 18:18:54 GMT

← Nächstältere Version		Version vom 20. April 2026, 18:18 Uhr
Zeile 34:		Zeile 34:
	\|Room=APB E001		\|Room=APB E001
	\|Date=2026-04-17		\|Date=2026-04-17
			\|DS=DS3
			}}
			{{Vorlesung Zeiten
			\|Lehrveranstaltungstype=Vorlesung
			\|Title=Lecture 2
			\|Room=APB E001
			\|Date=2026-04-24
	\|DS=DS3		\|DS=DS3
	}}		}}

TBA10

Meghna Bhadra — Mon, 20 Apr 2026 14:05:52 GMT

← Nächstältere Version		Version vom 20. April 2026, 14:05 Uhr
(Eine dazwischenliegende Version derselben Benutzerin wird nicht angezeigt)
Zeile 1:		Zeile 1:
	{{Veranstaltung		{{Veranstaltung
	\|Titel DE=~~TBA~~		\|Titel DE=Reliable Problem Solving via LLMs with Symbolic Argumentation
	\|Titel EN=~~TBA~~		\|Titel EN=Reliable Problem Solving via LLMs with Symbolic Argumentation
	\|Beschreibung DE=~~TBA~~		\|Beschreibung DE=In modern AI the aim of a system is to address the problem requirements directly from the natural language description of the problem. Clearly, such a problem specification is expressed under human reasoning and hence a problem solving system would be advantageous if it could also operate under a formalism that is close to human reasoning. The recent development of Large Language Models (LLMs) offers such a possibility as these systems appear to handle natural language in a human-like fashion. But their reliability is under question as is their ability to reason underneath their process of constructing well-formed sentences in order to explain and argue for their solutions to problems. The question the arises: do we develop and train LLMs as reasoners or do we connect these to other formal (symbolic) reasoners who do not suffer from the above shortcomings? In this talk, the speaker will present a neuro-symbolic framework, based on the integration of the Natural Language capabilities of LLMs with Argumentation-based Reasoning. In this approach, instead of the LLM carrying out the reasoning, this is delegated to COGNICA, a Cognitive Argumentation system, which carries out the reasoning within a Controlled Natural Language. Specifically, LLM-COGNICA is a hybrid neural-symbolic framework for reasoning under a decision policy specified within Natural Language and executed via Explainable Argumentation. This offers the reliability of formal problem solving and allows the human developer and problem solver to be in control of the system development process. The talk will present the Argumentation foundations and Argumentation Technology underlying the neuro-symbolic integration of the LLM-COGNICA framework and describe how this can be employed to build reliable real-life application systems.
	\|Beschreibung EN=~~TBA~~

			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
			\|Beschreibung EN=In modern AI the aim of a system is to address the problem requirements directly from the natural language description of the problem. Clearly, such a problem specification is expressed under human reasoning and hence a problem solving system would be advantageous if it could also operate under a formalism that is close to human reasoning. The recent development of Large Language Models (LLMs) offers such a possibility as these systems appear to handle natural language in a human-like fashion. But their reliability is under question as is their ability to reason underneath their process of constructing well-formed sentences in order to explain and argue for their solutions to problems. The question the arises: do we develop and train LLMs as reasoners or do we connect these to other formal (symbolic) reasoners who do not suffer from the above shortcomings? In this talk, the speaker will present a neuro-symbolic framework, based on the integration of the Natural Language capabilities of LLMs with Argumentation-based Reasoning. In this approach, instead of the LLM carrying out the reasoning, this is delegated to COGNICA, a Cognitive Argumentation system, which carries out the reasoning within a Controlled Natural Language. Specifically, LLM-COGNICA is a hybrid neural-symbolic framework for reasoning under a decision policy specified within Natural Language and executed via Explainable Argumentation. This offers the reliability of formal problem solving and allows the human developer and problem solver to be in control of the system development process. The talk will present the Argumentation foundations and Argumentation Technology underlying the neuro-symbolic integration of the LLM-COGNICA framework and describe how this can be employed to build reliable real-life application systems.


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

Datei:TheoLog2026-Vorlesung-03-print.pdf

Markus Krötzsch — Mon, 20 Apr 2026 13:57:11 GMT

Markus Krötzsch lud eine neue Version von Datei:TheoLog2026-Vorlesung-03-print.pdf hoch

Neue Seite

Datei:TheoLog2026-Vorlesung-03-overlay.pdf

Markus Krötzsch — Mon, 20 Apr 2026 13:56:42 GMT

Markus Krötzsch lud eine neue Version von Datei:TheoLog2026-Vorlesung-03-overlay.pdf hoch

Neue Seite

Theoretische Informatik und Logik (SS2026)

Stephan Mennicke — Mon, 20 Apr 2026 13:46:18 GMT

blatt 2

@@ Zeile 187: / Zeile 187: @@
 |Date=2026-04-30
 |DS=DS4
 }}

Datei:TheoLog2026-Uebung-02.pdf

Stephan Mennicke — Mon, 20 Apr 2026 13:46:12 GMT

Stephan Mennicke lud Datei:TheoLog2026-Uebung-02.pdf hoch

Neue Seite

Datei:AGT2026-02.pdf

Hannes Straß — Mon, 20 Apr 2026 11:17:19 GMT

Hannes Straß löschte die Seite Datei:AGT2026-02.pdf alte Version 20260420111702!AGT2026-02.pdf gelöscht: Inhalt vor dem Leeren der Seite: „“

Datei:AGT2026-02.pdf

Hannes Straß — Mon, 20 Apr 2026 11:17:14 GMT

Hannes Straß löschte die Seite Datei:AGT2026-02.pdf alte Version 20260420111220!AGT2026-02.pdf gelöscht: Inhalt vor dem Leeren der Seite: „“

Datei:AGT2026-02.pdf

Hannes Straß — Mon, 20 Apr 2026 11:17:02 GMT

Hannes Straß lud eine neue Version von Datei:AGT2026-02.pdf hoch

Neue Seite

Datei:AGT2026-02.pdf

Hannes Straß — Mon, 20 Apr 2026 11:12:20 GMT

Hannes Straß lud eine neue Version von Datei:AGT2026-02.pdf hoch

Neue Seite

Theoretische Informatik und Logik (SS2026)

Markus Krötzsch — Mon, 20 Apr 2026 08:38:05 GMT

@@ Zeile 158: / Zeile 158: @@
 |DS=terminlos
 |Download=TheoLog2026-Uebung-01.pdf
 }}

Datei:TheoLog2026-Vorlesung-03-print.pdf

Markus Krötzsch — Mon, 20 Apr 2026 08:33:33 GMT

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

Neue Seite

Datei:TheoLog2026-Vorlesung-03-overlay.pdf

Markus Krötzsch — Mon, 20 Apr 2026 08:33:26 GMT

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

Neue Seite

Datei:AGT2026-02.pdf

Hannes Straß — Mon, 20 Apr 2026 08:02:59 GMT

Hannes Straß lud eine neue Version von Datei:AGT2026-02.pdf hoch

Neue Seite

Seminar Logic-Based Knowledge Representation (SS2026)

Sarah Gaggl — Mon, 20 Apr 2026 06:13:14 GMT

← Nächstältere Version		Version vom 20. April 2026, 06:13 Uhr
Zeile 26:		Zeile 26:
	# Answer Set Explanations via Preferred Unit-Provable Unsatisfiable Subsets https://link.springer.com/chapter/10.1007/978-3-031-74209-5_15		# Answer Set Explanations via Preferred Unit-Provable Unsatisfiable Subsets https://link.springer.com/chapter/10.1007/978-3-031-74209-5_15
	# Advancements in xASP, an XAI System for Answer Set Programming https://ceur-ws.org/Vol-3428/paper2.pdf		# Advancements in xASP, an XAI System for Answer Set Programming https://ceur-ws.org/Vol-3428/paper2.pdf
	# Model Reconciliation in Logic Programs https://link.springer.com/chapter/10.1007/978-3-030-75775-5_26		# <s>Model Reconciliation in Logic Programs https://link.springer.com/chapter/10.1007/978-3-030-75775-5_26</s>
	# Witnesses for Answer Sets of Basic Logic Programs https://www.ijcai.org/proceedings/2025/523		# Witnesses for Answer Sets of Basic Logic Programs https://www.ijcai.org/proceedings/2025/523

Algorithmic Game Theory (SS2026)

Hannes Straß — Fri, 17 Apr 2026 10:06:39 GMT

@@ Zeile 80: / Zeile 80: @@
 |DS=terminlos
 |Download=AGT2026-Problems-01.pdf
 }}

Datei:AGT2026-02.pdf

Hannes Straß — Fri, 17 Apr 2026 10:06:31 GMT

Hannes Straß lud Datei:AGT2026-02.pdf hoch

Neue Seite

Datei:TheoLog2026-Uebung-01.pdf

Stephan Mennicke — Fri, 17 Apr 2026 08:22:08 GMT

Stephan Mennicke lud eine neue Version von Datei:TheoLog2026-Uebung-01.pdf hoch

Neue Seite

Inproceedings3464

Lukas Gerlach — Fri, 17 Apr 2026 06:58:17 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Lukas |ErsterAutorNachname=Gerlach }} {{Inproceedings |Referiert=1 |Title=The Chase in Lean - Crafting a Formal Library for Existential Rule Research |To appear=1 |Year=2026 |Booktitle=KR 2026 }} {{Publikation Details |Abstract=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge represen…“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Lukas
|ErsterAutorNachname=Gerlach
}}
{{Inproceedings
|Referiert=1
|Title=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
|To appear=1
|Year=2026
|Booktitle=KR 2026
}}
{{Publikation Details
|Abstract=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). In this work, we present our own endeavor of crafting a Lean framework around existential rules and the chase. We discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, we show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, we unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.
|Download=KR-2026-Camera-Ready-178-Chase-In-Lean.pdf
|Link=https://dmfa.dev/lean
|Projekt=CPEC, CeTI, SECAI, ScaDS.AI
|Forschungsgruppe=Wissensbasierte Systeme
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}

Datei:KR-2026-Camera-Ready-178-Chase-In-Lean.pdf

Lukas Gerlach — Fri, 17 Apr 2026 06:57:12 GMT

Lukas Gerlach lud Datei:KR-2026-Camera-Ready-178-Chase-In-Lean.pdf hoch

Neue Seite

Inproceedings3430

Lukas Gerlach — Fri, 17 Apr 2026 06:54:24 GMT

← Nächstältere Version		Version vom 17. April 2026, 06:54 Uhr
Zeile 7:		Zeile 7:
	\|Referiert=1		\|Referiert=1
	\|Title=Restricted Chase Termination: You Want More than Fairness (Extended Abstract)		\|Title=Restricted Chase Termination: You Want More than Fairness (Extended Abstract)
	\|To appear=1		\|To appear=0
	\|Year=2025		\|Year=2025
	\|Month=September		\|Month=September
	\|Booktitle=DL Workshop ~~2025~~		\|Booktitle=Proceedings of the 38th International Workshop on Description Logics - DL 2025
			\|Publisher=CEUR-WS.org
			\|Editor=Lidia Tendera,Yazmin Ibanez Garcia,Patrick Koopmann
			\|Series=CEUR Workshop Proceedings
			\|Volume=4091
	}}		}}
	{{Publikation Details		{{Publikation Details
	\|Abstract=The chase is a fundamental algorithm with ubiquitous uses in database theory. Given a database and a set of existential rules (aka tuple-generating dependencies), it iteratively extends the database to ensure that the rules are satisfied in a most general way. This process may not terminate, and a major problem is to decide whether it does. This problem has been studied for many chase variants, which differ by the conditions under which a rule is applied to extend the database. Surprisingly, the complexity of the universal termination of the restricted (aka standard) chase is not fully understood. We close this gap by placing universal restricted chase termination in the analytical hierarchy. This higher hardness is due to the fairness condition, and we propose an alternative to reduce the hardness of universal termination.		\|Abstract=The chase is a fundamental algorithm with ubiquitous uses in database theory. Given a database and a set of existential rules (aka tuple-generating dependencies), it iteratively extends the database to ensure that the rules are satisfied in a most general way. This process may not terminate, and a major problem is to decide whether it does. This problem has been studied for many chase variants, which differ by the conditions under which a rule is applied to extend the database. Surprisingly, the complexity of the universal termination of the restricted (aka standard) chase is not fully understood. We close this gap by placing universal restricted chase termination in the analytical hierarchy. This higher hardness is due to the fairness condition, and we propose an alternative to reduce the hardness of universal termination.
			\|ISSN=1613-0073
	\|Download=DL-2025-Camera-Ready-5.pdf		\|Download=DL-2025-Camera-Ready-5.pdf
	\|Slides=2025-DL-Presentation-Paper-5.pdf		\|Slides=2025-DL-Presentation-Paper-5.pdf
			\|Link=https://ceur-ws.org/Vol-4091/paper05.pdf
	\|Projekt=CPEC, SECAI, ScaDS.AI		\|Projekt=CPEC, SECAI, ScaDS.AI
	\|Forschungsgruppe=Wissensbasierte Systeme		\|Forschungsgruppe=Wissensbasierte Systeme

Vorlage:Publication Report

Markus Krötzsch — Thu, 16 Apr 2026 18:21:59 GMT

← Nächstältere Version		Version vom 16. April 2026, 18:21 Uhr
Zeile 25:		Zeile 25:
	\|2024={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::2024]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|{{Annual Publication Query\|{{{1\|}}}\|2024}}\|HIDETHISTAB}}		\|2024={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::2024]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|{{Annual Publication Query\|{{{1\|}}}\|2024}}\|HIDETHISTAB}}
	\|2025={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::2025]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|{{Annual Publication Query\|{{{1\|}}}\|2025}}\|HIDETHISTAB}}		\|2025={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::2025]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|{{Annual Publication Query\|{{{1\|}}}\|2025}}\|HIDETHISTAB}}
	\|TODO={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::>~~2026~~]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|Too far into the future! Go to [[:Template:Publication Report]] and add more tabs by copying and modifying the ones that are there\|HIDETHISTAB}}		\|2026={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::2026]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|{{Annual Publication Query\|{{{1\|}}}\|2026}}\|HIDETHISTAB}}
			\|2027={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::2027]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|{{Annual Publication Query\|{{{1\|}}}\|2027}}\|HIDETHISTAB}}
			\|TODO={{#ifeq:{{#ask: [[Kategorie:Publikation]] [[Year::>2028]] {{{1\|}}} \| limit=1 \|default=none\|mainlabel=-\|searchlabel=\|intro=some}}\|some\|Too far into the future! Go to [[:Template:Publication Report]] and add more tabs by copying and modifying the ones that are there\|HIDETHISTAB}}
	}}		}}
	</includeonly>		</includeonly>

Benutzer:Markus Krötzsch/KBS publication report/SCaDS

Markus Krötzsch — Thu, 16 Apr 2026 16:19:26 GMT

Die Seite wurde neu angelegt: „This page shows publications associated with KBS for internal reporting purposes. {{Publication Report| Forschungsgruppe::Wissensbasierte Systeme Projekt::ScaDS.AI }}“

Benutzer:Markus Krötzsch

Markus Krötzsch — Thu, 16 Apr 2026 16:17:50 GMT

Links

Seminar Logic-Based Knowledge Representation (SS2026)

Sarah Gaggl — Thu, 16 Apr 2026 10:41:36 GMT

← Nächstältere Version		Version vom 16. April 2026, 10:41 Uhr
(4 dazwischenliegende Versionen derselben Benutzerin werden nicht angezeigt)
Zeile 18:		Zeile 18:

	===Seminar Plan===		===Seminar Plan===
	The seminar will take place on Mondays 16:40 – 18:10 in room APB E005, on the dates indicated in the schedule. The topics will be selected in the first session on April 13th 2026.		The seminar will take place on Mondays 16:40 – 18:10 in room APB E005, on the dates indicated in the schedule. The topics will be selected in the first session on April 13th 2026. '''Write a mail to Sarah Gaggl for registration to the seminar and topic selection!'''

	# Contrastive Explanations for Answer-Set Programs https://link.springer.com/chapter/10.1007/978-3-031-43619-2_6		# <s>Contrastive Explanations for Answer-Set Programs https://link.springer.com/chapter/10.1007/978-3-031-43619-2_6 </s>
	# Explaining Answer-Set Programs with Abstract Constraint Atoms https://www.ijcai.org/proceedings/2023/356		# Explaining Answer-Set Programs with Abstract Constraint Atoms https://www.ijcai.org/proceedings/2023/356
	# Why This and Not That? A Logic-Based Framework for Contrastive Explanations https://link.springer.com/chapter/10.1007/978-3-032-04587-4_4		# Why This and Not That? A Logic-Based Framework for Contrastive Explanations https://link.springer.com/chapter/10.1007/978-3-032-04587-4_4
Zeile 44:		Zeile 44:
	\|DS=DS6		\|DS=DS6
	\|Download=SeminarLBKR2026 L1.pdf		\|Download=SeminarLBKR2026 L1.pdf
			}}
			{{Vorlesung Zeiten
			\|Lehrveranstaltungstype=Seminar
			\|Title=How to write a seminar paper
			\|Room=APB E005
			\|Date=2026-04-20
			\|DS=DS6
			}}
			{{Vorlesung Zeiten
			\|Lehrveranstaltungstype=Seminar
			\|Title=How to write a review and how to give a presentation
			\|Room=APB E005
			\|Date=2026-04-27
			\|DS=DS6
	}}		}}

Theoretische Informatik und Logik (SS2026)

Markus Krötzsch — Wed, 15 Apr 2026 19:41:37 GMT

← Nächstältere Version		Version vom 15. April 2026, 19:41 Uhr
Zeile 145:		Zeile 145:
	{{Vorlesung Zeiten		{{Vorlesung Zeiten
	\|Lehrveranstaltungstype=Vorlesung		\|Lehrveranstaltungstype=Vorlesung
	\|Title=2. ~~Logisches Schließen~~ und ~~Normalformen~~		\|Title=2. Logische Schlussfolgerungen und Äquivalenzen
	\|Room=HSZ/0002		\|Room=HSZ/0002
	\|Date=2026-04-16		\|Date=2026-04-16
	\|DS=DS4		\|DS=DS4
			\|Download=TheoLog2026-Vorlesung-02-overlay.pdf, TheoLog2026-Vorlesung-02-print.pdf
	}}		}}
	{{Vorlesung Zeiten		{{Vorlesung Zeiten

Datei:TheoLog2026-Vorlesung-02-print.pdf

Markus Krötzsch — Wed, 15 Apr 2026 19:41:32 GMT

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

Neue Seite

Datei:TheoLog2026-Vorlesung-02-overlay.pdf

Markus Krötzsch — Wed, 15 Apr 2026 19:41:19 GMT

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

Neue Seite

TheoLog2026/en

Markus Krötzsch — Wed, 15 Apr 2026 19:38:59 GMT

Weiterleitung nach Theoretische Informatik und Logik (SS2026)/en erstellt

Neue Seite

#REDIRECT [[Theoretische_Informatik_und_Logik_(SS2026)/en]]

TheoLog2026

Markus Krötzsch — Wed, 15 Apr 2026 19:38:37 GMT

Weiterleitung nach Theoretische Informatik und Logik (SS2026) erstellt

Neue Seite

#REDIRECT [[Theoretische_Informatik_und_Logik_(SS2026)]]

Article3122

Luisa Herrmann — Wed, 15 Apr 2026 09:41:59 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann |FurtherAuthors=Johannes Osterholzer }} {{Article |Referiert=1 |Title=Non-Global Parikh Tree Automata |To appear=1 |Year=2026 |Journal=Journal of Automata, Languages and Combinatorics }} {{Publikation Details |Projekt=ScaDS.AI |Forschungsgruppe=Computational Logic }}“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Luisa
|ErsterAutorNachname=Herrmann
|FurtherAuthors=Johannes Osterholzer
}}
{{Article
|Referiert=1
|Title=Non-Global Parikh Tree Automata
|To appear=1
|Year=2026
|Journal=Journal of Automata, Languages and Combinatorics
}}
{{Publikation Details
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Article3121

Luisa Herrmann — Wed, 15 Apr 2026 09:40:07 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann |FurtherAuthors=Richard Mörbitz }} {{Article |Referiert=1 |Title=Global one-counter tree automata |To appear=0 |Year=2026 |Journal=Theoretical Computer Science |Volume=1071 |Publisher=Elsevier }} {{Publikation Details |Abstract=We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed…“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Luisa
|ErsterAutorNachname=Herrmann
|FurtherAuthors=Richard Mörbitz
}}
{{Article
|Referiert=1
|Title=Global one-counter tree automata
|To appear=0
|Year=2026
|Journal=Theoretical Computer Science
|Volume=1071
|Publisher=Elsevier
}}
{{Publikation Details
|Abstract=We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the membership problem of GOCTA is in P while, in stark contrast, their emptiness problem is undecidable in general. For the special case of reversal-bounded GOCTA, we show decidability of the emptiness problem.
|DOI Name=https://doi.org/10.1016/j.tcs.2026.115840
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}