We study reasoning with existential rules to perform query answering over streams of data. On static databases, this problem has been widely studied, but its extension to rapidly changing data has not yet been considered. To bridge this gap, we extend LARS, a well-known framework for rule-based stream reasoning, to support existential rules. For that, we show how to translate LARS with existentials into a semantics-preserving set of existential rules. As query answering with such rules is undecidable in general, we describe how to leverage the temporal nature of streams and present suitable notions of acyclicity that ensure decidability.
翻译:在静态数据库中,这个问题已经得到了广泛的研究,但还没有被考虑扩大至迅速变化的数据。为了弥合这一差距,我们扩展了基于规则流推理的众所周知的框架LARS,以支持存在规则。为此,我们展示了如何将存在着的LARS转化为一套保留存在规则的语义规则。在一般情况下,对此类规则的回答是无法确定的,我们描述了如何利用流的时空性质和提出确保可衰落的适当的周期性概念。