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

TBA15

2026-08-03T08:38:24Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
|Titel EN=SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
|Beschreibung DE=The talk will propose a new integration of rule reasoners with one or more RDF stores, using selective SPARQL queries to fetch relevant data. In contrast to previous implementations that merely import results of fixed SPARQL queries, the proposed approach relies on pure logic programs over RDF triple data. Transparent to the user, optimised SPARQL queries then are constructed and evaluated during reasoning. To ensure good performance, the approach develops optimisation methods that adopt ideas from logic program optimisation, including semi-naive evaluation, magic sets, and static filtering. Based on the integration of the methods into the open source rule engine Nemo, the talk will empirically evaluate the approach with complex rule sets over large knowledge graphs.
The talk has been presented at ESWC 2026.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
|Beschreibung EN=The talk will propose a new integration of rule reasoners with one or more RDF stores, using selective SPARQL queries to fetch relevant data. In contrast to previous implementations that merely import results of fixed SPARQL queries, the proposed approach relies on pure logic programs over RDF triple data. Transparent to the user, optimised SPARQL queries then are constructed and evaluated during reasoning. To ensure good performance, the approach develops optimisation methods that adopt ideas from logic program optimisation, including semi-naive evaluation, magic sets, and static filtering. Based on the integration of the methods into the open source rule engine Nemo, the talk will empirically evaluate the approach with complex rule sets over large knowledge graphs.
The talk has been presented at ESWC 2026.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
|Veranstaltungsart=Vortrag
|Start=2026-08-06 11:00:00
|Ende=2026-08-06 12:00:00
|Raum=APB-2026
|Vortragender=Alex Ivliev
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA15

2026-08-03T08:37:01Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
|Titel EN=SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs
|Beschreibung DE=The talk will propose a new integration of rule reasoners with one or more RDF stores, using selective SPARQL queries to fetch relevant data. In contrast to previous implementations that merely import results of fixed SPARQL queries, the proposed approach relies on pure logic programs over RDF triple data. Transparent to the user, optimised SPARQL queries then are constructed and evaluated during reasoning. To ensure good performance, the approach develops optimisation methods that adopt ideas from logic program optimisation, including semi-naive evaluation, magic sets, and static filtering. Based on the integration of the methods into the open source rule engine Nemo, the talk will empirically evaluate the approach with complex rule sets over large knowledge graphs.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
|Beschreibung EN=The talk will propose a new integration of rule reasoners with one or more RDF stores, using selective SPARQL queries to fetch relevant data. In contrast to previous implementations that merely import results of fixed SPARQL queries, the proposed approach relies on pure logic programs over RDF triple data. Transparent to the user, optimised SPARQL queries then are constructed and evaluated during reasoning. To ensure good performance, the approach develops optimisation methods that adopt ideas from logic program optimisation, including semi-naive evaluation, magic sets, and static filtering. Based on the integration of the methods into the open source rule engine Nemo, the talk will empirically evaluate the approach with complex rule sets over large knowledge graphs.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
|Veranstaltungsart=Vortrag
|Start=2026-08-06 11:00:00
|Ende=2026-08-06 12:00:00
|Raum=APB-2026
|Vortragender=Alex Ivliev
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA16

2026-07-26T07:03:13Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
|Titel EN=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
|Beschreibung DE=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). This talk will present an endeavor of crafting a Lean framework around existential rules and the chase. It will discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, it will show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, it will unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.

Talk also presented at the KR conference, in Lisbon, 2026.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). This talk will present an endeavor of crafting a Lean framework around existential rules and the chase. It will discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, it will show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, it will unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.

Talk also presented at the KR conference, in Lisbon, 2026.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-07-30 11:00:00
|Ende=2026-07-30 12:00:00
|Raum=APB-2026
|Vortragender=Lukas Gerlach
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA16

2026-07-26T06:51:21Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
|Titel EN=The Chase in Lean - Crafting a Formal Library for Existential Rule Research
|Beschreibung DE=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). In this work, we present our own endeavor of crafting a Lean framework around existential rules and the chase. We discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, we show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, we unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.
|Beschreibung EN=The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). In this work, we present our own endeavor of crafting a Lean framework around existential rules and the chase. We discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework’s capabilities using known results, we show that the result of a chase is a universal model and outline the formalization for proving that without so-called “alternative matches” it is even a core. Beyond existing literature, we unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.
|Veranstaltungsart=Vortrag
|Start=2026-07-30 11:00:00
|Ende=2026-07-30 12:00:00
|Raum=APB-2026
|Vortragender=Lukas Gerlach
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets

2026-07-13T11:01:17Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
|Titel EN=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
|Beschreibung DE=The talk will present a new approach for computing complete, stable, and preferred extensions of abstract argumentation frameworks. Unlike existing approaches that reduce these problems to the propositional satisfiability problem and solve them with the help of SAT-solvers, the presented approach solves them directly by making use of the fact that the mentioned extensions are contained in certain closure systems. Algorithms enumerate these closed sets and filter the searched extensions. Experimental results show that the approach outperforms the existing approaches for a large number of the test cases.

The talk will be presented at KR 2026 in Lisbon.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=The talk will present a new approach for computing complete, stable, and preferred extensions of abstract argumentation frameworks. Unlike existing approaches that reduce these problems to the propositional satisfiability problem and solve them with the help of SAT-solvers, the presented approach solves them directly by making use of the fact that the mentioned extensions are contained in certain closure systems. Algorithms enumerate these closed sets and filter the searched extensions. Experimental results show that the approach outperforms the existing approaches for a large number of the test cases.

The talk will be presented at KR 2026 in Lisbon.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-07-16 11:00:00
|Ende=2026-07-16 12:00:00
|Raum=APB-2026
|Vortragender=Sergei Obiedkov
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA17

2026-07-13T07:41:56Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-08-13 11:00:00 |Ende=2026-08-13 12:00:00 |Raum=APB-2026 |Vortragender=Fedor Grigoryevich Pogulskiy |Forschungsgruppe=Automatentheorie |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-08-13 11:00:00
|Ende=2026-08-13 12:00:00
|Raum=APB-2026
|Vortragender=Fedor Grigoryevich Pogulskiy
|Forschungsgruppe=Automatentheorie
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets

2026-07-10T09:59:52Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets |Titel EN=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets |Beschreibung DE=The talk will present a new approach for computing complete, stable, and preferred extensions of abstract argumentation frameworks. Unlike existing approaches that reduce these problems to the propositional satisfiability problem and so…“

{{Veranstaltung
|Titel DE=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
|Titel EN=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
|Beschreibung DE=The talk will present a new approach for computing complete, stable, and preferred extensions of abstract argumentation frameworks. Unlike existing approaches that reduce these problems to the propositional satisfiability problem and solve them with the help of SAT-solvers, the presented approach solves them directly by making use of the fact that the mentioned extensions are contained in certain closure systems. Algorithms enumerate these closed sets and filter the searched extensions. Experimental results show that the approach outperforms the existing approaches for a large number of the test cases.
|Beschreibung EN=The talk will present a new approach for computing complete, stable, and preferred extensions of abstract argumentation frameworks. Unlike existing approaches that reduce these problems to the propositional satisfiability problem and solve them with the help of SAT-solvers, the presented approach solves them directly by making use of the fact that the mentioned extensions are contained in certain closure systems. Algorithms enumerate these closed sets and filter the searched extensions. Experimental results show that the approach outperforms the existing approaches for a large number of the test cases.
|Veranstaltungsart=Vortrag
|Start=2026-07-16 11:00:00
|Ende=2026-07-16 12:00:00
|Raum=APB-2026
|Vortragender=Sergei Obiedkov
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA12

2026-07-06T08:35:29Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=ProofTeller: Exposing Recency Bias in LLM Reasoning and Its Side Effects on Communication
|Titel EN=ProofTeller: Exposing Recency Bias in LLM Reasoning and Its Side Effects on Communication.
|Beschreibung DE=The talk will be based on a collaborative work of Mayank Jobanputra, Alisa Kovtunova, Brisca Balthes, Fedor Grigoryevich Pogulskiy, Yifan Wang, Stefan Borgwardt, Vera Demberg.

Large language models (LLMs) are increasingly applied in domains that demand reliable and interpretable reasoning. While formal reasoning methods can generate correct proofs, these proofs are often inaccessible to non-expert users. This raises a natural question: Can LLMs, when given a proof, faithfully interpret its reasoning and communicate it clearly? Recently, the authors have introduced ProofTeller, a benchmark that evaluates this ability across three tasks: (1) identifying key proof steps, (2) summarizing the reasoning, and (3) explaining the result in concise natural language. The benchmark covers three domains: Biology, Drones, and Recipes, representing scientific, safety-critical, and everyday reasoning scenarios. The authors find a consistent near-conclusion bias: LLMs tend to focus on steps closest to the final proof conclusion rather than on the most informative ones. A targeted human study confirms that explanations based on such steps are rated less appropriate for end users. These findings indicate that even when reasoning is provided, current LLMs face challenges in communicating key information in a useful manner, highlighting the need for LLMs that can communicate important details reliably.

The main paper was published in 2025 in the proceedings of the 14th International Joint Conference on Natural Language Processing and the 4th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics. The talk will be also presented at DL 2026 and XLoKR 2026 in Lisbon.
|Beschreibung EN=The talk will be based on a collaborative work of Mayank Jobanputra, Alisa Kovtunova, Brisca Balthes, Fedor Grigoryevich Pogulskiy, Yifan Wang, Stefan Borgwardt, Vera Demberg.

Large language models (LLMs) are increasingly applied in domains that demand reliable and interpretable reasoning. While formal reasoning methods can generate correct proofs, these proofs are often inaccessible to non-expert users. This raises a natural question: Can LLMs, when given a proof, faithfully interpret its reasoning and communicate it clearly? Recently, the authors have introduced ProofTeller, a benchmark that evaluates this ability across three tasks: (1) identifying key proof steps, (2) summarizing the reasoning, and (3) explaining the result in concise natural language. The benchmark covers three domains: Biology, Drones, and Recipes, representing scientific, safety-critical, and everyday reasoning scenarios. The authors find a consistent near-conclusion bias: LLMs tend to focus on steps closest to the final proof conclusion rather than on the most informative ones. A targeted human study confirms that explanations based on such steps are rated less appropriate for end users. These findings indicate that even when reasoning is provided, current LLMs face challenges in communicating key information in a useful manner, highlighting the need for LLMs that can communicate important details reliably.

The main paper was published in 2025 in the proceedings of the 14th International Joint Conference on Natural Language Processing and the 4th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics. The talk will be also presented at DL 2026 and XLoKR 2026 in Lisbon.
|Veranstaltungsart=Vortrag
|Start=2026-07-09 11:00:00
|Ende=2026-07-09 12:00:00
|Raum=APB-2026
|Vortragender=Alisa Kovtunova
|Forschungsgruppe=Automatentheorie
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA14

2026-07-02T14:47:50Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-08-27 11:00:00
|Ende=2026-08-27 12:00:00
|Raum=APB-2026
|Vortragender=Stefan Borgwardt
|Forschungsgruppe=Automatentheorie
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA16

2026-06-22T09:33:43Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-07-30 11:00:00 |Ende=2026-07-30 12:00:00 |Raum=APB-2026 |Vortragender=Lukas Gerlach |Forschungsgruppe=Wissensbasierte Systeme |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-07-30 11:00:00
|Ende=2026-07-30 12:00:00
|Raum=APB-2026
|Vortragender=Lukas Gerlach
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA15

2026-06-22T08:38:30Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-08-06 11:00:00 |Ende=2026-08-06 12:00:00 |Raum=APB-2026 |Vortragender=Alex Ivliev |Forschungsgruppe=Wissensbasierte Systeme |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-08-06 11:00:00
|Ende=2026-08-06 12:00:00
|Raum=APB-2026
|Vortragender=Alex Ivliev
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Research Seminar Logic and AI

2026-06-22T08:29:31Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

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!

===Talk Proposal===

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

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:
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:
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.

===Schedule and Location===

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-2026.

For further information on scheduled upcoming seminars please check the program overview below.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-06-22T08:27:15Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

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:
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:
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.

===Schedule and Location===

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-2026.

For further information on scheduled upcoming seminars please check the program overview below.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-06-22T08:26:32Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

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, defences of very good student theses, as well as presentations of ongoing research. All are welcome!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

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:
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:
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.

===Schedule and Location===

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-2026.

For further information on scheduled upcoming seminars please check the program overview below.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-06-22T08:26:08Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we 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, defences of very good student theses, as well as presentations of ongoing research. All are welcome!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

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:
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:
https://datashare.tu-dresden.de/s/KdfkcWciSsgGWDZ.

===Schedule and Location===

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-2026.

For further information on scheduled upcoming seminars please check the program overview below.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

TBA13

2026-06-22T07:38:34Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Multi-Agent Belief Management
|Titel EN=Multi-Agent Belief Management
|Beschreibung DE=How can groups of imperfect and uncertain agents arrive at reliable collective judgments? This talk approaches this question through the Condorcet Jury Theorem, which formalizes the wisdom-of-the-crowds effect under idealized assumptions.

The first part asks when a group can be expected to identify a correct alternative through voting. After introducing the classical theorem, the speaker will present a generalization to approval voting with multiple alternatives, heterogeneous competence levels, and dependence induced by an opinion leader. The resulting framework provides finite-sample and asymptotic guarantees for collective truth tracking. It is then applied to the comparison between diversity and ability, deriving a threshold that specifies when reduced dependence can compensate for lower competence. The second part asks how uncertain beliefs can be aggregated reliably. The talk introduces Voting for Bins, a method in which interval-valued probabilistic beliefs are transformed into votes over probability intervals. The generalized jury-theorem guarantees then provide bounds on both the correctness and precision of the collective belief. This framework is used to analyze when adding an opinion leads to dilation or contraction of the pooled interval. Finally, the speaker will outline how the same epistemic approach can be extended from probability intervals to the aggregation of numerical estimates.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=How can groups of imperfect and uncertain agents arrive at reliable collective judgments? This talk approaches this question through the Condorcet Jury Theorem, which formalizes the wisdom-of-the-crowds effect under idealized assumptions.

The first part asks when a group can be expected to identify a correct alternative through voting. After introducing the classical theorem, the speaker will present a generalization to approval voting with multiple alternatives, heterogeneous competence levels, and dependence induced by an opinion leader. The resulting framework provides finite-sample and asymptotic guarantees for collective truth tracking. It is then applied to the comparison between diversity and ability, deriving a threshold that specifies when reduced dependence can compensate for lower competence. The second part asks how uncertain beliefs can be aggregated reliably. The talk introduces Voting for Bins, a method in which interval-valued probabilistic beliefs are transformed into votes over probability intervals. The generalized jury-theorem guarantees then provide bounds on both the correctness and precision of the collective belief. This framework is used to analyze when adding an opinion leads to dilation or contraction of the pooled interval. Finally, the speaker will outline how the same epistemic approach can be extended from probability intervals to the aggregation of numerical estimates.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-06-25 11:00:00
|Ende=2026-06-25 12:00:00
|Raum=APB-2026
|Vortragender=Jonas Karge
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA14

2026-06-03T11:56:48Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-08-20 11:00:00 |Ende=2026-08-20 12:00:00 |Raum=APB-2026 |Vortragender=Stefan Borgwardt |Forschungsgruppe=Automatentheorie |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-08-20 11:00:00
|Ende=2026-08-20 12:00:00
|Raum=APB-2026
|Vortragender=Stefan Borgwardt
|Forschungsgruppe=Automatentheorie
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA13

2026-06-03T07:52:28Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-06-25 11:00:00 |Ende=2026-06-25 12:00:00 |Raum=APB-2026 |Vortragender=Jonas Karge |Forschungsgruppe=Computational Logic |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-06-25 11:00:00
|Ende=2026-06-25 12:00:00
|Raum=APB-2026
|Vortragender=Jonas Karge
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA12

2026-06-03T07:51:21Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-07-09 11:00:00 |Ende=2026-07-09 12:00:00 |Raum=APB-2026 |Vortragender=Alisa Kovtunova |Forschungsgruppe=Automatentheorie |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-07-09 11:00:00
|Ende=2026-07-09 12:00:00
|Raum=APB-2026
|Vortragender=Alisa Kovtunova
|Forschungsgruppe=Automatentheorie
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA11

2026-06-03T07:49:50Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-07-02 11:00:00 |Ende=2026-07-02 12:00:00 |Raum=APB-2026 |Vortragender=Alisa Kovtunova |Forschungsgruppe=Automatentheorie |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-07-02 11:00:00
|Ende=2026-07-02 12:00:00
|Raum=APB-2026
|Vortragender=Alisa Kovtunova
|Forschungsgruppe=Automatentheorie
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Complexity and Expressive Power of Description Logics with Numerical Constraints

2026-05-04T08:15:21Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Titel EN=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Beschreibung DE=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the speaker will also present the talk as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, at the event which will be held in May 2026, in Dagstuhl.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will thus provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the speaker will also present the talk as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, at the event which will be held in May 2026, in Dagstuhl.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-05-07 11:00:00
|Ende=2026-05-07 12:00:00
|Raum=APB-2026
|Vortragender=Filippo De Bortoli
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Complexity and Expressive Power of Description Logics with Numerical Constraints

2026-04-29T08:36:35Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Titel EN=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Beschreibung DE=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the speaker will also present the talk as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, at the ceremony which will be held in May 2026, in Dagstuhl.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will thus provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the speaker will also present the talk as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, at the ceremony which will be held in May 2026, in Dagstuhl.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-05-07 11:00:00
|Ende=2026-05-07 12:00:00
|Raum=APB-2026
|Vortragender=Filippo De Bortoli
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Complexity and Expressive Power of Description Logics with Numerical Constraints

2026-04-29T08:36:11Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Titel EN=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Beschreibung DE=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the talk will be presented as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, which will be held in May 2026, in Dagstuhl.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will thus provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the speaker will also present the talk as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, at the ceremony which will be held in May 2026, in Dagstuhl.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-05-07 11:00:00
|Ende=2026-05-07 12:00:00
|Raum=APB-2026
|Vortragender=Filippo De Bortoli
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Complexity and Expressive Power of Description Logics with Numerical Constraints

2026-04-29T08:35:11Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Complexity and Expressive Power of Description Logics with Numerical Constraints |Titel EN=Complexity and Expressive Power of Description Logics with Numerical Constraints |Beschreibung DE=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they o…“

{{Veranstaltung
|Titel DE=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Titel EN=Complexity and Expressive Power of Description Logics with Numerical Constraints
|Beschreibung DE=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the talk will be presented as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, which will be held in May 2026, in Dagstuhl.
|Beschreibung EN=In this talk the speaker will showcase some of the results developed in his doctoral thesis, defended in August 2025. After a high-level introduction to Description Logics, their usage for knowledge representation and the mechanisms that they offer to encode numerical knowledge, the talk will present the two main research questions tackled in the dissertation: is it possible to design an automated procedure for reasoning with these logics? Can we find structural/mathematical characterizations of these logics that relate the meaning of a formula to its possible syntactic representations? For both questions, the speaker will present some of the results, and briefly argue their relevance and impact on different aspects of knowledge representation. The talk will thus provide a window to a high-level overview of some of the work done at the intersection of knowledge representation and numerical reasoning.

Notably, the speaker will also present the talk as the TU Dresden nominee for the GI e.V. Dissertationspreis 2025, at the ceremony which will be held in May 2026, in Dagstuhl.
|Veranstaltungsart=Vortrag
|Start=2026-05-07 11:00:00
|Ende=2026-05-07 12:00:00
|Raum=APB-2026
|Vortragender=Filippo De Bortoli
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA10

2026-04-20T14:05:52Z

Meghna Bhadra:

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

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

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-04-30 11:00:00
|Ende=2026-04-30 12:00:00
|Raum=APB-2026
|Vortragender=Antonis Kakas
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA10

2026-04-20T14:04:50Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Reliable Problem Solving via LLMs with Symbolic Argumentation
|Titel EN=Reliable Problem Solving via LLMs with Symbolic Argumentation
|Beschreibung DE=In modern AI the aim of a system is to address the problem requirements directly from the natural language description of the problem. Clearly, such a problem specification is expressed under human reasoning and hence a problem solving system would be advantageous if it could also operate under a formalism that is close to human reasoning. The recent development of Large Language Models (LLMs) offers such a possibility as these systems appear to handle natural language in a human-like fashion. But their reliability is under question as is their ability to reason underneath their process of constructing well-formed sentences in order to explain and argue for their solutions to problems. The question the arises: do we develop and train LLMs as reasoners or do we connect these to other formal (symbolic) reasoners who do not suffer from the above shortcomings? In this talk, the speaker will present a neuro-symbolic framework, based on the integration of the Natural Language capabilities of LLMs with Argumentation-based Reasoning. In this approach, instead of the LLM carrying out the reasoning, this is delegated to COGNICA, a Cognitive Argumentation system, which carries out the reasoning within a Controlled Natural Language. Specifically, LLM-COGNICA is a hybrid neural-symbolic framework for reasoning under a decision policy specified within Natural Language and executed via Explainable Argumentation. This offers the reliability of formal problem solving and allows the human developer and problem solver to be in control of the system development process. The talk will present the Argumentation foundations and Argumentation Technology underlying the neuro-symbolic integration of the LLM-COGNICA framework and describe how this can be employed to build reliable real-life application systems.
|Beschreibung EN=In modern AI the aim of a system is to address the problem requirements directly from the natural language description of the problem. Clearly, such a problem specification is expressed under human reasoning and hence a problem solving system would be advantageous if it could also operate under a formalism that is close to human reasoning. The recent development of Large Language Models (LLMs) offers such a possibility as these systems appear to handle natural language in a human-like fashion. But their reliability is under question as is their ability to reason underneath their process of constructing well-formed sentences in order to explain and argue for their solutions to problems. The question the arises: do we develop and train LLMs as reasoners or do we connect these to other formal (symbolic) reasoners who do not suffer from the above shortcomings? In this talk, the speaker will present a neuro-symbolic framework, based on the integration of the Natural Language capabilities of LLMs with Argumentation-based Reasoning. In this approach, instead of the LLM carrying out the reasoning, this is delegated to COGNICA, a Cognitive Argumentation system, which carries out the reasoning within a Controlled Natural Language. Specifically, LLM-COGNICA is a hybrid neural-symbolic framework for reasoning under a decision policy specified within Natural Language and executed via Explainable Argumentation. This offers the reliability of formal problem solving and allows the human developer and problem solver to be in control of the system development process. The talk will present the Argumentation foundations and Argumentation Technology underlying the neuro-symbolic integration of the LLM-COGNICA framework and describe how this can be employed to build reliable real-life application systems.
|Veranstaltungsart=Vortrag
|Start=2026-04-30 11:00:00
|Ende=2026-04-30 12:00:00
|Raum=APB-2026
|Vortragender=Antonis Kakas
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA10

2026-04-02T11:32:01Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-04-30 11:00:00 |Ende=2026-04-30 12:00:00 |Raum=APB-2026 |Vortragender=Antonis Kakas |Forschungsgruppe=Computational Logic |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=TBA
|Titel EN=TBA
|Beschreibung DE=TBA
|Beschreibung EN=TBA
|Veranstaltungsart=Vortrag
|Start=2026-04-30 11:00:00
|Ende=2026-04-30 12:00:00
|Raum=APB-2026
|Vortragender=Antonis Kakas
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination

2026-03-20T12:43:27Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination
|Titel EN=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination
|Beschreibung DE=The chase is a sound and complete but possibly non-terminating procedure for query answering over ontologies that feature existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Termination of the procedure is undecidable in the general case but for some language fragments the problem becomes decidable. A fruitful line of research has established many sufficient conditions for termination and non-termination of the chase. Despite these efforts, our collective understanding seems to be misled by deceptive intuitions at times. In this status talk, the speaker will summarize his involvement in recent contributions to the research area of chase termination, focusing mainly on insights into (un)decidability, improved sufficient conditions for (non-)termination, and an attempt at formally verifying the latter while introducing additional generalizations.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=The chase is a sound and complete but possibly non-terminating procedure for query answering over ontologies that feature existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Termination of the procedure is undecidable in the general case but for some language fragments the problem becomes decidable. A fruitful line of research has established many sufficient conditions for termination and non-termination of the chase. Despite these efforts, our collective understanding seems to be misled by deceptive intuitions at times. In this status talk, the speaker will summarize his involvement in recent contributions to the research area of chase termination, focusing mainly on insights into (un)decidability, improved sufficient conditions for (non-)termination, and an attempt at formally verifying the latter while introducing additional generalizations.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-03-26 11:00:00
|Ende=2026-03-26 13:00:00
|Raum=APB-2026
|Vortragender=Lukas Gerlach
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination2

2026-03-20T12:42:55Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination |Titel EN=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination |Veranstaltungsart=Vortrag |Start=2026-03-20 12:38:05 |Ende=2026-03-20 12:38:05 |In News anzeigen=1 }}“

{{Veranstaltung
|Titel DE=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination
|Titel EN=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination
|Veranstaltungsart=Vortrag
|Start=2026-03-20 12:38:05
|Ende=2026-03-20 12:38:05
|In News anzeigen=1
}}

Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination

2026-03-20T12:42:32Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination |Titel EN=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination |Beschreibung DE=The chase is a sound and complete but possibly non-terminating procedure for query answering over ontologies that feature existential rules (aka. tuple-generating dependencies), a highly expressive know…“

{{Veranstaltung
|Titel DE=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination
|Titel EN=Recurring Problems: Decidability, Sufficient Conditions and Formal Verification for Chase Termination
|Beschreibung DE=The chase is a sound and complete but possibly non-terminating procedure for query answering over ontologies that feature existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Termination of the procedure is undecidable in the general case but for some language fragments the problem becomes decidable. A fruitful line of research has established many sufficient conditions for termination and non-termination of the chase. Despite these efforts, our collective understanding seems to be misled by deceptive intuitions at times. In this status talk, the speaker will summarize his involvement in recent contributions to the research area of chase termination, focusing mainly on insights into (un)decidability, improved sufficient conditions for (non-)termination, and an attempt at formally verifying the latter while introducing additional generalizations.
|Beschreibung EN=The chase is a sound and complete but possibly non-terminating procedure for query answering over ontologies that feature existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Termination of the procedure is undecidable in the general case but for some language fragments the problem becomes decidable. A fruitful line of research has established many sufficient conditions for termination and non-termination of the chase. Despite these efforts, our collective understanding seems to be misled by deceptive intuitions at times. In this status talk, the speaker will summarize his involvement in recent contributions to the research area of chase termination, focusing mainly on insights into (un)decidability, improved sufficient conditions for (non-)termination, and an attempt at formally verifying the latter while introducing additional generalizations.
|Veranstaltungsart=Vortrag
|Start=2026-03-26 11:00:00
|Ende=2026-03-26 13:00:00
|Raum=APB-2026
|Vortragender=Lukas Gerlach
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Declarative Debugging for Datalog with Aggregation

2026-03-13T12:49:13Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Declarative Debugging for Datalog with Aggregation
|Titel EN=Declarative Debugging for Datalog with Aggregation
|Beschreibung DE=This talk will propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally similar parts of proof trees into a single, easier to understand structure. It will show how to query for such summaries, discuss the implementation in the rule engine Nemo, and empirically establish the feasibility of the method. It will also briefly introduce a graphical interface for editing these proof queries and visualising the results.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=This talk will propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally similar parts of proof trees into a single, easier to understand structure. It will show how to query for such summaries, discuss the implementation in the rule engine Nemo, and empirically establish the feasibility of the method. It will also briefly introduce a graphical interface for editing these proof queries and visualising the results.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-03-19 11:00:00
|Ende=2026-03-19 12:00:00
|Raum=APB-2026
|Vortragender=Philipp Hanisch
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Declarative Debugging for Datalog with Aggregation

2026-03-13T12:48:32Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Declarative Debugging for Datalog with Aggregation |Titel EN=Declarative Debugging for Datalog with Aggregation |Beschreibung DE=This talk will propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally similar parts of proof trees into a single, easier to understand structure. It will show how to query for such summaries, discuss the implementation in the rule…“

{{Veranstaltung
|Titel DE=Declarative Debugging for Datalog with Aggregation
|Titel EN=Declarative Debugging for Datalog with Aggregation
|Beschreibung DE=This talk will propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally similar parts of proof trees into a single, easier to understand structure. It will show how to query for such summaries, discuss the implementation in the rule engine Nemo, and empirically establish the feasibility of the method. It will also briefly introduce a graphical interface for editing these proof queries and visualising the results.
|Beschreibung EN=This talk will propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally similar parts of proof trees into a single, easier to understand structure. It will show how to query for such summaries, discuss the implementation in the rule engine Nemo, and empirically establish the feasibility of the method. It will also briefly introduce a graphical interface for editing these proof queries and visualising the results.
|Veranstaltungsart=Vortrag
|Start=2026-03-19 11:00:00
|Ende=2026-03-19 12:00:00
|Raum=APB-2026
|Vortragender=Philipp Hanisch
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP

2026-03-09T16:35:16Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
|Titel EN=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
|Beschreibung DE=Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked in recent research and system development, and special cases are being rediscovered independently. The talk will therefore recall the original approach, using updated terminology and more general filter predicates that capture features of modern systems, and it will show how to extend its applicability to answer set programming (ASP). The outcome is strictly more general but also more complex than the classical approach: double exponential in general and single exponential even for predicates of bounded arity. As a solution, tractable approximations of the algorithm will be proposed that can still yield much improved logic programs in typical cases, e.g., it can improve the performance of rule systems over real-world data in the order of magnitude.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked in recent research and system development, and special cases are being rediscovered independently. The talk will therefore recall the original approach, using updated terminology and more general filter predicates that capture features of modern systems, and it will show how to extend its applicability to answer set programming (ASP). The outcome is strictly more general but also more complex than the classical approach: double exponential in general and single exponential even for predicates of bounded arity. As a solution, tractable approximations of the algorithm will be proposed that can still yield much improved logic programs in typical cases, e.g., it can improve the performance of rule systems over real-world data in the order of magnitude.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-03-12 11:00:00
|Ende=2026-03-12 12:00:00
|Raum=APB-2026
|Vortragender=Philipp Hanisch
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP

2026-03-04T21:09:14Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
|Titel EN=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
|Beschreibung DE=Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked in recent research and system development, and special cases are being rediscovered independently. The talk will therefore recall the original approach, using updated terminology and more general filter predicates that capture features of modern systems, and it will show how to extend its applicability to answer set programming (ASP). The outcome is strictly more general but also more complex than the classical approach: double exponential in general and single exponential even for predicates of bounded arity. As a solution, tractable approximations of the algorithm will be proposed that can still yield much improved logic programs in typical cases, e.g., it can improve the performance of rule systems over real-world data in the order of magnitude.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked in recent research and system development, and special cases are being rediscovered independently. The talk will therefore recall the original approach, using updated terminology and more general filter predicates that capture features of modern systems, and it will show how to extend its applicability to answer set programming (ASP). The outcome is strictly more general but also more complex than the classical approach: double exponential in general and single exponential even for predicates of bounded arity. As a solution, tractable approximations of the algorithm will be proposed that can still yield much improved logic programs in typical cases, e.g., it can improve the performance of rule systems over real-world data in the order of magnitude.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-03-11 11:00:00
|Ende=2026-03-11 12:00:00
|Raum=APB-2026
|Vortragender=Philipp Hanisch
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA9

2026-03-04T21:08:55Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Concepts of Conditional Independence in Computational Argumentation
|Titel EN=Concepts of Conditional Independence in Computational Argumentation
|Beschreibung DE=The ability to recognize and manage (in)dependence is crucial in symbolic reasoning , it plays a major part in causal reasoning [Pearl, 2009], e.g., in probabilistic models, where (in)dependence between variables of interest is built into graphical representations such as Bayesian networks. The ability to determine independence contributes to the explainability and trustworthiness of reasoning systems, while also improving efficiency by empowering breaking problems down so that they can be managed more effectively. The speaker will present some recent work on notions of conditional independence in computational argumentation. Two prominent areas of computational models of argument are abstract argumentation [Dung 1995], and structured argumentation. Unlike abstract argumentation, where arguments are considered abstract, structured argumentation frameworks focus on the inner structure of the arguments, enabling a finer-grained analysis of the arguments and relations. Assumption-based argumentation (ABA) [Bondarenko et al., 1997] is a well-known form of structured argumentation, whose building blocks are assumptions (defeasible elements) and inference rules. In both frameworks argumentation semantics provide methods for evaluating acceptance, and it is wrt. argumentation semantics that [Rienstra et al., 2020] propose a notion of conditional independence for Abstract Argumentation, which recently was extended to independence between assumptions in Flat ABA-Frameworks [Blümel et al., 2025]. However, in both frameworks other concepts of conditional independence are conceivable, especially in ABA, where assumptions are not the only structural objects under investigation. Furthermore, the current notion has proven computationally challenging. In the second part of the talk the speaker will discuss some ideas regarding further investigations along these lines.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=The ability to recognize and manage (in)dependence is crucial in symbolic reasoning , it plays a major part in causal reasoning [Pearl, 2009], e.g., in probabilistic models, where (in)dependence between variables of interest is built into graphical representations such as Bayesian networks. The ability to determine independence contributes to the explainability and trustworthiness of reasoning systems, while also improving efficiency by empowering breaking problems down so that they can be managed more effectively. The speaker will present some recent work on notions of conditional independence in computational argumentation. Two prominent areas of computational models of argument are abstract argumentation [Dung 1995], and structured argumentation. Unlike abstract argumentation, where arguments are considered abstract, structured argumentation frameworks focus on the inner structure of the arguments, enabling a finer-grained analysis of the arguments and relations. Assumption-based argumentation (ABA) [Bondarenko et al., 1997] is a well-known form of structured argumentation, whose building blocks are assumptions (defeasible elements) and inference rules. In both frameworks argumentation semantics provide methods for evaluating acceptance, and it is wrt. argumentation semantics that [Rienstra et al., 2020] propose a notion of conditional independence for Abstract Argumentation, which recently was extended to independence between assumptions in Flat ABA-Frameworks [Blümel et al., 2025]. However, in both frameworks other concepts of conditional independence are conceivable, especially in ABA, where assumptions are not the only structural objects under investigation. Furthermore, the current notion has proven computationally challenging. In the second part of the talk the speaker will discuss some ideas regarding further investigations along these lines.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-02-19 11:00:00
|Ende=2026-02-19 12:00:00
|Raum=APB-2026
|Vortragender=Lydia Blümel
|Forschungsgruppe=Logische Programmierung und Argumentation
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

News from Knowledge-aware AI

2026-03-04T21:08:21Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=News from Knowledge-aware AI
|Titel EN=News from Knowledge-aware AI
|Beschreibung DE=In this talk, the speaker will summarize developments from last year, in particular, GPTKB version v1.5 (won the ISWC best demo award), and the EACL 2026 paper "Foundations of LLM Knowledge Materialization: Termination, Reproducibility, Robustness". The talk will also give an outlook on recent research towards statistical estimation of the scale of LLM knowledge, knowledge materialization with disambiguated entities, classes, and relations, and unstructured materialization in the style of Grokipedia.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=In this talk, the speaker will summarize developments from last year, in particular, GPTKB version v1.5 (won the ISWC best demo award), and the EACL 2026 paper "Foundations of LLM Knowledge Materialization: Termination, Reproducibility, Robustness". The talk will also give an outlook on recent research towards statistical estimation of the scale of LLM knowledge, knowledge materialization with disambiguated entities, classes, and relations, and unstructured materialization in the style of Grokipedia.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-02-05 11:00:00
|Ende=2026-02-05 12:00:00
|Raum=APB-2026
|Vortragender=Simon Razniewski
|Forschungsgruppe=Knowledge-aware Artificial Intelligence
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP

2026-03-04T21:07:21Z

Meghna Bhadra: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP |Titel EN=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP |Beschreibung DE=Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked…“

{{Veranstaltung
|Titel DE=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
|Titel EN=Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
|Beschreibung DE=Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked in recent research and system development, and special cases are being rediscovered independently. The talk will therefore recall the original approach, using updated terminology and more general filter predicates that capture features of modern systems, and it will show how to extend its applicability to answer set programming (ASP). The outcome is strictly more general but also more complex than the classical approach: double exponential in general and single exponential even for predicates of bounded arity. As a solution, tractable approximations of the algorithm will be proposed that can still yield much improved logic programs in typical cases, e.g., it can improve the performance of rule systems over real-world data in the order of magnitude.
|Beschreibung EN=Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked in recent research and system development, and special cases are being rediscovered independently. The talk will therefore recall the original approach, using updated terminology and more general filter predicates that capture features of modern systems, and it will show how to extend its applicability to answer set programming (ASP). The outcome is strictly more general but also more complex than the classical approach: double exponential in general and single exponential even for predicates of bounded arity. As a solution, tractable approximations of the algorithm will be proposed that can still yield much improved logic programs in typical cases, e.g., it can improve the performance of rule systems over real-world data in the order of magnitude.
|Veranstaltungsart=Vortrag
|Start=2026-03-11 11:00:00
|Ende=2026-03-11 12:00:00
|Raum=APB-2026
|Vortragender=Philipp Hanisch
|Forschungsgruppe=Wissensbasierte Systeme
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA9

2026-02-16T12:25:34Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Concepts of Conditional Independence in Computational Argumentation
|Titel EN=Concepts of Conditional Independence in Computational Argumentation
|Beschreibung DE=The ability to recognize and manage (in)dependence is crucial in symbolic reasoning , it plays a major part in causal reasoning [Pearl, 2009], e.g., in probabilistic models, where (in)dependence between variables of interest is built into graphical representations such as Bayesian networks. The ability to determine independence contributes to the explainability and trustworthiness of reasoning systems, while also improving efficiency by empowering breaking problems down so that they can be managed more effectively. The speaker will present some recent work on notions of conditional independence in computational argumentation. Two prominent areas of computational models of argument are abstract argumentation [Dung 1995], and structured argumentation. Unlike abstract argumentation, where arguments are considered abstract, structured argumentation frameworks focus on the inner structure of the arguments, enabling a finer-grained analysis of the arguments and relations. Assumption-based argumentation (ABA) [Bondarenko et al., 1997] is a well-known form of structured argumentation, whose building blocks are assumptions (defeasible elements) and inference rules. In both frameworks argumentation semantics provide methods for evaluating acceptance, and it is wrt. argumentation semantics that [Rienstra et al., 2020] propose a notion of conditional independence for Abstract Argumentation, which recently was extended to independence between assumptions in Flat ABA-Frameworks [Blümel et al., 2025]. However, in both frameworks other concepts of conditional independence are conceivable, especially in ABA, where assumptions are not the only structural objects under investigation. Furthermore, the current notion has proven computationally challenging. In the second part of the talk the speaker will discuss some ideas regarding further investigations along these lines.
|Beschreibung EN=The ability to recognize and manage (in)dependence is crucial in symbolic reasoning , it plays a major part in causal reasoning [Pearl, 2009], e.g., in probabilistic models, where (in)dependence between variables of interest is built into graphical representations such as Bayesian networks. The ability to determine independence contributes to the explainability and trustworthiness of reasoning systems, while also improving efficiency by empowering breaking problems down so that they can be managed more effectively. The speaker will present some recent work on notions of conditional independence in computational argumentation. Two prominent areas of computational models of argument are abstract argumentation [Dung 1995], and structured argumentation. Unlike abstract argumentation, where arguments are considered abstract, structured argumentation frameworks focus on the inner structure of the arguments, enabling a finer-grained analysis of the arguments and relations. Assumption-based argumentation (ABA) [Bondarenko et al., 1997] is a well-known form of structured argumentation, whose building blocks are assumptions (defeasible elements) and inference rules. In both frameworks argumentation semantics provide methods for evaluating acceptance, and it is wrt. argumentation semantics that [Rienstra et al., 2020] propose a notion of conditional independence for Abstract Argumentation, which recently was extended to independence between assumptions in Flat ABA-Frameworks [Blümel et al., 2025]. However, in both frameworks other concepts of conditional independence are conceivable, especially in ABA, where assumptions are not the only structural objects under investigation. Furthermore, the current notion has proven computationally challenging. In the second part of the talk the speaker will discuss some ideas regarding further investigations along these lines.
|Veranstaltungsart=Vortrag
|Start=2026-02-19 11:00:00
|Ende=2026-02-19 12:00:00
|Raum=APB-2026
|Vortragender=Lydia Blümel
|Forschungsgruppe=Logische Programmierung und Argumentation
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA9

2026-02-16T12:18:37Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Concepts of Conditional Independence in Computational Argumentation
|Titel EN=Concepts of Conditional Independence in Computational Argumentation
|Beschreibung DE=The ability to recognize and manage (in)dependence is crucial in symbolic reasoning , it plays a major part in causal reasoning [Pearl, 2009], e. g., in probabilistic models, where (in)dependence between variables of interest is built into graphical representations such as Bayesian networks . The ability to determine independence contributes to the explainability and trustworthiness of reasoning systems, while also improving efficiency by empowering breaking problems down so that they can be managed more effectively.

The speaker will present some recent work on notions of conditional independence in computational argumentation. Two prominent areas of computational models of argument are abstract argumentation [Dung 1995], and structured argumentation. Unlike abstract argumentation, where arguments are considered abstract, structured argumentation frameworks focus on the inner structure of the arguments, enabling a finer-grained analysis of the arguments and relations. Assumption-based argumentation (ABA) [Bondarenko et al., 1997] is a well-known form of structured argumentation, whose building blocks are assumptions (defeasible elements) and inference rules. In both frameworks argumentation semantics provide methods for evaluating acceptance and it is wrt. argumentation semantics, that [Rienstra et al., 2020] propose a notion of conditional independence for Abstract Argumentation, which recently was extended to independence between assumptions in Flat ABA-Frameworks [Blümel et al., 2025]. However, in both frameworks other concepts of conditional independence are conceivable, especially in ABA, where assumptions are not the only structural objects under investigation. Furthermore, the current notion has proven computationally challenging. In the second part of the talk the speaker will discuss some ideas regarding further investigations along these lines.
|Beschreibung EN=The ability to recognize and manage (in)dependence is crucial in symbolic reasoning , it plays a major part in causal reasoning [Pearl, 2009], e. g., in probabilistic models, where (in)dependence between variables of interest is built into graphical representations such as Bayesian networks . The ability to determine independence contributes to the explainability and trustworthiness of reasoning systems, while also improving efficiency by empowering breaking problems down so that they can be managed more effectively.

The speaker will present some recent work on notions of conditional independence in computational argumentation. Two prominent areas of computational models of argument are abstract argumentation [Dung 1995], and structured argumentation. Unlike abstract argumentation, where arguments are considered abstract, structured argumentation frameworks focus on the inner structure of the arguments, enabling a finer-grained analysis of the arguments and relations. Assumption-based argumentation (ABA) [Bondarenko et al., 1997] is a well-known form of structured argumentation, whose building blocks are assumptions (defeasible elements) and inference rules. In both frameworks argumentation semantics provide methods for evaluating acceptance and it is wrt. argumentation semantics, that [Rienstra et al., 2020] propose a notion of conditional independence for Abstract Argumentation, which recently was extended to independence between assumptions in Flat ABA-Frameworks [Blümel et al., 2025]. However, in both frameworks other concepts of conditional independence are conceivable, especially in ABA, where assumptions are not the only structural objects under investigation. Furthermore, the current notion has proven computationally challenging. In the second part of the talk the speaker will discuss some ideas regarding further investigations along these lines.
|Veranstaltungsart=Vortrag
|Start=2026-02-19 11:00:00
|Ende=2026-02-19 12:00:00
|Raum=APB-2026
|Vortragender=Lydia Blümel
|Forschungsgruppe=Logische Programmierung und Argumentation
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Research Seminar Logic and AI

2026-02-11T10:57:36Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we invite speakers to present their research on (inter-disciplinary) topics related to logic 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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

===Schedule and Location===

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-2026.
For further information on an upcoming seminar pease check the program overview for the same.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar on Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-02-11T10:56:15Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we invite speakers to present their research on (inter-disciplinary) topics related to logic 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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

===Schedule and Location===

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-2026.
For further information on an upcoming seminar pease check the program overview for the same.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar on Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=Type
| ?Vortragender=Speaker
| ?Beschreibung EN=Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-02-11T10:52:46Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we invite speakers to present their research on (inter-disciplinary) topics related to logic 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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

===Schedule and Location===

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-2026.
For further information on an upcoming seminar pease check the program overview for the same.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar on Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| start=Start
| end=Ende
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-02-11T10:48:50Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we invite speakers to present their research on (inter-disciplinary) topics related to logic 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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

===Schedule and Location===

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-2026.
For further information on an upcoming seminar pease check the program overview for the same.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===
<table class="calendar" >

{{#ask:[[Event series::Research Seminar on Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-02-11T10:47:08Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we invite speakers to present their research on (inter-disciplinary) topics related to logic 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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

===Schedule and Location===

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-2026.
For further information on an upcoming seminar pease check the program overview for the same.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===
<table class="calendar" >
{{#ask:[[Event series::Research Seminar on Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-02-11T10:46:51Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we invite speakers to present their research on (inter-disciplinary) topics related to logic 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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

===Schedule and Location===

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-2026.
For further information on an upcoming seminar pease check the program overview for the same.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===
 <table class="calendar" >
{{#ask:[[Event series::Research Seminar on Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Research Seminar Logic and AI

2026-02-11T10:44:37Z

Meghna Bhadra:

{{#leftsidenav:{{LeftsidenavHeading|Contents}}
<div class="no-toc-head">__TOC__</div>
|{{Main heading|Research Seminar on Logic and AI}}

In this research seminar, we invite speakers to present their research on (inter-disciplinary) topics related to logic 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!

The seminar is organized by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Meghna Bhadra/en|Meghna Bhadra]], if you would like to give a talk or invite a guest speaker.

===Schedule and Location===

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-2026.
For further information on an upcoming seminar pease check the program overview for the same.

====Recent and Upcoming Talks====

<table class="table" >
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr>
{{#ask: [[Event series::Research Seminar Logic and AI]]
| ?Titel EN=
| ?Datum#ISO=
| ?Vortragender=
| sort=Datum
| order=desc
| format=plainlist
| template=Talk short inline/en
| searchlabel=
| link=none
| limit=5
}}
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|
| ?Datum=Date
| ?=Title
| ?Vortragender=Speaker
| mainlabel=-
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks …}}</td><td>{{Upcoming events feed
| L=/en
| query=[[Event series::Research Seminar Logic and AI]]
| label=Subscribe to upcoming talks (iCal)
| calendartitle=ICCL Research Seminar Logic and AI
}}</td></tr>
</table>

===Calendar===

{{#ask:[[Event series::Research Seminar on Logic and AI]][[Start::+]]
| ?Start
| ?Ende
| ?Titel EN=title
| ?Raum=Room
| ?Veranstaltungsart=<br/>Type
| ?Vortragender=<br/>Speaker
| ?Beschreibung EN=<br/>Details
| format=eventcalendar
| firstday=Monday
| defaultview=month
| limit=1000
| link=subject
}}

}}

{{#set:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2020
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Thomas Feller
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2021
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Wissensbasierte Systeme
|Lecturer=Markus Krötzsch
|Lecturer=Ali Elhalawati
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2022
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=SS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}
{{#subobject:
|Title=Research Seminar Logic and AI
|Forschungsgruppe=Computational Logic
|Lecturer=Sebastian Rudolph
|Lecturer=Piotr Ostropolski-Nalewaja
|Modul=INF-AQUA
|Modul=INF-PM-FOR
|Term=WS
|Year=2023
|SWSLecture=0
|SWSExercise=2
|SWSPractical=0
|@category=Vorlesung
}}

[[Kategorie:Event series]] [[Kategorie:Vorlesung]]

Interactive Exploration of Plan Spaces

2026-01-19T09:49:36Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Interactive Exploration of Plan Spaces
|Titel EN=Interactive Exploration of Plan Spaces
|Beschreibung DE=Many planning applications require not only a single solution but benefit substantially from having a set of possible plans from which users can select, for example, when explaining plans. For decades, research in classical AI planning has primarily focused on quickly finding single plans. Only recently researchers have started to investigate preferences, enumerate plans by top-k planning, or count plans to reason about the plan space. Unfortunately, reasoning about the plan space is computationally extremely hard and feeding many similar plans to the user is hardly practical. To circumvent computational shortcomings while still being able to reason about variability in plans, faceted actions have been introduced very recently. These are meaningful actions that can be used by some plan but are not required by all plans. Enforcing or forbidding such facets allows for navigating even large plan spaces while ensuring desired properties quickly and step by step. This talk will illustrate an industrial challenge, the Beluga logistics problem of Airbus, where reasoning with facets enables targeted plan space navigation. It will present an approach to handle large plan spaces iteratively and present a tool that the authors call planpilot.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=Many planning applications require not only a single solution but benefit substantially from having a set of possible plans from which users can select, for example, when explaining plans. For decades, research in classical AI planning has primarily focused on quickly finding single plans. Only recently researchers have started to investigate preferences, enumerate plans by top-k planning, or count plans to reason about the plan space. Unfortunately, reasoning about the plan space is computationally extremely hard and feeding many similar plans to the user is hardly practical. To circumvent computational shortcomings while still being able to reason about variability in plans, faceted actions have been introduced very recently. These are meaningful actions that can be used by some plan but are not required by all plans. Enforcing or forbidding such facets allows for navigating even large plan spaces while ensuring desired properties quickly and step by step. This talk will illustrate an industrial challenge, the Beluga logistics problem of Airbus, where reasoning with facets enables targeted plan space navigation. It will present an approach to handle large plan spaces iteratively and present a tool that the authors call planpilot.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-01-22 11:00:00
|Ende=2026-01-22 12:00:00
|Raum=APB-2026
|Vortragender=Sarah Gaggl
|Forschungsgruppe=Logische Programmierung und Argumentation
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA8

2026-01-19T09:49:02Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Multiperspective Reasoning in KR Formalisms via Standpoint Logic
|Titel EN=Multiperspective Reasoning in KR Formalisms via Standpoint Logic
|Beschreibung DE=The importance of taking individual, potentially conflicting perspectives into account when dealing with knowledge has been widely recognised. Many existing knowledge management approaches fully merge knowledge perspectives, which may require weakening in order to maintain consistency; others represent the distinct views in an entirely detached way. This talk will present an alternative, referred to as Standpoint Logic, a simple, yet versatile multi-modal logic “add-on” for existing logical languages – including Description Logics – intended for the integrated representation of domain knowledge relative to diverse standpoints, which can be hierarchically organised, combined, and put in relation with each other. It will introduce the general logical framework of Standpoint Logic and discuss variations which differ in expressivity and computational complexity of automated reasoning.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Beschreibung EN=The importance of taking individual, potentially conflicting perspectives into account when dealing with knowledge has been widely recognised. Many existing knowledge management approaches fully merge knowledge perspectives, which may require weakening in order to maintain consistency; others represent the distinct views in an entirely detached way. This talk will present an alternative, referred to as Standpoint Logic, a simple, yet versatile multi-modal logic “add-on” for existing logical languages – including Description Logics – intended for the integrated representation of domain knowledge relative to diverse standpoints, which can be hierarchically organised, combined, and put in relation with each other. It will introduce the general logical framework of Standpoint Logic and discuss variations which differ in expressivity and computational complexity of automated reasoning.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join
|Veranstaltungsart=Vortrag
|Start=2026-01-15 11:00:00
|Ende=2026-01-15 12:00:00
|Raum=APB-2026
|Vortragender=Sebastian Rudolph
|Forschungsgruppe=Computational Logic
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

TBA8

2026-01-19T09:48:35Z

Meghna Bhadra:

Interactive Exploration of Plan Spaces

2026-01-19T09:42:49Z

Meghna Bhadra:

{{Veranstaltung
|Titel DE=Interactive Exploration of Plan Spaces
|Titel EN=Interactive Exploration of Plan Spaces
|Beschreibung DE=Many planning applications require not only a single solution but benefit substantially from having a set of possible plans from which users can select, for example, when explaining plans. For decades, research in classical AI planning has primarily focused on quickly finding single plans. Only recently researchers have started to investigate preferences, enumerate plans by top-k planning, or count plans to reason about the plan space. Unfortunately, reasoning about the plan space is computationally extremely hard and feeding many similar plans to the user is hardly practical. To circumvent computational shortcomings while still being able to reason about variability in plans, faceted actions have been introduced very recently. These are meaningful actions that can be used by some plan but are not required by all plans. Enforcing or forbidding such facets allows for navigating even large plan spaces while ensuring desired properties quickly and step by step. This talk will illustrate an industrial challenge, the Beluga logistics problem of Airbus, where reasoning with facets enables targeted plan space navigation. It will present an approach to handle large plan spaces iteratively and present a tool that the authors call planpilot.
|Beschreibung EN=Many planning applications require not only a single solution but benefit substantially from having a set of possible plans from which users can select, for example, when explaining plans. For decades, research in classical AI planning has primarily focused on quickly finding single plans. Only recently researchers have started to investigate preferences, enumerate plans by top-k planning, or count plans to reason about the plan space. Unfortunately, reasoning about the plan space is computationally extremely hard and feeding many similar plans to the user is hardly practical. To circumvent computational shortcomings while still being able to reason about variability in plans, faceted actions have been introduced very recently. These are meaningful actions that can be used by some plan but are not required by all plans. Enforcing or forbidding such facets allows for navigating even large plan spaces while ensuring desired properties quickly and step by step. This talk will illustrate an industrial challenge, the Beluga logistics problem of Airbus, where reasoning with facets enables targeted plan space navigation. It will present an approach to handle large plan spaces iteratively and present a tool that the authors call planpilot.
|Veranstaltungsart=Vortrag
|Start=2026-01-22 11:00:00
|Ende=2026-01-22 12:00:00
|Raum=APB-2026
|Vortragender=Sarah Gaggl
|Forschungsgruppe=Logische Programmierung und Argumentation
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}