Temporal ASP: From Logical Foundations to Practical Use with telingo

Cabalar, Pedro

doi:10.1007/978-3-030-95481-9_5

Cited by 1 publication

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Particularly relevant is a recently introduced extension of ASP with MTL operators (Cabalar et al, 2020). Previously, ASP was also extended with LTL operators, giving rise to temporal equilibrium logic TEL (Cabalar & Pérez Vega, 2007;Diéguez, 2012;Cabalar, 2022), which has been imple-mented in the Telingo system (Cabalar et al, 2019). Additionally, LARS (Beck et al, 2018) combines ASP and MTL operators for reasoning over data streams.…”

Section: Languages For Temporal Reasoningmentioning

confidence: 99%

Finite Materialisability of Datalog Programs with Metric Temporal Operators

Wałęga

Zawidzki²,

Grau³

2023

jair

View full text Add to dashboard Cite

DatalogMTL is an extension of Datalog with metric temporal operators that has recently found applications in stream reasoning and temporal ontology-based data access. In contrast to plain Datalog, where materialisation (a.k.a. forward chaining) naturally terminates in finitely many steps, reaching a fixpoint in DatalogMTL may require infinitely many rounds of rule applications. As a result, existing reasoning systems resort to other approaches, such as constructing large Büchi automata, whose implementations turn out to be highly inefficient in practice. In this paper, we propose and study finitely materialisable DatalogMTL programs, for which forward chaining reasoning is guaranteed to terminate. We consider a data-dependent notion of finite materialisability of a program, where termination is guaranteed for a given dataset, as well as a data-independent notion, where termination is guaranteed regardless of the dataset. We show that, for bounded programs (a natural DatalogMTL fragment for which reasoning is as hard as in the full language), checking data-dependent finite materialisability is ExpSpace-complete in combined complexity and PSpace-complete in data complexity; furthermore, we propose a practical materialisation-based decision procedure that works in doubly exponential time. We show that checking data-independent finite materialisability for bounded progams is computationally easier, namely ExpTime-complete; moreover, we propose sufficient conditions for data-indenpendent finite materialisability that can be efficiently checked. We provide also the complexity landscape of fact entailment for different classes of finitely materialisable programs; surprisingly, we could identify a large class of finitely materialisable programs, called MTL-acyclic programs, for which fact entailment has exactly the same data and combined complexity as in plain Datalog, which makes this fragment especially well suited for big-scale applications.

show abstract