<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
	<id>https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nils+K%C3%BCchenmeister</id>
	<title>International Center for Computational Logic - Benutzerbeiträge [de]</title>
	<link rel="self" type="application/atom+xml" href="https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nils+K%C3%BCchenmeister"/>
	<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/web/Spezial:Beitr%C3%A4ge/Nils_K%C3%BCchenmeister"/>
	<updated>2026-11-18T18:49:01Z</updated>
	<subtitle>Benutzerbeiträge</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Ontology-Based_Query_Answering_over_Datalog-Expressible_Rule_Sets_is_Undecidable&amp;diff=45364</id>
		<title>Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Ontology-Based_Query_Answering_over_Datalog-Expressible_Rule_Sets_is_Undecidable&amp;diff=45364"/>
		<updated>2026-11-17T11:52:23Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Ontology-Based Query Answering over  Datalog-Expressible Rule Sets is Undecidable&lt;br /&gt;
|Beschreibung EN=Ontology-based query answering takes as input an ontology R (typically given by existential rules), a set F of facts, and a Boolean conjunctive query q, and asks whether R, F ⊨ q. This problem is undecidable in general, and a widely studied way of dealing with it in specific cases is query rewriting: given a rule query (R, q), we compute a Boolean query qR such that, for every fact set F, we have that (R, F) ⊨ q if and only if F ⊨ qR.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Previous work has mostly focused on rewritings expressed as unions of conjunctive queries (UCQs), and an algorithm exists that computes such a rewriting whenever one exists. However, UCQ-rewritability is quite restrictive, and many interesting real-world rule queries admit no UCQ-rewriting. This raises the question of whether a similarly generic algorithm can be designed for a more expressive target language, such as datalog. We answer this question negatively: by studying the difference between datalog-expressibility and datalog-rewritability, we show that query answering is undecidable even for datalog-expressible rule queries.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-11-19 11:00:00&lt;br /&gt;
|Ende=2026-11-19 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=David Carral&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Ontology-Based_Query_Answering_over_Datalog-Expressible_Rule_Sets_is_Undecidable&amp;diff=45363</id>
		<title>Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Ontology-Based_Query_Answering_over_Datalog-Expressible_Rule_Sets_is_Undecidable&amp;diff=45363"/>
		<updated>2026-11-17T11:52:02Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Ontology-Based Query Answering over  Datalog-Expressible Rule Sets is Undecidable&lt;br /&gt;
|Beschreibung EN=Ontology-based query answering takes as input an ontology R (typically given by existential rules), a set F of facts, and a Boolean conjunctive query q, and asks whether R, F ⊨ q. This problem is undecidable in general, and a widely studied way of dealing with it in specific cases is query rewriting: given a rule query (R, q), we compute a Boolean query qR such that, for every fact set F, we have that (R, F) ⊨ q if and only if F ⊨ qR.&lt;br /&gt;
&lt;br /&gt;
Previous work has mostly focused on rewritings expressed as unions of conjunctive queries (UCQs), and an algorithm exists that computes such a rewriting whenever one exists. However, UCQ-rewritability is quite restrictive, and many interesting real-world rule queries admit no UCQ-rewriting. This raises the question of whether a similarly generic algorithm can be designed for a more expressive target language, such as datalog. We answer this question negatively: by studying the difference between datalog-expressibility and datalog-rewritability, we show that query answering is undecidable even for datalog-expressible rule queries.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-11-19 11:00:00&lt;br /&gt;
|Ende=2026-11-19 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=David Carral&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Ontology-Based_Query_Answering_over_Datalog-Expressible_Rule_Sets_is_Undecidable&amp;diff=45361</id>
		<title>Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Ontology-Based_Query_Answering_over_Datalog-Expressible_Rule_Sets_is_Undecidable&amp;diff=45361"/>
		<updated>2026-11-17T11:48:58Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Ontology-Based Query Answering over  Datalog-Expressible Rule Sets is Undecidable |Beschreibung EN=Ontology-based query answering takes as input an ontology R (typically given by existential rules), a set F of facts, and a Boolean conjunctive query q, and asks whether R, F ⊨ q. This problem is undecidable in general, and a widely studied way of dealing with it in specific cases is query rewriting: given a rule query (R, q), we…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Ontology-Based Query Answering over  Datalog-Expressible Rule Sets is Undecidable&lt;br /&gt;
|Beschreibung EN=Ontology-based query answering takes as input an ontology R (typically given by existential rules), a set F of facts, and a Boolean conjunctive query q, and asks whether R, F ⊨ q. This problem is undecidable in general, and a widely studied way of dealing with it in specific cases is query rewriting: given a rule query (R, q), we compute a Boolean &lt;br /&gt;
query qR such that, for every fact set F, we have that (R, F) ⊨ q if and only if F ⊨ qR.&lt;br /&gt;
&lt;br /&gt;
Previous work has mostly focused on rewritings expressed as unions of conjunctive queries (UCQs), and an algorithm exists that computes such a rewriting whenever one exists. However, UCQ-rewritability is quite restrictive, and many interesting real-world rule queries admit no UCQ-rewriting. This raises the question of whether a similarly generic algorithm can be designed for a more expressive target language, such as &lt;br /&gt;
datalog. We answer this question negatively: by studying the difference between datalog-expressibility and datalog-rewritability, we show that query answering is undecidable even for datalog-expressible rule queries.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-11-19 11:00:00&lt;br /&gt;
|Ende=2026-11-19 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=David Carral&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=A_Guided_Tour_of_Sequent_Formalisms_for_Modal_Logics&amp;diff=45337</id>
		<title>A Guided Tour of Sequent Formalisms for Modal Logics</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=A_Guided_Tour_of_Sequent_Formalisms_for_Modal_Logics&amp;diff=45337"/>
		<updated>2026-11-09T14:47:09Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=A Guided Tour of Sequent Formalisms for Modal Logics&lt;br /&gt;
|Beschreibung EN=This tutorial explores the landscape of sequent-based proof formalisms for modal logics, using Gödel-Löb provability logic (GL) as a running example. We survey four major paradigms--labeled sequents, nested (or tree) sequents, linear nested sequents, and Gentzen sequents--and discuss the various trade-offs of choosing one formalism over another, including sequent size, proof size, and suitability for counter-model extraction. The central theme of the tutorial is understanding how these formalisms relate by means of proof transformations, explaining how one can systematically &amp;quot;transition&amp;quot; between them: from graphs, to trees, to lines, and to points (i.e., standard Gentzen sequents). Along the way, we highlight what is lost or gained in each transition, such as invertibility of rules or proof compactness. We also touch on how the choice of formalism affects proof-search algorithms.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2027-03-04 11:00:00&lt;br /&gt;
|Ende=2027-03-04 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Tim Lyon&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Survey_of_Syntax_Splitting&amp;diff=45336</id>
		<title>Survey of Syntax Splitting</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Survey_of_Syntax_Splitting&amp;diff=45336"/>
		<updated>2026-11-09T14:46:10Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Survey of Syntax Splitting&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-03 11:00:00&lt;br /&gt;
|Ende=2026-12-03 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Ameerah Allie&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45317</id>
		<title>On the Complexity of Model Checking for Temporal Equilibrium Logic</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45317"/>
		<updated>2026-11-04T14:33:02Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=On the Complexity of Model Checking for Temporal Equilibrium Logic&lt;br /&gt;
|Beschreibung EN=This talk presents the results obtained while studying the computational complexity of the model checking (MC) problem for &#039;&#039;temporal equilibrium logic&#039;&#039; (TEL), a temporal extension of &#039;&#039;answer set programming&#039;&#039; (ASP) introduced by Pedro Cabalar and Gilberto Pérez Vega in 2007.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Given a &#039;&#039;Kripke structure&#039;&#039; (KS) 𝐾 and a TEL formula 𝜑, the MC problem for TEL (TELKS) is the problem of deciding whether 𝐾 is a &#039;&#039;temporal equilibrium model&#039;&#039; (TEM) of 𝜑. The obtained complexity results justify a division of this problem into two variants: a universal one (TELKS∀) asking whether all traces 𝑇 within 𝐾 are a TEM of 𝜑; and an existential one (TELKS∃) asking whether a trace 𝑇 within 𝐾 exists which is a TEM of 𝜑.&lt;br /&gt;
&lt;br /&gt;
A restriction of the TELKS problem over &#039;&#039;linear KSs&#039;&#039; (TELT), corresponding to asking whether a periodically infinite LTL trace is a TEM of a given TEL formula 𝜑, is also investigated. The complexity of the TELKS∀, TELKS∃ and TELT problems when the set of allowed temporal operators, the &#039;&#039;temporal height&#039;&#039; (the number of nested temporal operators) and the &#039;&#039;implication height&#039;&#039; (the number of nested implication operators) of a formula is restricted is also presented.&lt;br /&gt;
&lt;br /&gt;
The work this talk is based on was presented at &#039;&#039;Logic Programming and Nonmonotonic Reasoning&#039;&#039; (LPNMR) 26 in Klagenfurt, Austria, on September 2026.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-10 11:00:00&lt;br /&gt;
|Ende=2026-12-10 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Oscar Barreca&lt;br /&gt;
|Forschungsgruppe=Automatentheorie&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3477&amp;diff=45313</id>
		<title>Inproceedings3477</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3477&amp;diff=45313"/>
		<updated>2026-11-04T09:37:06Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Nils&lt;br /&gt;
|ErsterAutorNachname=Küchenmeister&lt;br /&gt;
|FurtherAuthors=Alex Ivliev; Dörthe Arndt; Markus Krötzsch&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Stratified Negation in RDF Rules: A Correct Approach&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2026&lt;br /&gt;
|Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026)&lt;br /&gt;
|Pages=157–175&lt;br /&gt;
|Publisher=Springer&lt;br /&gt;
|Editor=Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto Jimenez Ruiz, Oshani Seneviratne, Lora Aroyo, Gianluca Demartini, Reham Alharbi, Roberto Barile, Claudia d&#039;Amato, Valentina Tamma&lt;br /&gt;
|Series=LNCS&lt;br /&gt;
|Volume=17127&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging. Existing methods to stratify negation often fail for RDF rules, since individual triples do not carry enough information to meaningfully restrict potential dependencies. Blank nodes in rule heads further complicate the matter, since the order of rule applications may determine whether new values are created, which in turn can change the applicability of rules with negation. To solve these open problems, we propose chain stratification as a robust new condition that guarantees a well-behaved semantics for RDF rules with negation, and existential rules in general. Our condition combines an elaborate analysis of potential multistep derivations with a mechanism for using integrity constraints to discard impossible cases. Applying rules in any order that respects chain stratification is guaranteed to derive an RDF graph that is unique, lean, and justified under the usual negation-as-failure semantics. To show the practicality, we also provide a prototype implementation.&lt;br /&gt;
|ISBN=978-3-032-42025-1&lt;br /&gt;
|Download=ISWC26-chain-stratification.pdf&lt;br /&gt;
|Slides=Stratified Negation in RDF Rules-Küchenmeister.pdf&lt;br /&gt;
|Link=https://arxiv.org/abs/2607.28778, https://gitlab.com/nkuechen/chaining-reliances/-/tree/iswc26&lt;br /&gt;
|DOI Name=10.1007/978-3-032-42026-8_8&lt;br /&gt;
|Projekt=CPEC, CeTI, SECAI, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3477&amp;diff=45309</id>
		<title>Inproceedings3477</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3477&amp;diff=45309"/>
		<updated>2026-11-04T09:32:35Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Nils&lt;br /&gt;
|ErsterAutorNachname=Küchenmeister&lt;br /&gt;
|FurtherAuthors=Alex Ivliev; Dörthe Arndt; Markus Krötzsch&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Stratified Negation in RDF Rules: A Correct Approach&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2026&lt;br /&gt;
|Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026)&lt;br /&gt;
|Pages=157–175&lt;br /&gt;
|Publisher=Springer&lt;br /&gt;
|Editor=Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto Jimenez Ruiz, Oshani Seneviratne, Lora Aroyo, Gianluca Demartini, Reham Alharbi, Roberto Barile, Claudia d&#039;Amato, Valentina Tamma&lt;br /&gt;
|Series=LNCS&lt;br /&gt;
|Volume=17127&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging. Existing methods to stratify negation often fail for RDF rules, since individual triples do not carry enough information to meaningfully restrict potential dependencies. Blank nodes in rule heads further complicate the matter, since the order of rule applications may determine whether new values are created, which in turn can change the applicability of rules with negation. To solve these open problems, we propose chain stratification as a robust new condition that guarantees a well-behaved semantics for RDF rules with negation, and existential rules in general. Our condition combines an elaborate analysis of potential multistep derivations with a mechanism for using integrity constraints to discard impossible cases. Applying rules in any order that respects chain stratification is guaranteed to derive an RDF graph that is unique, lean, and justified under the usual negation-as-failure semantics. To show the practicality, we also provide a prototype implementation.&lt;br /&gt;
|Download=ISWC26-chain-stratification.pdf&lt;br /&gt;
|Slides=Stratified Negation in RDF Rules-Küchenmeister.pdf&lt;br /&gt;
|Link=https://arxiv.org/abs/2607.28778&lt;br /&gt;
|DOI Name=10.1007/978-3-032-42026-8_8&lt;br /&gt;
|Projekt=CPEC, CeTI, SECAI, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Stratified_Negation_in_RDF_Rules-K%C3%BCchenmeister.pdf&amp;diff=45308</id>
		<title>Datei:Stratified Negation in RDF Rules-Küchenmeister.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Stratified_Negation_in_RDF_Rules-K%C3%BCchenmeister.pdf&amp;diff=45308"/>
		<updated>2026-11-04T09:31:11Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45305</id>
		<title>On the Complexity of Model Checking for Temporal Equilibrium Logic</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45305"/>
		<updated>2026-11-04T08:57:57Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=On the Complexity of Model Checking for Temporal Equilibrium Logic&lt;br /&gt;
|Beschreibung EN=This talk presents the results obtained while studying the computational complexity of the &#039;&#039;model checking&#039;&#039; (MC) problem for temporal equilibrium logic (TEL), a temporal extension of &#039;&#039;answer set programming&#039;&#039; (ASP) introduced by Pedro Cabalar and Gilberto Pérez Vega in 2007.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Given a &#039;&#039;Kripke structure&#039;&#039; (KS) 𝐾 and a TEL formula 𝜑, the MC problem for TEL (TELKS) is the problem of deciding whether 𝐾 is a &#039;&#039;temporal equilibrium model&#039;&#039; (TEM) of 𝜑. The obtained complexity results justify a division of this problem into two variants: a universal one (TELKS∀) asking whether all traces 𝑇 within 𝐾 are a TEM of 𝜑; and an existential one (TELKS∃) asking whether a trace 𝑇 within 𝐾 exists which is a TEM of 𝜑.&lt;br /&gt;
&lt;br /&gt;
A restriction of the Telks problem over &#039;&#039;linear KSs&#039;&#039; (TELT), corresponding to asking whether a periodically infinite LTL trace is a TEM of a given TEL formula 𝜑, is also investigated. The complexity of the Telks∀, Telks∃ and Telt problems when the set of allowed temporal operators, the &#039;&#039;temporal height&#039;&#039; (the number of nested temporal operators) and the &#039;&#039;implication height&#039;&#039; (the number of nested implication operators) of a formula is restricted is also presented.&lt;br /&gt;
&lt;br /&gt;
The work this talk is based on was already presented at &#039;&#039;Logic Programming and Nonmonotonic Reasoning&#039;&#039; (LPNMR) 26 in Klagenfurt, Austria, on September 2026.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-10 11:00:00&lt;br /&gt;
|Ende=2026-12-10 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Oscar Barreca&lt;br /&gt;
|Forschungsgruppe=Automatentheorie&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45304</id>
		<title>On the Complexity of Model Checking for Temporal Equilibrium Logic</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45304"/>
		<updated>2026-11-04T08:57:40Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=On the Complexity of Model Checking for Temporal Equilibrium Logic&lt;br /&gt;
|Beschreibung EN=This talk presents the results obtained while studying the computational complexity of the &#039;&#039;model checking&#039;&#039; (MC) problem for temporal equilibrium logic (TEL), a temporal extension of &#039;&#039;answer set programming&#039;&#039; (ASP) introduced by Pedro Cabalar and Gilberto Pérez Vega in 2007.&lt;br /&gt;
&lt;br /&gt;
Given a &#039;&#039;Kripke structure&#039;&#039; (KS) 𝐾 and a TEL formula 𝜑, the MC problem for TEL (TELKS) is the problem of deciding whether 𝐾 is a &#039;&#039;temporal equilibrium model&#039;&#039; (TEM) of 𝜑. The obtained complexity results justify a division of this problem into two variants: a universal one (TELKS∀) asking whether all traces 𝑇 within 𝐾 are a TEM of 𝜑; and an existential one (TELKS∃) asking whether a trace 𝑇 within 𝐾 exists which is a TEM of 𝜑.&lt;br /&gt;
&lt;br /&gt;
A restriction of the Telks problem over &#039;&#039;linear KSs&#039;&#039; (TELT), corresponding to asking whether a periodically infinite LTL trace is a TEM of a given TEL formula 𝜑, is also investigated. The complexity of the Telks∀, Telks∃ and Telt problems when the set of allowed temporal operators, the &#039;&#039;temporal height&#039;&#039; (the number of nested temporal operators) and the &#039;&#039;implication height&#039;&#039; (the number of nested implication operators) of a formula is restricted is also presented.&lt;br /&gt;
&lt;br /&gt;
The work this talk is based on was already presented at &#039;&#039;Logic Programming and Nonmonotonic Reasoning&#039;&#039; (LPNMR) 26 in Klagenfurt, Austria, on September 2026.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-10 11:00:00&lt;br /&gt;
|Ende=2026-12-10 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Oscar Barreca&lt;br /&gt;
|Forschungsgruppe=Automatentheorie&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45269</id>
		<title>On the Complexity of Model Checking for Temporal Equilibrium Logic</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45269"/>
		<updated>2026-10-22T15:08:49Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=On the Complexity of Model Checking for Temporal Equilibrium Logic&lt;br /&gt;
|Beschreibung EN=This talk presents the results obtained while studying the computational complexity of the model checking (MC) problem for temporal equilibrium logic (TEL), a temporal extension of answer set programming (ASP) introduced by Pedro Cabalar and Gilberto Pérez Vega in 2007.&lt;br /&gt;
&lt;br /&gt;
Given a Kripke structure (KS) 𝐾 and a TEL formula 𝜑, the MC problem for TEL (Telks) is the problem of deciding whether 𝐾 is a temporal equilibrium model (TEM) of 𝜑. The obtained complexity results justify a division of this problem into two variants: a universal one (Telks∀) asking whether all traces 𝑇 within 𝐾 are a TEM of 𝜑; and an existential one (Telks∃) asking whether a trace 𝑇 within 𝐾 exists which is a TEM of 𝜑.&lt;br /&gt;
&lt;br /&gt;
A restriction of the Telks problem over linear KSs (Telt), corresponding to asking whether a periodically infinite LTL trace is a TEM of a given TEL formula 𝜑, is also investigated. The complexity of the Telks∀, Telks∃ and Telt problems when the set of allowed temporal operators, the temporal height (the number of nested temporal operators) and the implication height (the number of nested implication operators) of a formula is restricted is also presented.&lt;br /&gt;
&lt;br /&gt;
The work this talk is based on was already presented at Logic Programming and Nonmonotonic Reasoning (LPNMR) 26 in Klagenfurt, Austria, on September 2026.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-10 11:00:00&lt;br /&gt;
|Ende=2026-12-10 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Oscar Barreca&lt;br /&gt;
|Forschungsgruppe=Automatentheorie&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45268</id>
		<title>On the Complexity of Model Checking for Temporal Equilibrium Logic</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45268"/>
		<updated>2026-10-22T15:08:08Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=On the Complexity of Model Checking for Temporal Equilibrium Logic&lt;br /&gt;
|Beschreibung EN=&amp;lt;!DOCTYPE html&amp;gt;&amp;lt;html lang=&amp;quot;en&amp;quot;&amp;gt;&amp;lt;head&amp;gt;&amp;lt;meta charset=&amp;quot;utf-8&amp;quot;&amp;gt;&amp;lt;meta name=&amp;quot;viewport&amp;quot; content=&amp;quot;width=device-width, initial-scale=1&amp;quot;&amp;gt;&amp;lt;style&amp;gt;/* Alignment */&lt;br /&gt;
mtable.right-align mtd,&lt;br /&gt;
mtable mtd.right-align,&lt;br /&gt;
mtable.left-align mtd.right-align,&lt;br /&gt;
mtable.aligned mtd:nth-child(odd) {&lt;br /&gt;
  justify-items: end;&lt;br /&gt;
  text-align: right;&lt;br /&gt;
}&lt;br /&gt;
mtable.cases mtd,&lt;br /&gt;
mtable.left-align mtd,&lt;br /&gt;
mtable mtd.left-align,&lt;br /&gt;
mtable.aligned mtd:nth-child(even),&lt;br /&gt;
math:is(:not([display])) &amp;gt; mtable.multiline-equation mtd {&lt;br /&gt;
  justify-items: start;&lt;br /&gt;
  text-align: left;&lt;br /&gt;
}&lt;br /&gt;
mtable.cases mtd,&lt;br /&gt;
mtable.aligned mtd,&lt;br /&gt;
mtable mtd.flushed,&lt;br /&gt;
mtable mtd.left-flush {&lt;br /&gt;
  padding-left: 0;&lt;br /&gt;
}&lt;br /&gt;
mtable.cases mtd,&lt;br /&gt;
mtable.aligned mtd,&lt;br /&gt;
mtable mtd.flushed,&lt;br /&gt;
mtable mtd.right-flush {&lt;br /&gt;
  padding-right: 0;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
/* Tables */&lt;br /&gt;
mtable {&lt;br /&gt;
  math-style: inherit;&lt;br /&gt;
}&lt;br /&gt;
mtd {&lt;br /&gt;
  math-depth: auto-add;&lt;br /&gt;
  math-style: compact;&lt;br /&gt;
  math-shift: compact;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
/* Equations */&lt;br /&gt;
mtable.multiline-equation mtd {&lt;br /&gt;
  math-depth: inherit;&lt;br /&gt;
  math-style: inherit;&lt;br /&gt;
  math-shift: inherit;&lt;br /&gt;
  padding: 0;&lt;br /&gt;
}&lt;br /&gt;
math &amp;gt; mtable.multiline-equation mtr:not(:last-child) mtd {&lt;br /&gt;
  padding-bottom: 0.5em;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
/* Fractions */&lt;br /&gt;
mfrac {&lt;br /&gt;
  padding-inline: 0;&lt;br /&gt;
  margin-inline: 0.1em;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
/* Accents */&lt;br /&gt;
mover[accent=&amp;quot;true&amp;quot; i] &amp;gt; :first-child {&lt;br /&gt;
  font-feature-settings: &amp;quot;dtls&amp;quot;;&lt;br /&gt;
}&lt;br /&gt;
mover.dotted[accent=&amp;quot;true&amp;quot; i] &amp;gt; :first-child {&lt;br /&gt;
  font-feature-settings: &amp;quot;dtls&amp;quot; 0;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
/* Other rules for scriptlevel, displaystyle and math-shift */&lt;br /&gt;
munder &amp;gt; :nth-child(2),&lt;br /&gt;
munderover &amp;gt; :nth-child(2) {&lt;br /&gt;
  math-shift: compact&lt;br /&gt;
}&lt;br /&gt;
munder[accentunder=&amp;quot;true&amp;quot; i] &amp;gt; :not(:first-child),&lt;br /&gt;
mover[accent=&amp;quot;true&amp;quot; i] &amp;gt; :not(:first-child) {&lt;br /&gt;
  math-depth: inherit;&lt;br /&gt;
  math-style: inherit;&lt;br /&gt;
  math-shift: inherit;&lt;br /&gt;
}&amp;lt;/style&amp;gt;&amp;lt;/head&amp;gt;&amp;lt;body&amp;gt;&amp;lt;p&amp;gt;This talk presents the results obtained while studying the computational complexity of the &amp;lt;em&amp;gt;model checking&amp;lt;/em&amp;gt; (MC) problem for &amp;lt;em&amp;gt;temporal equilibrium logic&amp;lt;/em&amp;gt; (TEL), a temporal extension of &amp;lt;em&amp;gt;answer set programming&amp;lt;/em&amp;gt; (ASP) introduced by Pedro Cabalar and Gilberto Pérez Vega in 2007.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;Given a &amp;lt;em&amp;gt;Kripke structure&amp;lt;/em&amp;gt; (KS) &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝐾&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt; and a TEL formula &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝜑&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt;, the MC problem for TEL (&amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telks&amp;lt;/span&amp;gt;) is the problem of deciding whether &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝐾&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt; is a &amp;lt;em&amp;gt;temporal equilibrium model&amp;lt;/em&amp;gt; (TEM) of &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝜑&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt;. The obtained complexity results justify a division of this problem into two variants: a universal one (&amp;lt;math&amp;gt;&amp;lt;msub&amp;gt;&amp;lt;span&amp;gt;&amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telks&amp;lt;/span&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;mo&amp;gt;∀&amp;lt;/mo&amp;gt;&amp;lt;/msub&amp;gt;&amp;lt;/math&amp;gt;) asking whether all traces &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝑇&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt; within &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝐾&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt; are a TEM of &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝜑&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt;; and an existential one (&amp;lt;math&amp;gt;&amp;lt;msub&amp;gt;&amp;lt;span&amp;gt;&amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telks&amp;lt;/span&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;mo&amp;gt;∃&amp;lt;/mo&amp;gt;&amp;lt;/msub&amp;gt;&amp;lt;/math&amp;gt;) asking whether a trace &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝑇&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt; within &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝐾&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt; exists which is a TEM of &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝜑&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt;.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;A restriction of the &amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telks&amp;lt;/span&amp;gt; problem over &amp;lt;em&amp;gt;linear KSs&amp;lt;/em&amp;gt; (&amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telt&amp;lt;/span&amp;gt;), corresponding to asking whether a periodically infinite LTL trace is a TEM of a given TEL formula &amp;lt;math&amp;gt;&amp;lt;mi&amp;gt;𝜑&amp;lt;/mi&amp;gt;&amp;lt;/math&amp;gt;, is also investigated. The complexity of the &amp;lt;math&amp;gt;&amp;lt;msub&amp;gt;&amp;lt;span&amp;gt;&amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telks&amp;lt;/span&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;mo&amp;gt;∀&amp;lt;/mo&amp;gt;&amp;lt;/msub&amp;gt;&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;&amp;lt;msub&amp;gt;&amp;lt;span&amp;gt;&amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telks&amp;lt;/span&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;mo&amp;gt;∃&amp;lt;/mo&amp;gt;&amp;lt;/msub&amp;gt;&amp;lt;/math&amp;gt; and &amp;lt;span style=&amp;quot;font-variant-caps: small-caps&amp;quot;&amp;gt;Telt&amp;lt;/span&amp;gt; problems when the set of allowed temporal operators, the &amp;lt;em&amp;gt;temporal height&amp;lt;/em&amp;gt; (the number of nested temporal operators) and the &amp;lt;em&amp;gt;implication height&amp;lt;/em&amp;gt; (the number of nested implication operators) of a formula is restricted is also presented.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;The work this talk is based on was already presented at &amp;lt;em&amp;gt;Logic Programming and Nonmonotonic Reasoning&amp;lt;/em&amp;gt; (LPNMR) 26 in Klagenfurt, Austria, on September 2026.&amp;lt;/p&amp;gt;&amp;lt;/body&amp;gt;&amp;lt;/html&amp;gt;&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-10 11:00:00&lt;br /&gt;
|Ende=2026-12-10 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Oscar Barreca&lt;br /&gt;
|Forschungsgruppe=Automatentheorie&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45241</id>
		<title>On the Complexity of Model Checking for Temporal Equilibrium Logic</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=On_the_Complexity_of_Model_Checking_for_Temporal_Equilibrium_Logic&amp;diff=45241"/>
		<updated>2026-10-15T20:24:42Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=On the Complexity of Model Checking for Temporal Equilibrium Logic |Beschreibung EN=Given an interpretation 𝐼 and a formula 𝜑 written in a logic 𝐿 , the problem of model checking (MC) for 𝐿 is the problem of determining whether 𝐼 is a model of 𝜑. In this work, the computational complexity of MC for temporal equilibrium logic (TEL), a temporal extension of ASP, is investigated. The complexity of the universal and…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=On the Complexity of Model Checking for Temporal Equilibrium Logic&lt;br /&gt;
|Beschreibung EN=Given an interpretation 𝐼 and a formula 𝜑 written in a logic 𝐿 , the problem of model checking (MC) for 𝐿 is the problem of determining whether 𝐼 is a model of 𝜑. In this work, the computational complexity of MC for temporal equilibrium logic (TEL), a temporal extension of ASP, is investigated. The complexity of the universal and the existential variant of MC for TEL over Kripke structures, and of MC over linear traces, is determined. The complexity of these problems when the set of temporal operators, the temporal height or the implication height of the input formula is restricted is also determined.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-10 11:00:00&lt;br /&gt;
|Ende=2026-12-10 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Oscar Barreca&lt;br /&gt;
|Forschungsgruppe=Automatentheorie&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Paraconsistent_Semantics_for_Extended_Fuzzy_Logic_Programs_via_Approximation_Fixpoint_Theory&amp;diff=45239</id>
		<title>Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Paraconsistent_Semantics_for_Extended_Fuzzy_Logic_Programs_via_Approximation_Fixpoint_Theory&amp;diff=45239"/>
		<updated>2026-10-15T13:27:28Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory |Beschreibung EN=In logic programming, negation can be interpreted in various ways. Probably best known is the concept of &amp;quot;negation as failure&amp;quot;, where &amp;quot;notp&amp;quot; is true if we have no evidence for p. On the other hand, strong negation requires that we have evidence for p being false. Defining semantics for logic programs containing both kinds…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory&lt;br /&gt;
|Beschreibung EN=In logic programming, negation can be interpreted in various ways. Probably best known is the concept of &amp;quot;negation as failure&amp;quot;, where &amp;quot;notp&amp;quot; is true if we have no evidence for p. On the other hand, strong negation requires that we have evidence for p being false. Defining semantics for logic programs containing both kinds of negation is a challenging task, and this becomes even more challenging when combining this with other extensions of logic programming, e.g. fuzziness. In this work, we use the framework of approximating fixpoint theory to formulate well-behaved semantics for fuzzy logic programs containing both &amp;quot;by-failure&amp;quot; and strong negation. We show that this framework generalizes several existing semantics as well as giving rise to a host of new semantics.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2027-01-07 11:00:00&lt;br /&gt;
|Ende=2027-01-07 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Pascal Kettmann&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Temporal_Properties_of_Conditional_Independence_in_Dynamic_Bayesian_Networks&amp;diff=45232</id>
		<title>Temporal Properties of Conditional Independence in Dynamic Bayesian Networks</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Temporal_Properties_of_Conditional_Independence_in_Dynamic_Bayesian_Networks&amp;diff=45232"/>
		<updated>2026-10-15T07:32:11Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Temporal Properties of Conditional Independence in Dynamic Bayesian Networks |Beschreibung EN=Dynamic Bayesian networks (DBNs) provide compact graphical representations of probabilistic systems that evolve over time. This talk presents results on verifying the evolution of conditional-independence propositions against temporal specifications. Two interpretations are considered: stochastic conditional independence, which takes the…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Temporal Properties of Conditional Independence in Dynamic Bayesian Networks&lt;br /&gt;
|Beschreibung EN=Dynamic Bayesian networks (DBNs) provide compact graphical representations of probabilistic systems that evolve over time. This talk presents results on verifying the evolution of conditional-independence propositions against temporal specifications. Two interpretations are considered: stochastic conditional independence, which takes the concrete probability distributions into account, and structural conditional independence, which depends only on the graphical structure. Deciding whether a stochastic conditional-independence proposition eventually holds is shown to be Skolem-hard. For structural conditional independence, verification against linear temporal logic (LTL) specifications and NBA is in PSPACE and is both NP-hard and coNP-hard.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2027-01-28 11:00:00&lt;br /&gt;
|Ende=2027-01-28 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Rajab Aghamov&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Rewrite_Once,_Validate_Anywhere:_Producing_OWL-Aware_SHACL_Constraints&amp;diff=45228</id>
		<title>Rewrite Once, Validate Anywhere: Producing OWL-Aware SHACL Constraints</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Rewrite_Once,_Validate_Anywhere:_Producing_OWL-Aware_SHACL_Constraints&amp;diff=45228"/>
		<updated>2026-10-14T11:14:02Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Rewrite Once, Validate Anywhere: Producing OWL-Aware SHACL Constraints |Beschreibung EN=The Shapes Constraint Language (SHACL) is a W3C recommendation to express syntactic constraints, called shapes, on RDF graphs. SHACL validators are used to test whether a given graph adheres to such a shape. However, RDF graphs often come with OWL ontologies, whose implicit knowledge needs to be taken into account. This is classically handled…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Rewrite Once, Validate Anywhere: Producing OWL-Aware SHACL Constraints&lt;br /&gt;
|Beschreibung EN=The Shapes Constraint Language (SHACL) is a W3C recommendation to express syntactic constraints, called shapes, on RDF graphs. SHACL validators are used to test whether a given graph adheres to such a shape. However, RDF graphs often come with OWL ontologies, whose implicit knowledge needs to be taken into account. This is classically handled by first applying reasoning and then performing the constraint checking on the results, often using different technologies which makes the process inefficient and vulnerable for mistakes.&lt;br /&gt;
To overcome this, we propose to internalise the OWL axioms in the SHACL constraints; we construct a rewriting which takes as input both shapes and an OWL EL− ontology -- a fragment of OWL EL restricting the usage of existential restrictions -- and produces SHACL constraints. This output can then be evaluated by any validator supporting SHACL core regardless of its reasoning support, while yielding the same results as the traditional approach. The implementation of our translation is evaluated both against applying state-of-the-art reasoners and validators consecutively, as against validators with built-in reasoning support. For our benchmark, we show that our approach is in general more efficient in finding violations compared to the sequential approach, thus providing a powerful tool which simplifies combining reasoning with validation.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-11-26 11:00:00&lt;br /&gt;
|Ende=2026-11-26 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Dörthe Arndt&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Smallest_Synchronizing_Terms_over_Constant_Alphabets_Can_Be_Exponentially_High&amp;diff=45221</id>
		<title>Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Smallest_Synchronizing_Terms_over_Constant_Alphabets_Can_Be_Exponentially_High&amp;diff=45221"/>
		<updated>2026-10-13T08:58:47Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High |Veranstaltungsart=Vortrag |Start=2027-01-21 11:00:00 |Ende=2027-01-21 12:00:00 |Raum=APB 3027 |Vortragender=Luisa Herrmann |Forschungsgruppe=Computational Logic |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2027-01-21 11:00:00&lt;br /&gt;
|Ende=2027-01-21 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Luisa Herrmann&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=A_Guided_Tour_of_Sequent_Formalisms_for_Modal_Logics&amp;diff=45219</id>
		<title>A Guided Tour of Sequent Formalisms for Modal Logics</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=A_Guided_Tour_of_Sequent_Formalisms_for_Modal_Logics&amp;diff=45219"/>
		<updated>2026-10-12T14:39:47Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=A Guided Tour of Sequent Formalisms for Modal Logics |Beschreibung EN=This tutorial explores the landscape of sequent-based proof formalisms for modal logics, using Gödel-Löb provability logic (GL) as a running example. We survey four major paradigms--labeled sequents, nested (or tree) sequents, linear nested sequents, and Gentzen sequents--and discuss the various trade-offs of choosing one formalism over another, including seq…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=A Guided Tour of Sequent Formalisms for Modal Logics&lt;br /&gt;
|Beschreibung EN=This tutorial explores the landscape of sequent-based proof formalisms for modal logics, using Gödel-Löb provability logic (GL) as a running example. We survey four major paradigms--labeled sequents, nested (or tree) sequents, linear nested sequents, and Gentzen sequents--and discuss the various trade-offs of choosing one formalism over another, including sequent size, proof size, and suitability for counter-model extraction. The central theme of the tutorial is understanding how these formalisms relate by means of proof transformations, explaining how one can systematically &amp;quot;transition&amp;quot; between them: from graphs, to trees, to lines, and to points (i.e., standard Gentzen sequents). Along the way, we highlight what is lost or gained in each transition, such as invertibility of rules or proof compactness. We also touch on how the choice of formalism affects proof-search algorithms.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-12-03 11:00:00&lt;br /&gt;
|Ende=2026-12-03 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Tim Lyon&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Reinforcement_Learning_for_BDD_Variable_Ordering&amp;diff=45191</id>
		<title>Reinforcement Learning for BDD Variable Ordering</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Reinforcement_Learning_for_BDD_Variable_Ordering&amp;diff=45191"/>
		<updated>2026-10-09T08:39:47Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Learning to Control Binary Decision Diagrams with Reinforcement Learning&lt;br /&gt;
|Beschreibung EN=Binary Decision Diagrams (BDDs) are a powerful representation of Boolean functions, supporting efficient logical operations and reasoning over large state spaces. However, their practical effectiveness depends heavily on the ordering of variables, with poor orderings potentially causing an exponential increase in representation size. A major limitation of standard BDD-based computation is its reliance on computationally expensive dynamic variable reordering heuristics, which perform extensive search to optimise the size of a static set of diagrams. These methods are fundamentally reactive, aiming to repair variable orderings once the diagrams have already grown substantially large, rather than preventing this growth in the first place. In this talk, I will present my ongoing PhD research on developing a reinforcement learning controller that continuously regulates variable ordering throughout BDD construction and manipulation. Rather than relying on expensive search to repair large diagrams, the objective is to learn a predictive reordering policy that makes decisions directly from the structure of the current diagrams, proactively maintaining compact representations as computation progresses.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-11-05 11:00:00&lt;br /&gt;
|Ende=2026-11-05 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Luke Slater&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Reinforcement_Learning_for_BDD_Variable_Ordering&amp;diff=45185</id>
		<title>Reinforcement Learning for BDD Variable Ordering</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Reinforcement_Learning_for_BDD_Variable_Ordering&amp;diff=45185"/>
		<updated>2026-10-08T10:29:47Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Reinforcement Learning for BDD Variable Ordering |Veranstaltungsart=Vortrag |Start=2026-11-05 11:00:00 |Ende=2026-11-05 12:00:00 |Raum=APB 3027 |Vortragender=Luke Slater |Eingeladen durch=Markus Krötzsch |Forschungsgruppe=Wissensbasierte Systeme |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Reinforcement Learning for BDD Variable Ordering&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-11-05 11:00:00&lt;br /&gt;
|Ende=2026-11-05 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Luke Slater&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Survey_of_Syntax_Splitting&amp;diff=45183</id>
		<title>Survey of Syntax Splitting</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Survey_of_Syntax_Splitting&amp;diff=45183"/>
		<updated>2026-10-08T10:25:57Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Survey of Syntax Splitting |Veranstaltungsart=Vortrag |Start=2026-11-12 11:00:00 |Ende=2026-11-12 12:00:00 |Raum=APB 3027 |Vortragender=Ameerah Allie |Eingeladen durch=Markus Krötzsch |Forschungsgruppe=Wissensbasierte Systeme |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Survey of Syntax Splitting&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-11-12 11:00:00&lt;br /&gt;
|Ende=2026-11-12 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Ameerah Allie&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45179</id>
		<title>Research Seminar Logic and AI</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45179"/>
		<updated>2026-10-07T08:12:39Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#leftsidenav:&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** The first part defines the content of the left-side navigation.&lt;br /&gt;
*** We use a headline &amp;quot;Contents&amp;quot; (you could use any text)&lt;br /&gt;
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)&lt;br /&gt;
*** (this is all writting inside a comment area, hence it does not show on page)&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{LeftsidenavHeading|Contents}}&lt;br /&gt;
&amp;lt;div class=&amp;quot;no-toc-head&amp;quot;&amp;gt;__TOC__&amp;lt;/div&amp;gt;&lt;br /&gt;
|&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** Now comes the actual main part of the page (right-hand side).&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{Main heading|Research Seminar on Logic and AI}}&lt;br /&gt;
&lt;br /&gt;
In this research seminar, we warmly invite speakers to present their research on (inter-disciplinary) topics related to logic, reasoning and artificial intelligence. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. All are welcome!&lt;br /&gt;
&lt;br /&gt;
===Talk Proposal===&lt;br /&gt;
&lt;br /&gt;
The seminar is organized by the [[Wissensbasierte_Systeme/en|Knowledge-Based Systems]] group. It is built on community effort: Please contact [[Nils_Küchenmeister/en|Nils Küchenmeister]] (or, if unavailable, [[Stephan_Mennicke/en|Stephan Mennicke]]), if you would like to give a talk or invite a guest speaker. &lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
The seminar is built on community effort. In addition to reaching out to the organizer, anyone planning on giving a talk or inviting a guest to do so is warmly encouraged to propose tentative talks via the survey:&lt;br /&gt;
https://bildungsportal.sachsen.de/umfragen/limesurvey/index.php/464451?lang=en. The tentative talk schedule is periodically updated in the following spreadsheet, which participants can consult when planning their own talks:&lt;br /&gt;
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule and Location===&lt;br /&gt;
&lt;br /&gt;
The research seminar is scheduled on Thursdays from 11.00 am to 12.00 pm. It is held in a hybrid form, both online through [https://bbb.tu-dresden.de/rooms/j5s-hql-zmm-mgz/join Big Blue Button] (&#039;&#039;This is a new link!&#039;&#039;) and physically in the room [[APB 3027/en|APB 3027]].&lt;br /&gt;
&lt;br /&gt;
For further information on scheduled upcoming seminars please check the program overview below.&lt;br /&gt;
&lt;br /&gt;
====Recent and Upcoming Talks====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;table class=&amp;quot;table&amp;quot; &amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;th&amp;gt;Date&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Speaker&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Topic&amp;lt;/th&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
{{#ask: [[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| ?Titel EN=&lt;br /&gt;
| ?Datum#ISO=&lt;br /&gt;
| ?Vortragender=&lt;br /&gt;
| sort=Datum&lt;br /&gt;
| order=desc&lt;br /&gt;
| format=plainlist&lt;br /&gt;
| template=Talk short inline/en&lt;br /&gt;
| searchlabel=&lt;br /&gt;
| link=none&lt;br /&gt;
| limit=5&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{#ask: [[Event series::Research Seminar Logic and AI]]|&lt;br /&gt;
| ?Datum=Date&lt;br /&gt;
| ?=Title&lt;br /&gt;
| ?Vortragender=Speaker&lt;br /&gt;
| mainlabel=-&lt;br /&gt;
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &amp;amp;hellip;}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{Upcoming events feed&lt;br /&gt;
| L=/en&lt;br /&gt;
| query=[[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| label=Subscribe to upcoming talks (iCal)&lt;br /&gt;
| calendartitle=ICCL Research Seminar Logic and AI&lt;br /&gt;
}}&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
&amp;lt;/table&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Calendar===&lt;br /&gt;
&amp;lt;!--Temporary unavailable&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]&lt;br /&gt;
| ?Start&lt;br /&gt;
| ?Ende&lt;br /&gt;
| ?Titel EN=title&lt;br /&gt;
| ?Raum=Room&lt;br /&gt;
| ?Veranstaltungsart=&amp;lt;br/&amp;gt;Type&lt;br /&gt;
| ?Vortragender=&amp;lt;br/&amp;gt;Speaker&lt;br /&gt;
| ?Beschreibung EN=&amp;lt;br/&amp;gt;Details&lt;br /&gt;
| format=eventcalendar&lt;br /&gt;
| firstday=Monday&lt;br /&gt;
| defaultview=month&lt;br /&gt;
| limit=1000&lt;br /&gt;
| link=subject&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- Closing braces for the two-column layout (&amp;quot;leftsidenav&amp;quot; at the top); DON&#039;T DELETE THIS BY ACCIDENT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#set:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2020&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45157</id>
		<title>Research Seminar Logic and AI</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45157"/>
		<updated>2026-10-06T07:22:26Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#leftsidenav:&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** The first part defines the content of the left-side navigation.&lt;br /&gt;
*** We use a headline &amp;quot;Contents&amp;quot; (you could use any text)&lt;br /&gt;
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)&lt;br /&gt;
*** (this is all writting inside a comment area, hence it does not show on page)&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{LeftsidenavHeading|Contents}}&lt;br /&gt;
&amp;lt;div class=&amp;quot;no-toc-head&amp;quot;&amp;gt;__TOC__&amp;lt;/div&amp;gt;&lt;br /&gt;
|&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** Now comes the actual main part of the page (right-hand side).&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{Main heading|Research Seminar on Logic and AI}}&lt;br /&gt;
&lt;br /&gt;
In this research seminar, we warmly invite speakers to present their research on (inter-disciplinary) topics related to logic, reasoning and artificial intelligence. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. All are welcome!&lt;br /&gt;
&lt;br /&gt;
===Talk Proposal===&lt;br /&gt;
&lt;br /&gt;
The seminar is organized by the [[Wissensbasierte_Systeme/en|Knowledge-Based Systems]] group. It is built on community effort: Please contact [[Nils_Küchenmeister/en|Nils Küchenmeister]] (or, if unavailable, [[Stephan_Mennicke/en|Stephan Mennicke]]), if you would like to give a talk or invite a guest speaker. &lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
The seminar is built on community effort. In addition to reaching out to the organizer, anyone planning on giving a talk or inviting a guest to do so is warmly encouraged to propose tentative talks via the survey:&lt;br /&gt;
https://bildungsportal.sachsen.de/umfragen/limesurvey/index.php/464451?lang=en. The tentative talk schedule is periodically updated in the following spreadsheet, which participants can consult when planning their own talks:&lt;br /&gt;
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule and Location===&lt;br /&gt;
&lt;br /&gt;
The research seminar is scheduled on Thursdays from 11.00 am to 12.00 pm. It is held in a hybrid form, both online through [https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join Big Blue Button] (&#039;&#039;to be updated&#039;&#039;) and physically in the room [[APB 3027/en|APB 3027]].&lt;br /&gt;
&lt;br /&gt;
For further information on scheduled upcoming seminars please check the program overview below.&lt;br /&gt;
&lt;br /&gt;
====Recent and Upcoming Talks====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;table class=&amp;quot;table&amp;quot; &amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;th&amp;gt;Date&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Speaker&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Topic&amp;lt;/th&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
{{#ask: [[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| ?Titel EN=&lt;br /&gt;
| ?Datum#ISO=&lt;br /&gt;
| ?Vortragender=&lt;br /&gt;
| sort=Datum&lt;br /&gt;
| order=desc&lt;br /&gt;
| format=plainlist&lt;br /&gt;
| template=Talk short inline/en&lt;br /&gt;
| searchlabel=&lt;br /&gt;
| link=none&lt;br /&gt;
| limit=5&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{#ask: [[Event series::Research Seminar Logic and AI]]|&lt;br /&gt;
| ?Datum=Date&lt;br /&gt;
| ?=Title&lt;br /&gt;
| ?Vortragender=Speaker&lt;br /&gt;
| mainlabel=-&lt;br /&gt;
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &amp;amp;hellip;}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{Upcoming events feed&lt;br /&gt;
| L=/en&lt;br /&gt;
| query=[[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| label=Subscribe to upcoming talks (iCal)&lt;br /&gt;
| calendartitle=ICCL Research Seminar Logic and AI&lt;br /&gt;
}}&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
&amp;lt;/table&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Calendar===&lt;br /&gt;
&amp;lt;!--Temporary unavailable&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]&lt;br /&gt;
| ?Start&lt;br /&gt;
| ?Ende&lt;br /&gt;
| ?Titel EN=title&lt;br /&gt;
| ?Raum=Room&lt;br /&gt;
| ?Veranstaltungsart=&amp;lt;br/&amp;gt;Type&lt;br /&gt;
| ?Vortragender=&amp;lt;br/&amp;gt;Speaker&lt;br /&gt;
| ?Beschreibung EN=&amp;lt;br/&amp;gt;Details&lt;br /&gt;
| format=eventcalendar&lt;br /&gt;
| firstday=Monday&lt;br /&gt;
| defaultview=month&lt;br /&gt;
| limit=1000&lt;br /&gt;
| link=subject&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- Closing braces for the two-column layout (&amp;quot;leftsidenav&amp;quot; at the top); DON&#039;T DELETE THIS BY ACCIDENT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#set:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2020&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45156</id>
		<title>Research Seminar Logic and AI</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45156"/>
		<updated>2026-10-06T06:33:24Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#leftsidenav:&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** The first part defines the content of the left-side navigation.&lt;br /&gt;
*** We use a headline &amp;quot;Contents&amp;quot; (you could use any text)&lt;br /&gt;
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)&lt;br /&gt;
*** (this is all writting inside a comment area, hence it does not show on page)&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{LeftsidenavHeading|Contents}}&lt;br /&gt;
&amp;lt;div class=&amp;quot;no-toc-head&amp;quot;&amp;gt;__TOC__&amp;lt;/div&amp;gt;&lt;br /&gt;
|&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** Now comes the actual main part of the page (right-hand side).&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{Main heading|Research Seminar on Logic and AI}}&lt;br /&gt;
&lt;br /&gt;
In this research seminar, we warmly invite speakers to present their research on (inter-disciplinary) topics related to logic, reasoning and artificial intelligence. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. All are welcome!&lt;br /&gt;
&lt;br /&gt;
===Talk Proposal===&lt;br /&gt;
&lt;br /&gt;
The seminar is organized by the [[Wissensbasierte_Systeme/en|Knowledge-Based Systems]] group. It is built on community effort: Please contact [[Nils_Küchenmeister/en|Nils Küchenmeister]] (or, if unavailable, [[Stephan_Mennicke/en|Stephan Mennicke]]), if you would like to give a talk or invite a guest speaker. &lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
The seminar is built on community effort. In addition to reaching out to the organizer, anyone planning on giving a talk or inviting a guest to do so is warmly encouraged to propose tentative talks via the survey:&lt;br /&gt;
https://bildungsportal.sachsen.de/umfragen/limesurvey/index.php/464451?lang=en. The tentative talk schedule is periodically updated in the following spreadsheet, which participants can consult when planning their own talks:&lt;br /&gt;
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule and Location===&lt;br /&gt;
&lt;br /&gt;
The research seminar is scheduled on Thursdays from 11.00 am to 12.00 pm. It is held in a hybrid form, both online through [https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join Big Blue Button] and physically in the room [[APB 3027/en|APB 3027]].&lt;br /&gt;
&lt;br /&gt;
For further information on scheduled upcoming seminars please check the program overview below.&lt;br /&gt;
&lt;br /&gt;
====Recent and Upcoming Talks====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;table class=&amp;quot;table&amp;quot; &amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;th&amp;gt;Date&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Speaker&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Topic&amp;lt;/th&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
{{#ask: [[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| ?Titel EN=&lt;br /&gt;
| ?Datum#ISO=&lt;br /&gt;
| ?Vortragender=&lt;br /&gt;
| sort=Datum&lt;br /&gt;
| order=desc&lt;br /&gt;
| format=plainlist&lt;br /&gt;
| template=Talk short inline/en&lt;br /&gt;
| searchlabel=&lt;br /&gt;
| link=none&lt;br /&gt;
| limit=5&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{#ask: [[Event series::Research Seminar Logic and AI]]|&lt;br /&gt;
| ?Datum=Date&lt;br /&gt;
| ?=Title&lt;br /&gt;
| ?Vortragender=Speaker&lt;br /&gt;
| mainlabel=-&lt;br /&gt;
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &amp;amp;hellip;}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{Upcoming events feed&lt;br /&gt;
| L=/en&lt;br /&gt;
| query=[[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| label=Subscribe to upcoming talks (iCal)&lt;br /&gt;
| calendartitle=ICCL Research Seminar Logic and AI&lt;br /&gt;
}}&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
&amp;lt;/table&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Calendar===&lt;br /&gt;
&amp;lt;!--Temporary unavailable&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]&lt;br /&gt;
| ?Start&lt;br /&gt;
| ?Ende&lt;br /&gt;
| ?Titel EN=title&lt;br /&gt;
| ?Raum=Room&lt;br /&gt;
| ?Veranstaltungsart=&amp;lt;br/&amp;gt;Type&lt;br /&gt;
| ?Vortragender=&amp;lt;br/&amp;gt;Speaker&lt;br /&gt;
| ?Beschreibung EN=&amp;lt;br/&amp;gt;Details&lt;br /&gt;
| format=eventcalendar&lt;br /&gt;
| firstday=Monday&lt;br /&gt;
| defaultview=month&lt;br /&gt;
| limit=1000&lt;br /&gt;
| link=subject&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- Closing braces for the two-column layout (&amp;quot;leftsidenav&amp;quot; at the top); DON&#039;T DELETE THIS BY ACCIDENT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#set:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2020&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45155</id>
		<title>Research Seminar Logic and AI</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45155"/>
		<updated>2026-10-06T06:32:02Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#leftsidenav:&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** The first part defines the content of the left-side navigation.&lt;br /&gt;
*** We use a headline &amp;quot;Contents&amp;quot; (you could use any text)&lt;br /&gt;
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)&lt;br /&gt;
*** (this is all writting inside a comment area, hence it does not show on page)&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{LeftsidenavHeading|Contents}}&lt;br /&gt;
&amp;lt;div class=&amp;quot;no-toc-head&amp;quot;&amp;gt;__TOC__&amp;lt;/div&amp;gt;&lt;br /&gt;
|&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** Now comes the actual main part of the page (right-hand side).&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{Main heading|Research Seminar on Logic and AI}}&lt;br /&gt;
&lt;br /&gt;
In this research seminar, we warmly invite speakers to present their research on (inter-disciplinary) topics related to logic, reasoning and artificial intelligence. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. All are welcome!&lt;br /&gt;
&lt;br /&gt;
===Talk Proposal===&lt;br /&gt;
&lt;br /&gt;
The seminar is organized by the [[Wissensbasierte_Systeme/en|Knowledge-Based Systems]] group. It is built on community effort: Please contact [[Nils_Küchenmeister/en|Nils Küchenmeister]] (or, if unavailable, [[Stephan_Mennicke/en|Stephan Mennicke]]), if you would like to give a talk or invite a guest speaker. &lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
The seminar is built on community effort. In addition to reaching out to the organizer, anyone planning on giving a talk or inviting a guest to do so is warmly encouraged to propose tentative talks via the survey:&lt;br /&gt;
https://bildungsportal.sachsen.de/umfragen/limesurvey/index.php/464451?lang=en. The tentative talk schedule is periodically updated in the following spreadsheet, which participants can consult when planning their own talks:&lt;br /&gt;
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule and Location===&lt;br /&gt;
&lt;br /&gt;
The research seminar is scheduled on Thursdays from 11.00 am to 12.00 pm. It is held in a hybrid form, both online through [https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join Big Blue Button] and physically in the room APB-3027.&lt;br /&gt;
&lt;br /&gt;
For further information on scheduled upcoming seminars please check the program overview below.&lt;br /&gt;
&lt;br /&gt;
====Recent and Upcoming Talks====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;table class=&amp;quot;table&amp;quot; &amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;th&amp;gt;Date&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Speaker&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Topic&amp;lt;/th&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
{{#ask: [[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| ?Titel EN=&lt;br /&gt;
| ?Datum#ISO=&lt;br /&gt;
| ?Vortragender=&lt;br /&gt;
| sort=Datum&lt;br /&gt;
| order=desc&lt;br /&gt;
| format=plainlist&lt;br /&gt;
| template=Talk short inline/en&lt;br /&gt;
| searchlabel=&lt;br /&gt;
| link=none&lt;br /&gt;
| limit=5&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{#ask: [[Event series::Research Seminar Logic and AI]]|&lt;br /&gt;
| ?Datum=Date&lt;br /&gt;
| ?=Title&lt;br /&gt;
| ?Vortragender=Speaker&lt;br /&gt;
| mainlabel=-&lt;br /&gt;
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &amp;amp;hellip;}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{Upcoming events feed&lt;br /&gt;
| L=/en&lt;br /&gt;
| query=[[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| label=Subscribe to upcoming talks (iCal)&lt;br /&gt;
| calendartitle=ICCL Research Seminar Logic and AI&lt;br /&gt;
}}&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
&amp;lt;/table&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Calendar===&lt;br /&gt;
&amp;lt;!--Temporary unavailable&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]&lt;br /&gt;
| ?Start&lt;br /&gt;
| ?Ende&lt;br /&gt;
| ?Titel EN=title&lt;br /&gt;
| ?Raum=Room&lt;br /&gt;
| ?Veranstaltungsart=&amp;lt;br/&amp;gt;Type&lt;br /&gt;
| ?Vortragender=&amp;lt;br/&amp;gt;Speaker&lt;br /&gt;
| ?Beschreibung EN=&amp;lt;br/&amp;gt;Details&lt;br /&gt;
| format=eventcalendar&lt;br /&gt;
| firstday=Monday&lt;br /&gt;
| defaultview=month&lt;br /&gt;
| limit=1000&lt;br /&gt;
| link=subject&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- Closing braces for the two-column layout (&amp;quot;leftsidenav&amp;quot; at the top); DON&#039;T DELETE THIS BY ACCIDENT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#set:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2020&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45154</id>
		<title>Research Seminar Logic and AI</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45154"/>
		<updated>2026-10-06T06:31:19Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#leftsidenav:&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** The first part defines the content of the left-side navigation.&lt;br /&gt;
*** We use a headline &amp;quot;Contents&amp;quot; (you could use any text)&lt;br /&gt;
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)&lt;br /&gt;
*** (this is all writting inside a comment area, hence it does not show on page)&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{LeftsidenavHeading|Contents}}&lt;br /&gt;
&amp;lt;div class=&amp;quot;no-toc-head&amp;quot;&amp;gt;__TOC__&amp;lt;/div&amp;gt;&lt;br /&gt;
|&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** Now comes the actual main part of the page (right-hand side).&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{Main heading|Research Seminar on Logic and AI}}&lt;br /&gt;
&lt;br /&gt;
In this research seminar, we warmly invite speakers to present their research on (inter-disciplinary) topics related to logic, reasoning and artificial intelligence. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. All are welcome!&lt;br /&gt;
&lt;br /&gt;
===Talk Proposal===&lt;br /&gt;
&lt;br /&gt;
The seminar is organized by the [[Wissensbasierte_Systeme/en|Knowledge-Based Systems]] group. It is built on community effort: Please contact [[Nils_Küchenmeister/en|Nils Küchenmeister]] (or, if unavailable, [[Stephan_Mennicke/en|Stephan Mennicke]]), if you would like to give a talk or invite a guest speaker. &lt;br /&gt;
&lt;br /&gt;
*** The seminar is built on community effort. In addition to reaching out to the organizer, anyone planning on giving a talk or inviting a guest to do so is warmly encouraged to propose tentative talks via the survey:&lt;br /&gt;
*** https://bildungsportal.sachsen.de/umfragen/limesurvey/index.php/464451?lang=en. The tentative talk schedule is periodically updated in the following spreadsheet, which participants can consult when planning their own talks:&lt;br /&gt;
*** https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.&lt;br /&gt;
&lt;br /&gt;
===Schedule and Location===&lt;br /&gt;
&lt;br /&gt;
The research seminar is scheduled on Thursdays from 11.00 am to 12.00 pm. It is held in a hybrid form, both online through [https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join Big Blue Button] and physically in the room APB-3027.&lt;br /&gt;
&lt;br /&gt;
For further information on scheduled upcoming seminars please check the program overview below.&lt;br /&gt;
&lt;br /&gt;
====Recent and Upcoming Talks====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;table class=&amp;quot;table&amp;quot; &amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;th&amp;gt;Date&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Speaker&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Topic&amp;lt;/th&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
{{#ask: [[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| ?Titel EN=&lt;br /&gt;
| ?Datum#ISO=&lt;br /&gt;
| ?Vortragender=&lt;br /&gt;
| sort=Datum&lt;br /&gt;
| order=desc&lt;br /&gt;
| format=plainlist&lt;br /&gt;
| template=Talk short inline/en&lt;br /&gt;
| searchlabel=&lt;br /&gt;
| link=none&lt;br /&gt;
| limit=5&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{#ask: [[Event series::Research Seminar Logic and AI]]|&lt;br /&gt;
| ?Datum=Date&lt;br /&gt;
| ?=Title&lt;br /&gt;
| ?Vortragender=Speaker&lt;br /&gt;
| mainlabel=-&lt;br /&gt;
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &amp;amp;hellip;}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{Upcoming events feed&lt;br /&gt;
| L=/en&lt;br /&gt;
| query=[[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| label=Subscribe to upcoming talks (iCal)&lt;br /&gt;
| calendartitle=ICCL Research Seminar Logic and AI&lt;br /&gt;
}}&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
&amp;lt;/table&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Calendar===&lt;br /&gt;
&amp;lt;!--Temporary unavailable&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]&lt;br /&gt;
| ?Start&lt;br /&gt;
| ?Ende&lt;br /&gt;
| ?Titel EN=title&lt;br /&gt;
| ?Raum=Room&lt;br /&gt;
| ?Veranstaltungsart=&amp;lt;br/&amp;gt;Type&lt;br /&gt;
| ?Vortragender=&amp;lt;br/&amp;gt;Speaker&lt;br /&gt;
| ?Beschreibung EN=&amp;lt;br/&amp;gt;Details&lt;br /&gt;
| format=eventcalendar&lt;br /&gt;
| firstday=Monday&lt;br /&gt;
| defaultview=month&lt;br /&gt;
| limit=1000&lt;br /&gt;
| link=subject&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- Closing braces for the two-column layout (&amp;quot;leftsidenav&amp;quot; at the top); DON&#039;T DELETE THIS BY ACCIDENT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#set:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2020&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Pseudo-Closed_Family_Verification_is_NP-Complete_(Or:_How_Claude_Helped_Tackle_Bernhard%E2%80%99s_Problem)&amp;diff=45151</id>
		<title>Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Pseudo-Closed_Family_Verification_is_NP-Complete_(Or:_How_Claude_Helped_Tackle_Bernhard%E2%80%99s_Problem)&amp;diff=45151"/>
		<updated>2026-10-06T06:26:43Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) |Beschreibung EN=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…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)&lt;br /&gt;
|Beschreibung EN=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&#039;25, which essentially asked for &amp;quot;easy&amp;quot; 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.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-10-08 11:00:00&lt;br /&gt;
|Ende=2026-10-08 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Sebastian Rudolph&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Stratified_Negation_in_RDF_Rules:_A_Correct_Approach&amp;diff=45145</id>
		<title>Stratified Negation in RDF Rules: A Correct Approach</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Stratified_Negation_in_RDF_Rules:_A_Correct_Approach&amp;diff=45145"/>
		<updated>2026-10-05T15:14:35Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Stratified Negation in RDF Rules: A Correct Approach |Beschreibung EN=Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging. Existing methods to stratify negation often fail for RDF rules, since individual triples do not carry enough information to meaningfully restrict potential dependencies. Blank nodes in rule heads further complicate the matter, since the order of rule applications may…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Stratified Negation in RDF Rules: A Correct Approach&lt;br /&gt;
|Beschreibung EN=Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging. Existing methods to stratify negation often fail for RDF rules, since individual triples do not carry enough information to meaningfully restrict potential dependencies. Blank nodes in rule heads further complicate the matter, since the order of rule applications may determine whether new values are created, which in turn can change the applicability of rules with negation. To solve these open problems, we propose chain stratification as a robust new condition that guarantees a well-behaved semantics for RDF rules with negation, and existential rules in general. Our condition combines an elaborate analysis of potential multistep derivations with a mechanism for using integrity constraints to discard impossible cases. Applying rules in any order that respects chain stratification is guaranteed to derive an RDF graph that is unique, lean, and justified under the usual negation-as-failure semantics. To show the practicality, we also provide a prototype implementation.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-10-22 11:30:00&lt;br /&gt;
|Ende=2026-10-22 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Nils Küchenmeister&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Recovering_Explanations_from_Transformed_Rule-Based_Ontologies&amp;diff=45143</id>
		<title>Recovering Explanations from Transformed Rule-Based Ontologies</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Recovering_Explanations_from_Transformed_Rule-Based_Ontologies&amp;diff=45143"/>
		<updated>2026-10-05T15:12:55Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Recovering Explanations from Transformed Rule-Based Ontologies |Beschreibung EN=Datalog rules are often used to define ontologies over Knowledge Graphs. Rule reasoners routinely optimise such ontologies by rewriting their rules into a form that can be evaluated more efficiently. These transformations preserve the entailed facts, but not the structure of the underlying derivations. A proof tree under the rewritten rules explains w…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Recovering Explanations from Transformed Rule-Based Ontologies&lt;br /&gt;
|Beschreibung EN=Datalog rules are often used to define ontologies over Knowledge Graphs. Rule reasoners routinely optimise such ontologies by rewriting their rules into a form that can be evaluated more efficiently. These transformations preserve the entailed facts, but not the structure of the underlying derivations. A proof tree under the rewritten rules explains why a fact holds, but does not readily yield an explanation in terms of the original rules. We study the problem of constructing, from a proof of entailment under the rewritten rules, a proof under the original ones: we establish its computational complexity and identify two practically relevant languages for specifying proof transformations.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-10-22 11:00:00&lt;br /&gt;
|Ende=2026-10-22 11:30:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Alex Ivliev&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Towards_Finite_Satisfiability_Problem_for_Propositional_Dynamic_Logic_with_Loops&amp;diff=45142</id>
		<title>Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Towards_Finite_Satisfiability_Problem_for_Propositional_Dynamic_Logic_with_Loops&amp;diff=45142"/>
		<updated>2026-10-05T15:10:32Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops&lt;br /&gt;
|Beschreibung EN=Propositional Dynamic Logic (PDL) is a well-established modal logic of programs. Among its many extensions, the loop operator stands out for capturing the cyclic behaviour of programs: a world satisfies loop(pi) precisely when it can return to itself along a path matching the regular expression pi. While the satisfiability problem for the resulting logic LoopPDL was settled already in the 1980s, the decidability of its finite satisfiability problem has remained open ever since. The core difficulty is inherent to the finite setting: requiring and forbidding cycles at once is easily reconciled over arbitrary models, but over finite ones it defeats the existing finite-model-theoretic techniques.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
During the talk, I will provide a high-level overview of my ongoing work with my PhD student, Mikołaj Swoboda, a substantial part of which is currently under submission. In this work, we solve the problem for a large fragment of LoopPDL and are currently extending our approach towards a solution for the full problem.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-10-15 11:00:00&lt;br /&gt;
|Ende=2026-10-15 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Bartosz Jan Bednarczyk&lt;br /&gt;
|Eingeladen durch=Sebastian Rudolph&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Towards_Finite_Satisfiability_Problem_for_Propositional_Dynamic_Logic_with_Loops&amp;diff=45140</id>
		<title>Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Towards_Finite_Satisfiability_Problem_for_Propositional_Dynamic_Logic_with_Loops&amp;diff=45140"/>
		<updated>2026-10-05T15:10:01Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops |Beschreibung EN=Propositional Dynamic Logic (PDL) is a well-established modal logic of programs. Among its many extensions, the loop operator stands out for capturing the cyclic behaviour of programs: a world satisfies loop(pi) precisely when it can return to itself along a path matching the regular expression pi. While the satisfiability problem fo…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops&lt;br /&gt;
|Beschreibung EN=Propositional Dynamic Logic (PDL) is a well-established modal logic of programs. Among its many extensions, the loop operator stands out for capturing the cyclic behaviour of programs: a world satisfies loop(pi) precisely when it can return to itself along a path matching the regular expression pi. While the satisfiability problem for the resulting logic LoopPDL was settled already in the 1980s, the decidability of its finite satisfiability problem has remained open ever since. The core difficulty is inherent to the finite setting: requiring and forbidding cycles at once is easily reconciled over arbitrary models, but over finite ones it defeats the existing finite-model-theoretic techniques.&lt;br /&gt;
&lt;br /&gt;
During the talk, I will provide a high-level overview of my ongoing work with my PhD student, Mikołaj Swoboda, a substantial part of which is currently under submission. In this work, we solve the problem for a large fragment of LoopPDL and are currently extending our approach towards a solution for the full problem.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-10-15 11:00:00&lt;br /&gt;
|Ende=2026-10-15 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Bartosz Jan Bednarczyk&lt;br /&gt;
|Eingeladen durch=Sebastian Rudolph&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Mo%27_nads,_mo%27_problems&amp;diff=45138</id>
		<title>Mo&#039; nads, mo&#039; problems</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Mo%27_nads,_mo%27_problems&amp;diff=45138"/>
		<updated>2026-10-05T15:06:30Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Mo&amp;#039; nads, mo&amp;#039; problems |Beschreibung EN=There are many important concepts in category theory that find immediate use in theoretical computer science, the most famous of which being monads. This talk will serve as a short introduction for computer scientists to the theory of monads. We will first discuss (using supporting examples from computer science) some of the foundational structures of category theory: mainly functors, natur…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Mo&#039; nads, mo&#039; problems&lt;br /&gt;
|Beschreibung EN=There are many important concepts in category theory that find immediate use in theoretical computer science, the most famous of which being monads. This talk will serve as a short introduction for computer scientists to the theory of monads. We will first discuss (using supporting examples from computer science) some of the foundational structures of category theory: mainly functors, natural transformations, equivalences and adjunctions. Then we will move onto monads, covering some basic results and where I am using them in my project this year. If we have enough time, we will also look at their use as transporters of algebraic structures.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-09-17 11:00:00&lt;br /&gt;
|Ende=2026-09-17 12:00:00&lt;br /&gt;
|Raum=APB 2026&lt;br /&gt;
|Vortragender=Kate Birch&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Equivalence_Checking_Between_Logic_Programs_with_Aggregates_in_ASP&amp;diff=45137</id>
		<title>Equivalence Checking Between Logic Programs with Aggregates in ASP</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Equivalence_Checking_Between_Logic_Programs_with_Aggregates_in_ASP&amp;diff=45137"/>
		<updated>2026-10-05T14:57:29Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Equivalence Checking Between Logic Programs with Aggregates in ASP&lt;br /&gt;
|Beschreibung EN=Answer Set Programming (ASP) is a form of declarative programming. It is used in a range of practical applications in problem solving tasks, which has continued to expand in recent years. Equivalence checking is useful to determine whether modifications to a program preserve the intended meaning, or when evaluating a program’s semantic correctness according to the standard of another. Determining whether complex ASP programs represent the same knowledge can be difficult and there are different senses of equivalence which can be applied. The current state-of-the-art in equivalence checking of ASP programs is ANTHEM 2.0.  ANTHEM provides automated equivalence checking over a subset of ASP programs, but does not support several common program features such as, aggregates, strong negation, and positive recursion. This project aims to extend ANTHEM toward complete coverage of the languages of ASP solvers clingo and DLV, which are the predominant tools for evaluating ASP programs. This has the potential to benefit future ASP research, such as that involving automated ASP generation, as well as ASP programming in practice.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-10-01 11:00:00&lt;br /&gt;
|Ende=2026-10-01 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Rowan Rosenberg&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Equivalence_Checking_Between_Logic_Programs_with_Aggregates_in_ASP&amp;diff=45135</id>
		<title>Equivalence Checking Between Logic Programs with Aggregates in ASP</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Equivalence_Checking_Between_Logic_Programs_with_Aggregates_in_ASP&amp;diff=45135"/>
		<updated>2026-10-05T14:54:52Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Equivalence Checking Between Logic Programs with Aggregates in ASP |Beschreibung EN=Answer Set Programming (ASP) is a form of declarative programming. It is   used in a range of practical applications in problem solving tasks,   which has continued to expand in recent years. Equivalence checking is   useful to determine whether modifications to a program preserve the   intended meaning, or when evaluating a program’s semantic c…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Veranstaltung&lt;br /&gt;
|Titel EN=Equivalence Checking Between Logic Programs with Aggregates in ASP&lt;br /&gt;
|Beschreibung EN=Answer Set Programming (ASP) is a form of declarative programming. It is &lt;br /&gt;
used in a range of practical applications in problem solving tasks, &lt;br /&gt;
which has continued to expand in recent years. Equivalence checking is &lt;br /&gt;
useful to determine whether modifications to a program preserve the &lt;br /&gt;
intended meaning, or when evaluating a program’s semantic correctness &lt;br /&gt;
according to the standard of another. Determining whether complex ASP &lt;br /&gt;
programs represent the same knowledge can be difficult and there are &lt;br /&gt;
different senses of equivalence which can be applied. The current &lt;br /&gt;
state-of-the-art in equivalence checking of ASP programs is ANTHEM 2.0. &lt;br /&gt;
ANTHEM provides automated equivalence checking over a subset of ASP &lt;br /&gt;
programs, but does not support several common program features such as, &lt;br /&gt;
aggregates, strong negation, and positive&lt;br /&gt;
recursion. This project aims to extend ANTHEM toward complete coverage &lt;br /&gt;
of the languages of ASP solvers clingo and DLV, which are the &lt;br /&gt;
predominant tools for evaluating ASP programs. This has the potential to &lt;br /&gt;
benefit future ASP research, such as that involving automated ASP &lt;br /&gt;
generation, as well as ASP programming in practice.&lt;br /&gt;
|Veranstaltungsart=Vortrag&lt;br /&gt;
|Start=2026-10-01 11:00:00&lt;br /&gt;
|Ende=2026-10-01 12:00:00&lt;br /&gt;
|Raum=APB 3027&lt;br /&gt;
|Vortragender=Rowan Rosenberg&lt;br /&gt;
|Eingeladen durch=Markus Krötzsch&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Event series=Research Seminar Logic and AI&lt;br /&gt;
|In News anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45127</id>
		<title>Research Seminar Logic and AI</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&amp;diff=45127"/>
		<updated>2026-10-05T11:39:19Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{#leftsidenav:&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** The first part defines the content of the left-side navigation.&lt;br /&gt;
*** We use a headline &amp;quot;Contents&amp;quot; (you could use any text)&lt;br /&gt;
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)&lt;br /&gt;
*** (this is all writting inside a comment area, hence it does not show on page)&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{LeftsidenavHeading|Contents}}&lt;br /&gt;
&amp;lt;div class=&amp;quot;no-toc-head&amp;quot;&amp;gt;__TOC__&amp;lt;/div&amp;gt;&lt;br /&gt;
|&amp;lt;!--&lt;br /&gt;
&lt;br /&gt;
*** Now comes the actual main part of the page (right-hand side).&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;{{Main heading|Research Seminar on Logic and AI}}&lt;br /&gt;
&lt;br /&gt;
In this research seminar, we warmly invite speakers to present their research on (inter-disciplinary) topics related to logic, reasoning and artificial intelligence. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. All are welcome!&lt;br /&gt;
&lt;br /&gt;
===Talk Proposal===&lt;br /&gt;
&lt;br /&gt;
The seminar is organized by the [[Wissensbasierte_Systeme/en|Knowledge-Based Systems]] group. Please contact [[Nils_Küchenmeister/en|Nils Küchenmeister]] (or, if unavailable, [[Stephan_Mennicke/en|Stephan Mennicke]]), if you would like to give a talk or invite a guest speaker. &lt;br /&gt;
&lt;br /&gt;
The seminar is built on community effort. In addition to reaching out to the organizer, anyone planning on giving a talk or inviting a guest to do so is warmly encouraged to propose tentative talks via the survey:&lt;br /&gt;
https://bildungsportal.sachsen.de/umfragen/limesurvey/index.php/464451?lang=en. The tentative talk schedule is periodically updated in the following spreadsheet, which participants can consult when planning their own talks:&lt;br /&gt;
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.&lt;br /&gt;
&lt;br /&gt;
===Schedule and Location===&lt;br /&gt;
&lt;br /&gt;
The research seminar is scheduled on Thursdays from 11.00 am to 12.00 pm. It is held in a hybrid form, both online through [https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join Big Blue Button] and physically in the room APB-3027.&lt;br /&gt;
&lt;br /&gt;
For further information on scheduled upcoming seminars please check the program overview below.&lt;br /&gt;
&lt;br /&gt;
====Recent and Upcoming Talks====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;table class=&amp;quot;table&amp;quot; &amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;th&amp;gt;Date&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Speaker&amp;lt;/th&amp;gt;&amp;lt;th&amp;gt;Topic&amp;lt;/th&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
{{#ask: [[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| ?Titel EN=&lt;br /&gt;
| ?Datum#ISO=&lt;br /&gt;
| ?Vortragender=&lt;br /&gt;
| sort=Datum&lt;br /&gt;
| order=desc&lt;br /&gt;
| format=plainlist&lt;br /&gt;
| template=Talk short inline/en&lt;br /&gt;
| searchlabel=&lt;br /&gt;
| link=none&lt;br /&gt;
| limit=5&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{#ask: [[Event series::Research Seminar Logic and AI]]|&lt;br /&gt;
| ?Datum=Date&lt;br /&gt;
| ?=Title&lt;br /&gt;
| ?Vortragender=Speaker&lt;br /&gt;
| mainlabel=-&lt;br /&gt;
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &amp;amp;hellip;}}&amp;lt;/td&amp;gt;&amp;lt;td&amp;gt;{{Upcoming events feed&lt;br /&gt;
| L=/en&lt;br /&gt;
| query=[[Event series::Research Seminar Logic and AI]]&lt;br /&gt;
| label=Subscribe to upcoming talks (iCal)&lt;br /&gt;
| calendartitle=ICCL Research Seminar Logic and AI&lt;br /&gt;
}}&amp;lt;/td&amp;gt;&amp;lt;/tr&amp;gt;&lt;br /&gt;
&amp;lt;/table&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Calendar===&lt;br /&gt;
&amp;lt;!--Temporary unavailable&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]&lt;br /&gt;
| ?Start&lt;br /&gt;
| ?Ende&lt;br /&gt;
| ?Titel EN=title&lt;br /&gt;
| ?Raum=Room&lt;br /&gt;
| ?Veranstaltungsart=&amp;lt;br/&amp;gt;Type&lt;br /&gt;
| ?Vortragender=&amp;lt;br/&amp;gt;Speaker&lt;br /&gt;
| ?Beschreibung EN=&amp;lt;br/&amp;gt;Details&lt;br /&gt;
| format=eventcalendar&lt;br /&gt;
| firstday=Monday&lt;br /&gt;
| defaultview=month&lt;br /&gt;
| limit=1000&lt;br /&gt;
| link=subject&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- Closing braces for the two-column layout (&amp;quot;leftsidenav&amp;quot; at the top); DON&#039;T DELETE THIS BY ACCIDENT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#set:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2020&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Thomas Feller&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2021&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Lecturer=Markus Krötzsch&lt;br /&gt;
|Lecturer=Ali Elhalawati&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2022&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=SS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Title=Research Seminar Logic and AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Lecturer=Sebastian Rudolph&lt;br /&gt;
|Lecturer=Piotr Ostropolski-Nalewaja&lt;br /&gt;
|Modul=INF-AQUA&lt;br /&gt;
|Modul=INF-PM-FOR&lt;br /&gt;
|Term=WS&lt;br /&gt;
|Year=2023&lt;br /&gt;
|SWSLecture=0&lt;br /&gt;
|SWSExercise=2&lt;br /&gt;
|SWSPractical=0&lt;br /&gt;
|@category=Vorlesung&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3477&amp;diff=44887</id>
		<title>Inproceedings3477</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3477&amp;diff=44887"/>
		<updated>2026-08-21T08:17:19Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Nils |ErsterAutorNachname=Küchenmeister |FurtherAuthors=Alex Ivliev; Dörthe Arndt; Markus Krötzsch }} {{Inproceedings |Referiert=1 |Title=Stratified Negation in RDF Rules: A Correct Approach |To appear=1 |Year=2026 |Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026) |Publisher=Springer |Editor=Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto J…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Nils&lt;br /&gt;
|ErsterAutorNachname=Küchenmeister&lt;br /&gt;
|FurtherAuthors=Alex Ivliev; Dörthe Arndt; Markus Krötzsch&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Stratified Negation in RDF Rules: A Correct Approach&lt;br /&gt;
|To appear=1&lt;br /&gt;
|Year=2026&lt;br /&gt;
|Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026)&lt;br /&gt;
|Publisher=Springer&lt;br /&gt;
|Editor=Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto Jimenez Ruiz, Oshani Seneviratne, Lora Aroyo, Gianluca Demartini, Reham Alharbi, Roberto Barile, Claudia d&#039;Amato, Valentina Tamma&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging. Existing methods to stratify negation often fail for RDF rules, since individual triples do not carry enough information to meaningfully restrict potential dependencies. Blank nodes in rule heads further complicate the matter, since the order of rule applications may determine whether new values are created, which in turn can change the applicability of rules with negation. To solve these open problems, we propose chain stratification as a robust new condition that guarantees a well-behaved semantics for RDF rules with negation, and existential rules in general. Our condition combines an elaborate analysis of potential multistep derivations with a mechanism for using integrity constraints to discard impossible cases. Applying rules in any order that respects chain stratification is guaranteed to derive an RDF graph that is unique, lean, and justified under the usual negation-as-failure semantics. To show the practicality, we also provide a prototype implementation.&lt;br /&gt;
|Download=ISWC26-chain-stratification.pdf&lt;br /&gt;
|Link=https://arxiv.org/abs/2607.28778&lt;br /&gt;
|Projekt=CPEC, CeTI, SECAI, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ISWC26-chain-stratification.pdf&amp;diff=44886</id>
		<title>Datei:ISWC26-chain-stratification.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:ISWC26-chain-stratification.pdf&amp;diff=44886"/>
		<updated>2026-08-21T08:17:09Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Article3119&amp;diff=44036</id>
		<title>Article3119</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Article3119&amp;diff=44036"/>
		<updated>2026-02-19T16:10:20Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Nils |ErsterAutorNachname=Küchenmeister |FurtherAuthors=Alex Ivliev; Markus Krötzsch }} {{Article |Referiert=1 |Title=Towards Mass Spectrum Analysis with ASP |To appear=0 |Year=2026 |Month=Februar |Journal=Theory and Practice of Logic Programming |Volume=First View |Pages=pp. 1 - 23 }} {{Publikation Details |Abstract=We present a new use of Answer Set Programming (ASP) to discover the molecular structure of…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Nils&lt;br /&gt;
|ErsterAutorNachname=Küchenmeister&lt;br /&gt;
|FurtherAuthors=Alex Ivliev; Markus Krötzsch&lt;br /&gt;
}}&lt;br /&gt;
{{Article&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Towards Mass Spectrum Analysis with ASP&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2026&lt;br /&gt;
|Month=Februar&lt;br /&gt;
|Journal=Theory and Practice of Logic Programming&lt;br /&gt;
|Volume=First View&lt;br /&gt;
|Pages=pp. 1 - 23&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=We present a new use of Answer Set Programming (ASP) to discover the molecular structure of chemical samples based on the relative abundance of elements and structural fragments, as measured in mass spectrometry. To constrain the exponential search space for this combinatorial problem, we develop canonical representations of molecular structures and an ASP implementation that uses these definitions. We evaluate the correctness of our implementation over a large set of known molecular structures, and we compare its quality and performance to other ASP symmetry-breaking methods and to a commercial tool from analytical chemistry.&lt;br /&gt;
|Download=Towards-mass-spectrum-analysis-with-asp.pdf&lt;br /&gt;
|DOI Name=https://doi.org/10.1017/S1471068426100398&lt;br /&gt;
|Projekt=CPEC, CeTI, InnoSale, SECAI, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Towards-mass-spectrum-analysis-with-asp.pdf&amp;diff=44035</id>
		<title>Datei:Towards-mass-spectrum-analysis-with-asp.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Towards-mass-spectrum-analysis-with-asp.pdf&amp;diff=44035"/>
		<updated>2026-02-19T16:08:08Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43447</id>
		<title>Nils Küchenmeister</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43447"/>
		<updated>2025-10-30T11:55:05Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Nils&lt;br /&gt;
|Nachname=Küchenmeister&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Doktorand&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Email=nils.kuechenmeister@tu-dresden.de&lt;br /&gt;
|Matrix=@nkuechen:tu-dresden.de&lt;br /&gt;
|Raum=APB 3037&lt;br /&gt;
|Bild=Nils Kuechenmeister.jpg&lt;br /&gt;
|Info=Seit Oktober 2025 bin ich wissenschaftlicher Mitarbeiter in der Forschungsgruppe [[Wissensbasierte Systeme]] von Prof. Dr. [[Markus Krötzsch]]. Zuvor habe ich an der Technischen Universität Dresden studiert und dabei Theoretische Informatik sowie Systemarchitektur vertieft. (Daneben war ich als Werkstudent bei der Telekom MMS in Recherche zu Cloud [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] involviert.) Ich interessiere mich besonders für regelbasiertes Schließen mit Datalog und ASP. In diesem Kontext habe ich mit [[Alex Ivliev]] eine prototypische [https://tools.iccl.inf.tu-dresden.de/genmol/ Anwendung] zur Analyse von Massenspektren mit ASP realisiert. Danach ging es in meiner Diplomarbeit um statische Analyse [[Existenzielle Regeln|Existenzieller Regeln]].&lt;br /&gt;
|Info EN=I am research associate in the [[Knowledge-Based Systems]] group of Prof. Dr. [[Markus Krötzsch]] since October 2025.  Before, I studied at the Dresden University of Technology and specialized in theoretical computer science and system architecture. (Next to that, I was involved in research on cloud-based [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] as a working student at Telekom MMS.) I am especially interested in rule-based reasoning with Datalog and ASP. Together with [[Alex Ivliev]], I realised a prototypical [https://tools.iccl.inf.tu-dresden.de/genmol/ tool] to analyse mass spectra with ASP in this context. After that, my Diploma thesis was about static analysis of [[Existenzielle Regeln/en|existential rules]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=0&lt;br /&gt;
|Projekte anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43253</id>
		<title>Nils Küchenmeister</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43253"/>
		<updated>2025-10-06T07:23:08Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Nils&lt;br /&gt;
|Nachname=Küchenmeister&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Doktorand&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Email=nils.kuechenmeister@tu-dresden.de&lt;br /&gt;
|Matrix=@nkuechen:tu-dresden.de&lt;br /&gt;
|Raum=APB 3031&lt;br /&gt;
|Bild=Nils Kuechenmeister.jpg&lt;br /&gt;
|Info=Seit Oktober 2025 bin ich wissenschaftlicher Mitarbeiter in der Forschungsgruppe [[Wissensbasierte Systeme]] von Prof. Dr. [[Markus Krötzsch]]. Zuvor habe ich an der Technischen Universität Dresden studiert und dabei Theoretische Informatik sowie Systemarchitektur vertieft. (Daneben war ich als Werkstudent bei der Telekom MMS in Recherche zu Cloud [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] involviert.) Ich interessiere mich besonders für regelbasiertes Schließen mit Datalog und ASP. In diesem Kontext habe ich mit [[Alex Ivliev]] eine prototypische [https://tools.iccl.inf.tu-dresden.de/genmol/ Anwendung] zur Analyse von Massenspektren mit ASP realisiert. Danach ging es in meiner Diplomarbeit um statische Analyse [[Existenzielle Regeln|Existenzieller Regeln]].&lt;br /&gt;
|Info EN=I am research associate in the [[Knowledge-Based Systems]] group of Prof. Dr. [[Markus Krötzsch]] since October 2025.  Before, I studied at the Dresden University of Technology and specialized in theoretical computer science and system architecture. (Next to that, I was involved in research on cloud-based [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] as a working student at Telekom MMS.) I am especially interested in rule-based reasoning with Datalog and ASP. Together with [[Alex Ivliev]], I realised a prototypical [https://tools.iccl.inf.tu-dresden.de/genmol/ tool] to analyse mass spectra with ASP in this context. After that, my Diploma thesis was about static analysis of [[Existenzielle Regeln/en|existential rules]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=0&lt;br /&gt;
|Projekte anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43252</id>
		<title>Nils Küchenmeister</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43252"/>
		<updated>2025-10-02T16:01:43Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Nils&lt;br /&gt;
|Nachname=Küchenmeister&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Doktorand&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Email=nils.kuechenmeister@tu-dresden.de&lt;br /&gt;
|Matrix=@nkuechen:tu-dresden.de&lt;br /&gt;
|Raum=APB 3031&lt;br /&gt;
|Bild=Nils Kuechenmeister.jpg&lt;br /&gt;
|Info=Seit Oktober 2025 bin ich wissenschaftlicher Mitarbeiter in der Forschungsgruppe [[Wissensbasierte Systeme]] von Prof. Dr. [[Markus Krötzsch]]. Zuvor habe ich an der Technischen Universität Dresden studiert und dabei Theoretische Informatik sowie Systemarchitektur vertieft. (Daneben war ich als Werkstudent bei der Telekom MMS in Recherche zu Cloud [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] involviert.) Ich interessiere mich besonders für regelbasiertes Schließen mit Datalog und ASP. In diesem Kontext habe ich mit [[Alex Ivliev]] eine prototypische [https://tools.iccl.inf.tu-dresden.de/genmol/ Anwendung] zur Analyse von Massenspektren mit ASP realisiert. Danach ging es in meiner Diplomarbeit um statischer Analyse [[Existenzielle Regeln|Existenzieller Regeln]].&lt;br /&gt;
|Info EN=I am research associate in the [[Knowledge-Based Systems]] group of Prof. Dr. [[Markus Krötzsch]] since October 2025.  Before, I studied at the Dresden University of Technology and specialized in theoretical computer science and system architecture. (Next to that, I was involved in research on cloud-based [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] as a working student at Telekom MMS.) I am especially interested in rule-based reasoning with Datalog and ASP. Together with [[Alex Ivliev]], I realised a prototypical [https://tools.iccl.inf.tu-dresden.de/genmol/ tool] to analyse mass spectra with ASP in this context. After that, my Diploma thesis was about static analysis of [[Existenzielle Regeln/en|existential rules]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=0&lt;br /&gt;
|Projekte anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3087&amp;diff=43251</id>
		<title>Misc3087</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3087&amp;diff=43251"/>
		<updated>2025-10-02T15:54:28Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Nils&lt;br /&gt;
|ErsterAutorNachname=Küchenmeister&lt;br /&gt;
}}&lt;br /&gt;
{{Misc&lt;br /&gt;
|Title=Reliance-based Static Analysis of Existential Rules&lt;br /&gt;
|Year=2025&lt;br /&gt;
|Month=August&lt;br /&gt;
|Howpublished=Diploma Thesis, TU Dresden&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Cores are universal models of existential rules knowledge bases that have no redundant facts. They can be determined with the core chase, but this is expensive. Recent work suggested special positive and restraint reliance relations between rules to assess whether applying a rule can activate another and whether a rule should be preferred over another to avoid introducing unnecessary facts into the chase result. They give rise to core-stratifiable rulesets, which are susceptible to a rule-based selection strategy for the restricted chase that does not violate restraints and thus produces a core with certainty. However, there are still many practically relevant rulesets which are not core-stratifiable whilst still supporting core computation with a specialized selection strategy for the restricted chase.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
We examine such cases to propose a new class of rulesets, which we call SCC-contraction core-stratifiable, that broadens the applicability of the restricted chase to compute cores. It is based on deputizing positive reliances by sets of contracted rules, which are formed by syntactically intersecting unifiable parts of the second rule’s body and the first rule’s head to attain the combined effect of applying two respective triggers in succession. Then, rulesets are contraction core-stratifiable iff they have no cycle in the restraints of the contracted reliance graph. We evaluate a prototype implementation on a subset of the Oxford Ontology Repository, revealing that a significant portion is covered by our analysis.&lt;br /&gt;
|Download=2025-08-31 nkuechen diploma-thesis.pdf&lt;br /&gt;
|Slides=2025-09-18 nkuechen slides.pdf&lt;br /&gt;
|Link=https://gitlab.com/nkuechen/contractions-evaluation&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3087&amp;diff=43249</id>
		<title>Misc3087</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3087&amp;diff=43249"/>
		<updated>2025-10-02T15:52:53Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Nils |ErsterAutorNachname=Küchenmeister }} {{Misc |Title=Reliance-based Static Analysis of Existential Rules |Year=2025 |Month=August |Howpublished=Diploma Thesis, TU Dresden }} {{Publikation Details |Abstract=Cores are universal models of existential rules knowledge bases that have no redundant facts. They can be determined with the core chase, but this is expensive. Recent work suggested special positive a…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Nils&lt;br /&gt;
|ErsterAutorNachname=Küchenmeister&lt;br /&gt;
}}&lt;br /&gt;
{{Misc&lt;br /&gt;
|Title=Reliance-based Static Analysis of Existential Rules&lt;br /&gt;
|Year=2025&lt;br /&gt;
|Month=August&lt;br /&gt;
|Howpublished=Diploma Thesis, TU Dresden&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Cores are universal models of existential rules knowledge bases that have no redundant facts. They can be determined with the core chase, but this is expensive. Recent work suggested special positive and restraint reliance relations between rules to assess whether applying a rule can activate another and whether a rule should be preferred over another to avoid introducing unnecessary facts into the chase result. They give rise to core-stratifiable rulesets, which are susceptible to a rule-based selection strategy for the restricted chase that does not violate restraints and thus produces a core with certainty. However, there are still many practically relevant rulesets which are not core-stratifiable whilst still supporting core computation with a specialized selection strategy for the restricted chase.&lt;br /&gt;
&lt;br /&gt;
We examine such cases to propose a new class of rulesets, which we call SCC-contraction core-stratifiable, that broadens the applicability of the restricted chase to compute cores. It is based on deputizing positive reliances by sets of contracted rules, which are formed by syntactically intersecting unifiable parts of the second rule’s body and the first rule’s head to attain the combined effect of applying two respective triggers in succession. Then, rulesets are contraction core-stratifiable iff they have no cycle in the restraints of the contracted reliance graph. We evaluate a prototype implementation on a subset of the Oxford Ontology Repository, revealing that a significant portion is covered by our analysis.&lt;br /&gt;
|Download=2025-08-31 nkuechen diploma-thesis.pdf&lt;br /&gt;
|Slides=2025-09-18 nkuechen slides.pdf&lt;br /&gt;
|Link=https://gitlab.com/nkuechen/contractions-evaluation&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:2025-09-18_nkuechen_slides.pdf&amp;diff=43248</id>
		<title>Datei:2025-09-18 nkuechen slides.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:2025-09-18_nkuechen_slides.pdf&amp;diff=43248"/>
		<updated>2025-10-02T15:50:43Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:2025-08-31_nkuechen_diploma-thesis.pdf&amp;diff=43247</id>
		<title>Datei:2025-08-31 nkuechen diploma-thesis.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:2025-08-31_nkuechen_diploma-thesis.pdf&amp;diff=43247"/>
		<updated>2025-10-02T15:49:12Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43244</id>
		<title>Nils Küchenmeister</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43244"/>
		<updated>2025-10-02T15:38:58Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Nils&lt;br /&gt;
|Nachname=Küchenmeister&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Doktorand&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Email=nils.kuechenmeister@tu-dresden.de&lt;br /&gt;
|Matrix=@nkuechen:tu-dresden.de&lt;br /&gt;
|Raum=APB 3031&lt;br /&gt;
|Bild=Nils Kuechenmeister.jpg&lt;br /&gt;
|Info=Seit Oktober 2025 bin ich wissenschaftlicher Mitarbeiter in der Forschungsgruppe [[Wissensbasierte Systeme]] von Prof. Dr. [[Markus Krötzsch]]. Zuvor habe ich an der Technischen Universität Dresden studiert und dabei Theoretische Informatik sowie Systemarchitektur vertieft. (Daneben war ich als Werkstudent bei der Telekom MMS in Recherche zu Cloud [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] involviert.) Ich interessiere mich besonders für regelbasiertes Schließen mit Datalog und ASP. In diesem Kontext habe ich mit [[Alex Ivliev]] eine prototypische Anwendung zur Analyse von Massenspektren mit ASP realisiert. Danach ging es in meiner Diplomarbeit um statischer Analyse [[Existenzielle Regeln|Existenzieller Regeln]].&lt;br /&gt;
|Info EN=I am research associate in the [[Knowledge-Based Systems]] group of Prof. Dr. [[Markus Krötzsch]] since October 2025.  Before, I studied at the Dresden University of Technology and specialized in theoretical computer science and system architecture. (Next to that, I was involved in research on cloud-based [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] as a working student at Telekom MMS.) I am especially interested in rule-based reasoning with Datalog and ASP. Together with [[Alex Ivliev]], I realised a prototypical tool to analyse mass spectra with ASP in this context. After that, my Diploma thesis was about static analysis of [[Existenzielle Regeln/en|existential rules]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=0&lt;br /&gt;
|Projekte anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Nils_Kuechenmeister.jpg&amp;diff=43243</id>
		<title>Datei:Nils Kuechenmeister.jpg</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Nils_Kuechenmeister.jpg&amp;diff=43243"/>
		<updated>2025-10-02T15:38:46Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43242</id>
		<title>Nils Küchenmeister</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Nils_K%C3%BCchenmeister&amp;diff=43242"/>
		<updated>2025-10-02T15:38:09Z</updated>

		<summary type="html">&lt;p&gt;Nils Küchenmeister: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Nils&lt;br /&gt;
|Nachname=Küchenmeister&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Doktorand&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Email=nils.kuechenmeister@tu-dresden.de&lt;br /&gt;
|Matrix=@nkuechen:tu-dresden.de&lt;br /&gt;
|Raum=APB 3031&lt;br /&gt;
|Bild=Foto Nils Küchenmeister.jpg&lt;br /&gt;
|Info=Seit Oktober 2025 bin ich wissenschaftlicher Mitarbeiter in der Forschungsgruppe [[Wissensbasierte Systeme]] von Prof. Dr. [[Markus Krötzsch]]. Zuvor habe ich an der Technischen Universität Dresden studiert und dabei Theoretische Informatik sowie Systemarchitektur vertieft. (Daneben war ich als Werkstudent bei der Telekom MMS in Recherche zu Cloud [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] involviert.) Ich interessiere mich besonders für regelbasiertes Schließen mit Datalog und ASP. In diesem Kontext habe ich mit [[Alex Ivliev]] eine prototypische Anwendung zur Analyse von Massenspektren mit ASP realisiert. Danach ging es in meiner Diplomarbeit um statischer Analyse [[Existenzielle Regeln|Existenzieller Regeln]].&lt;br /&gt;
|Info EN=I am research associate in the [[Knowledge-Based Systems]] group of Prof. Dr. [[Markus Krötzsch]] since October 2025.  Before, I studied at the Dresden University of Technology and specialized in theoretical computer science and system architecture. (Next to that, I was involved in research on cloud-based [https://en.wikipedia.org/wiki/Confidential_computing Confidential Computing] as a working student at Telekom MMS.) I am especially interested in rule-based reasoning with Datalog and ASP. Together with [[Alex Ivliev]], I realised a prototypical tool to analyse mass spectra with ASP in this context. After that, my Diploma thesis was about static analysis of [[Existenzielle Regeln/en|existential rules]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=0&lt;br /&gt;
|Projekte anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nils Küchenmeister</name></author>
	</entry>
</feed>