Abstract
In this paper we analyze the theoretical aspects of our semantic rule language, SDRL. Inspired with an industrial collaboration, SDRL is designed to process signals from sensors installed in industrial equipment by filtering, aggregating, and combining sequences of time-stamped measurements recorded by the sensors. In our previous work, we conducted extensive experiments showing scalability of the language on real data. Here instead, we analyze theoretical properties of SDRL. In particular, we show that query answering in SDRL can be reduced to relational algebra with aggregations. To this end, we rely on recently introduced Datalognr MTL that is first order rewritable. First we introduce an extension of Datalognr MTL with aggregate functions. Then we show how to translate query answering in SDRL into the query answering in the extended language.