Temporal reasoning with DatalogMTL: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Keine Bearbeitungszusammenfassung
Keine Bearbeitungszusammenfassung
 
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 1: Zeile 1:
{{Veranstaltung
{{Veranstaltung
|Titel EN=Temporal reasoning with DatalogMTL
|Titel EN=Temporal reasoning with DatalogMTL
|Beschreibung EN=During the talk, I will present DatalogMTL – an extension of
|Beschreibung EN=Abstract: During the talk, I will present DatalogMTL – an extension of Datalog with operators from metric temporal logic (MTL) – and our research on this formalism. DatalogMTL allows for performing complex temporal reasoning tasks over the rational timeline, which makes it suitable for many practical applications. However, performing the main reasoning tasks in this setting is computationally expensive, e.g., fact entailment is EXPSPACE-complete in combined and PSPACE-complete in data complexity. High complexity, together with the need of performing reasoning over infinite temporal structures, makes developing practical algorithms for DatalogMTL challenging. I will describe our approaches to address these difficulties, and discuss their experimental evaluation.
Datalog with operators from metric temporal logic (MTL) – and our
 
research on this formalism. DatalogMTL allows for performing complex
 
temporal reasoning tasks over the rational timeline, which makes it
The talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link:
suitable for many practical applications. However, performing the main
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
reasoning tasks in this setting is computationally expensive, e.g., fact
entailment is EXPSPACE-complete in combined and PSPACE-complete in data
complexity. High complexity, together with the need of performing
reasoning over infinite temporal structures, makes developing practical
algorithms for DatalogMTL challenging. I will describe our approaches to
address these difficulties, and discuss their experimental evaluation.
|Veranstaltungsart=Vortrag
|Veranstaltungsart=Vortrag
|Start=2023/09/19 11:00:00
|Start=2023/09/19 11:00:00

Aktuelle Version vom 18. September 2023, 15:09 Uhr

Temporal reasoning with DatalogMTL

Vortrag von Przemysław Wałęga
Abstract: During the talk, I will present DatalogMTL – an extension of Datalog with operators from metric temporal logic (MTL) – and our research on this formalism. DatalogMTL allows for performing complex temporal reasoning tasks over the rational timeline, which makes it suitable for many practical applications. However, performing the main reasoning tasks in this setting is computationally expensive, e.g., fact entailment is EXPSPACE-complete in combined and PSPACE-complete in data complexity. High complexity, together with the need of performing reasoning over infinite temporal structures, makes developing practical algorithms for DatalogMTL challenging. I will describe our approaches to address these difficulties, and discuss their experimental evaluation.


The talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link:

https://bbb.tu-dresden.de/b/pio-zwt-smp-aus