Chase Termination for Guarded Existential Rules
Summary: First positive decidability results for oblivious and semi-oblivious chase termination for guarded-based existential rules. Provides rich-/weak-acyclicity criteria for linear TGDs (PSPACE-complete, NL if bounded arity) and decidability for guarded/weakly-guarded TGDs (2EXPTIME-complete, EXPTIME if bounded arity); resulting query languages match standard expressiveness but appear more succinct. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marco Calautti (University of Calabria)
- 2. Georg Gottlob (University of Oxford)
- 3. Andreas Pieris (Vienna University of Technology)
BibTeX Citation
@inproceedings{calautti_pods15,
address = {New York, NY, USA},
series = {{PODS} '15},
title = {{Chase Termination for Guarded Existential Rules}},
url = {https://dl.acm.org/doi/10.1145/2745754.2745773},
doi = {10.1145/2745754.2745773},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Calautti, Marco and Gottlob, Georg and Pieris, Andreas},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,045 | Exploiting Equality Generating Dependencies in Checking Chase Termination | 2016 | VLDB | 5.7186824e-05 |
| 9,196 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS | 5.3058708e-05 |
| 10,649 | Restricted Chase Termination: You Want More than Fairness | 2025 | PODS | 5.093636e-05 |
| 11,053 | Vadacode: A Logician-friendly IDE for Datalog± | 2025 | VLDB | 5.093636e-05 |
| 11,750 | All-Instances Restricted Chase Termination | 2020 | PODS | 5.093636e-05 |
| 11,967 | The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries | 2017 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 40 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00046918506 |
| 97 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD | 0.00034574497 |
| 525 | The Chase Revisited | 2008 | PODS | 0.00017118255 |
| 1,541 | Generalized Schema-Mappings: From Termination To Tractability | 2009 | PODS | 0.00010427058 |
| 3,247 | On Chase Termination Beyond Stratification | 2009 | VLDB | 7.5993811e-05 |
| 4,794 | CWA-Solutions for Data Exchange Settings with Target Dependencies | 2007 | PODS | 6.5038715e-05 |
| 6,740 | Stratification Criteria and Rewriting Techniques for Checking Chase Termination | 2011 | VLDB | 5.7869364e-05 |
| 6,785 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS | 5.7758194e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,584 | Rewriting the Infinite Chase | 2022 | VLDB |
| 2 | 6,785 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS |
| 3 | 8,779 | Chase Termination: A Constraints Rewriting Approach | 2010 | VLDB |
| 4 | 525 | The Chase Revisited | 2008 | PODS |
| 5 | 11,129 | Chase Termination Beyond Polynomial Time | 2024 | PODS |
| 6 | 10,649 | Restricted Chase Termination: You Want More than Fairness | 2025 | PODS |
| 7 | 3,247 | On Chase Termination Beyond Stratification | 2009 | VLDB |
| 8 | 9,196 | Non-Uniformly Terminating Chase: Size and Complexity | 2022 | PODS |
| 9 | 11,750 | All-Instances Restricted Chase Termination | 2020 | PODS |
| 10 | 9,195 | Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study | 2023 | VLDB |