Temporal reasoning with DatalogMTL

From International Center for Computational Logic

Temporal reasoning with DatalogMTL

Talk by 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