Temporal reasoning with DatalogMTL: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Piotr Ostropolski-Nalewaja (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Piotr Ostropolski-Nalewaja (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| 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 | The talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link: | ||
temporal reasoning tasks over the rational timeline, which makes it | https://bbb.tu-dresden.de/b/pio-zwt-smp-aus | ||
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. | |||
|Veranstaltungsart=Vortrag | |Veranstaltungsart=Vortrag | ||
|Start=2023/09/19 11:00:00 | |Start=2023/09/19 11:00:00 | ||
Version vom 18. September 2023, 15:08 Uhr
Temporal reasoning with DatalogMTL
Vortrag von Przemysław Wałęga
- Veranstaltungsort: APB room 2026
- Beginn: 19. September 2023 um 11:00
- Ende: 19. September 2023 um 12:00
- Event series: Research Seminar Logic and AI
- iCal
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
