Chasing Streams with Existential Rules

05/04/2022
by   Jacopo Urbani, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2019

Datalog Materialisation in Distributed RDF Stores with Dynamic Data Exchange

Several centralised RDF systems support datalog reasoning by precomputin...
research
02/28/2022

The Complexity of Evaluating nfer

Nfer is a rule-based language for abstracting event streams into a hiera...
research
07/25/2014

Extending Acyclicity Notions for Existential Rules (long version)

Existential rules have been proposed for representing ontological knowle...
research
02/18/2016

A General Modifier-based Framework for Inconsistency-Tolerant Query Answering

We propose a general framework for inconsistency-tolerant query answerin...
research
12/12/2015

Query Answering over Contextualized RDF/OWL Knowledge with Forall-Existential Bridge Rules: Decidable Finite Extension Classes (Post Print)

The proliferation of contextualized knowledge in the Semantic Web (SW) h...
research
08/15/2022

Seminaive Materialisation in DatalogMTL

DatalogMTL is an extension of Datalog with metric temporal operators tha...

Please sign up or login with your details

Forgot password? Click here to reset