Chasing Streams with Existential Rules

2022/05/04 by Jacopo Urbani, Markus Krötzsch, Urbani, Jacopo +3 · 1 citation
Computer Science · #Advanced Database Systems and Queries #Artificial Intelligence (cs.AI) #Data Management and Algorithms #Databases (cs.DB) #FOS: Computer and information sciences #Semantic Web and Ontologies

paper · doi:10.48550/arxiv.2205.02220

openalex publication_date 2022/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

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.

Cited by

• On Syntactical Simplification of Temporal Operators in Negation-free MTL

Related

• Extending Acyclicity Notions for Existential Rules (long version)
• Goal-Driven Query Answering for Existential Rules with Equality
• Combining Existential Rules and Transitivity: Next Steps
• Query Answering with Inconsistent Existential Rules under Stable Model Semantics
• Loop Restricted Existential Rules and First-order Rewritability for Query Answering