Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation
From MaRDI portal
Publication:4957206
DOI10.1017/S1471068420000101zbMath1472.68190arXiv2005.05423OpenAlexW3040097605MaRDI QIDQ4957206
Jia-Huai You, Heng Zhang, Arash Karimi
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.05423
Uses Software
Cites Work
- Data exchange: semantics and query answering
- On rules with existential variables: walking the decidability line
- The core of a graph
- Semi-oblivious chase termination: the sticky case
- Relationships between nondeterministic and deterministic tape complexities
- Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
- Undecidable boundedness problems for datalog programs
- $\mathcal{EL}$ -ifying Ontologies
- A Proof Procedure for Data Dependencies
- Nondeterministic Space is Closed under Complementation
- Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs
- Anatomy of the Chase
- Guarded-Based Disjunctive Tuple-Generating Dependencies
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- On the k-Boundedness for Existential Rules
- Restricted Chase Termination: A Hierarchical Approach and Experimentation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation