Temporal Conjunctive Queries in Expressive Description Logics with Transitive Roles

@inproceedings{Baader2015TemporalCQ,
  title={Temporal Conjunctive Queries in Expressive Description Logics with Transitive Roles},
  author={Franz Baader and Stefan Borgwardt and Marcel Lippmann},
  booktitle={Australasian Conference on Artificial Intelligence},
  year={2015}
}
In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. In order to deal with dynamically changing data sources, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of OBDA to support the processing of temporal information. We extend the existing complexity analysis of TCQ entailment to very… 
Temporal Query Answering in DL-Lite with Negation
TLDR
This work considers negation in the ontology and query language, and study both data and combined complexity of query entailment in a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic.
News on Temporal Conjunctive Queries
TLDR
A new result is proved on the data complexity of ontology-based TCQ answering and the gap between co-NP and ExpTime for many description logics is closed.
Temporal Conjunctive Query Answering in the Extended DL-Lite Family
TLDR
This work investigates temporal conjunctive queries (TCQs) that allow to access temporal data through classical ontologies and studies combined and data complexity of TCQ entailment for ontologies written in description logics from the extended DL-Lite family.
Ontology-Mediated Query Answering over Temporal Data: A Survey (Invited Talk)
TLDR
This work analyzes ontology and query languages based on the linear temporal logic LTL, the multi-dimensional Halpern-Shoham interval temporal logic HS_n, as well as the metric temporal logic MTL to focus on the data complexity of answering temporal ontology-mediated queries.
Maybe Eventually? Towards Combining Temporal and Probabilistic Description Logics and Queries
  • P. Koopmann
  • Computer Science, Philosophy
    Description Logics
  • 2019
TLDR
Speci_cally, a description logics extended with operators from linear temporal logic (LTL), as well as subjective probability operators, and an extended query language in which conjunctive queries can be combined using these operators.
Temporal Minimal-World Semantics for Sparse ABoxes
TLDR
A rewriting strategy for dealing with negated query atoms is proposed, which shows that query answering is possible in polynomial time in data complexity.
First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
TLDR
A hierarchy of 2D DL-Lite/LTL ontology languages are defined and the FO-rewritability of OMQs with atomic queries is investigated, showing that the restriction to Krom and Horn role inclusions leads to decidability (and ExpSpace-completeness), even if one admits full Booleans on concepts.
Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information
TLDR
These features make ontologies valuable tools for systems that integrate heterogeneous data sources and need to automatically interpret the data, to support data analysis or to fully-automatedly recognize complex contexts.
Metric Temporal Description Logics with Interval-Rigid Names (Extended Abstract)
TLDR
This paper complements existing results on the combination of DLs with metric temporal logics over the natural numbers by introducing interval-rigid names, which allows to state that elements in the extension of certain names stay in this extension for at least some specified amount of time.
...
...

References

SHOWING 1-10 OF 428 REFERENCES
Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles
TLDR
The existing complexity analysis of TCQ entailment is extended to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allows for queries containing transitive roles.
Temporal Query Answering in the Description Logic EL
TLDR
This work investigates temporalized OBDA w.r.t. EL-LTL, a recently proposed temporalized query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL), and studies both data and combined complexity of query entailment in this setting.
Temporal Query Answering in DL-Lite with Negation
TLDR
This work considers negation in the ontology and query language, and study both data and combined complexity of query entailment in a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic.
Query answering in description logics with transitive roles
TLDR
The main result is the identification of two new sources of complexity: the combination of transitive roles and role hierarchies which results in 2-EXPTIME-hardness, andTransitive roles alone which result in CO-NEXPTime-hardiness.
Temporal query entailment in the Description Logic SHQ
Regular Path Queries in Expressive Description Logics with Nominals
TLDR
Decidability and (tight) upper bounds are provided for the problem of checking entailment and containment of positive regular path queries under various combinations of constructs used in expressive DLs; specifically: regular expressions and (safe) Booleans over roles, and allowing for the combination of any two constructs among inverse roles, qualified number restrictions, and nominals.
Conjunctive Query Answering for the Description Logic SHIQ
TLDR
This paper considers conjunctive queries over knowledge bases formulated in the popular DL SHIQ and allows transitive roles in both the query and the knowledge base and shows that query answering is decidable and establishes the following complexity bounds: regarding combined complexity, a deterministic algorithm for query answering that needs time single exponential and double exponential in the size of the query.
Reasoning and Query Answering in Description Logics
TLDR
This lecture discusses the knowledge modeling capabilities of some of the most prominent DLs, including expressive ones, and presents some DL reasoning services, and gives an overview of the computational complexity landscape.
Temporal Description Logic for Ontology-Based Data Access
TLDR
A temporal description logic, TQL, is designed that extends the standard ontology language OWL 2 QL, provides basic means for temporal conceptual modelling and ensures first-order rewritability of conjunctive queries for suitably defined data instances with validity time.
...
...