Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
Summary: Classifies data complexity of ontology-mediated querying for guarded-fragment ontologies, identifying large GF fragments that admit a PTIME vs coNP dichotomy (some supporting counting) and showing most BioPortal ontologies fit or are easily rewritable into them. Shows impossibility of a dichotomy for other fragments via a Ladner-style NP-intermediate construction, ties a dichotomy for full GF to the Feder–Vardi CSP conjecture, and gives positive and negative results on Datalog-rewritability and decidability of PTIME query evaluation per ontology. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. André Hernich (University of Liverpool)
- 2. Carsten Lutz (University of Bremen)
- 3. Fabio Papacchini (University of Liverpool)
- 4. Frank Wolter (University of Liverpool)
BibTeX Citation
@inproceedings{hernich_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{Dichotomies in Ontology-Mediated Querying with the Guarded Fragment}},
url = {https://dl.acm.org/doi/10.1145/3034786.3056108},
doi = {10.1145/3034786.3056108},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Hernich, André and Lutz, Carsten and Papacchini, Fabio and Wolter, Frank},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 525 | The Chase Revisited | 2008 | PODS | 0.00017118255 |
| 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00010180625 |
| 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.9625097e-05 |
| 2,746 | Dichotomies in the Complexity of Preferred Repairs | 2015 | PODS | 8.1725014e-05 |
| 3,991 | The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries | 2016 | VLDB | 6.9695922e-05 |
| 4,445 | View-Based Query Containment | 2003 | PODS | 6.699172e-05 |
| 5,347 | Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP | 2013 | PODS | 6.2571376e-05 |
| 5,905 | A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies | 2012 | PODS | 6.0461963e-05 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,129 | Complexity of Query Processing in Databases with OR-Objects | 1989 | PODS |
| 2 | 11,893 | Containment for Rule-Based Ontology-Mediated Queries | 2018 | PODS |
| 3 | 8,479 | Optimizing Query Answering under Ontological Constraints | 2011 | VLDB |
| 4 | 6,221 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS |
| 5 | 3,801 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS |
| 6 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 7 | 11,967 | The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries | 2017 | PODS |
| 8 | 9,291 | Efficiently Enumerating Answers to Ontology-Mediated Queries | 2022 | PODS |
| 9 | 5,347 | Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP | 2013 | PODS |
| 10 | 11,753 | The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 2020 | PODS |