A Single Approach to Decide Chase Termination on Linear Existential Rules
From MaRDI portal
Publication:5091131
DOI10.4230/LIPIcs.ICDT.2019.18OpenAlexW2895185532MaRDI QIDQ5091131
Michel Leclère, Federico Ulliana, Marie-Laure Mugnier, Michaël Thomazo
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.02132
Related Items (3)
Uniform Restricted Chase Termination ⋮ Semi-oblivious chase termination: the sticky case ⋮ Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation
Cites Work
- Data exchange: semantics and query answering
- On rules with existential variables: walking the decidability line
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
- Graph minors. II. Algorithmic aspects of tree-width
- A normal form for relational databases that is based on domains and keys
- Anatomy of the Chase
- Query Rewriting and Optimization for Ontological Databases
- All–Instances Termination of Chase is Undecidable
- Answering queries using views: A survey
This page was built for publication: A Single Approach to Decide Chase Termination on Linear Existential Rules
