Dichotomies in Ontology-Mediated Querying with the Guarded Fragment

@article{Hernich2017DichotomiesIO,
  title={Dichotomies in Ontology-Mediated Querying with the Guarded Fragment},
  author={Andr{\'e} Hernich and Carsten Lutz and Fabio Papacchini and Frank Wolter},
  journal={Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems},
  year={2017}
}
  • André Hernich, C. Lutz, F. Wolter
  • Published 9 May 2017
  • Computer Science
  • Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
We study the complexity of ontology-mediated querying when ontologies are formulated in the guarded fragment of first-order logic (GF). Our general aim is to classify the data complexity on the level of ontologies where query evaluation w.r.t. an ontology O is considered to be in PTime if all (unions of conjunctive) queries can be evaluated in PTime w.r.t. O and coNP-hard if at least one query is coNP-hard w.r.t. O. We identify several large and relevant fragments of GF that enjoy a dichotomy… 

Figures and Tables from this paper

Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
TLDR
The aim is to classify the data complexity and Datalog rewritability of query evaluation depending on the ontology O, where query evaluation w.r.t. O is in PTime, and the decidability of whether a given ontology enjoys PTime query evaluation is studied, presenting both positive and negative results,Depending on the fragment.
The Data Complexity of Ontology-Mediated Queries with Closed Predicates
TLDR
This work provides a non-uniform analysis, aiming at a classification of the complexity into tractable and non-tractable for ontologies in the lightweight DLs DL-Lite and EL, and the expressive DL ALCHI, and shows that there is no dichotomy if both concept and role names can be closed.
The Data Complexity of Description Logic Ontologies
TLDR
This work analyzes the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic conj unctive queries and shows that it is undecidable whether a given ontology admits PTime query evaluation.
How to Approximate Ontology-Mediated Queries
TLDR
This work introduces and study several notions of approximation for ontology-mediated queries based on the description logics ALC and ALCI, and determines the computational complexity and the relative completeness of the resulting approximations.
Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying
TLDR
This work investigates in which cases (1) and (2) are equivalent, finding that the answer depends on whether the unique name assumption (UNA) is made, on the description logic under consideration, and on the nesting depth of quantifiers in the TBox.
Logical Separability of Incomplete Data under Ontologies
TLDR
This paper investigates the existence of a separating formula for incomplete data in the presence of an ontology, characterize separability in a model-theoretic way, compare the separating power of the different languages, and determine the computational complexity of separability as a decision problem.
A Note on DL-Lite with Boolean Role Inclusions
TLDR
It is shown that binary disjunctions on roles do not change the complexity of satisfiability if disjunction is allowed on concepts, while still causing undecidability of UCQ answering.
Horn Rewritability vs PTime Query Answering for Description Logic TBoxes
TLDR
The main results are that this is indeed the case when L is the set of ALCHI or ALCIF TBoxes of quantifier depth 1 (which covers the majority of such T boxes), but not for ALCHIF and ALCQ T Boxes of depth 1.
Horn rewritability vs PTime query evaluation for description logic TBoxes
TLDR
The main results are that this is indeed the case when L is the set of ALCHI or ALCIF TBoxes of quantifier depth 1 (which covers the majority of such T boxes), but not for ALCHIF and ALCQ T Boxes of depth 1.
...
1
2
3
...

References

SHOWING 1-10 OF 86 REFERENCES
The Data Complexity of Description Logic Ontologies
TLDR
This work analyzes the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic conj unctive queries and shows that it is undecidable whether a given ontology admits PTime query evaluation.
Non-Uniform Data Complexity of Query Answering in Description Logics
TLDR
This paper proposes a new method for investigating data complexity in OBDA: instead of classifying whole logics according to their complexity, it aims at classifying each individual ontology within a given master language.
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP
TLDR
This paper studies several classes of ontology-mediated queries, where the database queries are given as some form of conjunctive query and the ontologies are formulated in description logics or other relevant fragments of first-order logic, such as the guarded fragment and the unary-negation fragment.
Towards more expressive ontology languages: The query answering problem
Ontology-Mediated Query Answering with Data-Tractable Description Logics
TLDR
A brief introduction to ontology-mediated query answering using description logic (DL) ontologies, with a focus on DLs for which query answering scales polynomially in the size of the data, as these are best suited for applications requiring large amounts of data.
Ontology-Based Data Access with Closed Predicates is Inherently Intractable(Sometimes)
TLDR
In all cases where answering conjunctive queries (CQs) with (open and) closed predicates is tractable, it coincides with answering CQs with all predicates assumed open, which means that CQ answering with closed predicate is inherently intractable.
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
TLDR
It is established that, for a whole range of sublogics of $\mathcal{SHOIQ}$ that contain $\Mathcal{AL}$, answering such queries has coNP-complete data complexity, and a tight coNP upper bound for positive existential queries without transitive roles is proved.
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
TLDR
It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.
The price of query rewriting in ontology-based data access
Data Complexity of Query Answering in Description Logics
...
1
2
3
4
5
...