# Query Evaluation in DatalogMTL -- Taming Infinite Query Results

arXiv: https://arxiv.org/abs/2109.10691 · HTML: https://mlsanity.com/paper/2109.10691/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 24 references that are in the map.
- First posted on arXiv 21 Sep 2021.

## Builds on (most cited first, 2 of 2)

- [Querying Log Data with Metric Temporal Logic (Technical Report)](https://mlsanity.com/paper/1703.08982/) (2017)
- [Data Complexity and Rewritability of Ontology-Mediated Queries in Metric Temporal Logic under the Event-Based Semantics (Full Version)](https://mlsanity.com/paper/1905.12990/) (2019)

## Abstract (arXiv)

In this paper, we investigate finite representations of DatalogMTL models. First, we discuss sufficient conditions for detecting programs that have finite models. Then, we study infinite models that eventually become constant and introduce sufficient criteria for programs that allow for such representation. We proceed by considering infinite models that are eventually periodic and show that such representation encompasses all DatalogMTL^FP programs, a widely discussed fragment. Finally, we provide a novel algorithm for reasoning over such finite representable programs.