Data Complexity of Query Answering in Description Logics

@inproceedings{Calvanese2005DataCO,
  title={Data Complexity of Query Answering in Description Logics},
  author={Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati},
  booktitle={Description Logics},
  year={2005}
}
In this paper we study data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by an ABox and a TBox. In particular, we are interested in characterizing the FOL-reducibility and the polynomial tractability boundaries of conjunctive query answering, depending on the expressive power of the Description Logic used to specify the knowledge base. FOL-reducibility means that query answering can be reduced to evaluating queries over the database… Expand
Query Answering with DBoxes is Hard
TLDR
It is shown that query answering in ALCFIO and ALCFI with DBoxes are mutually reducible to each other in polynomial time. Expand
Tractable query answering for description logics via query rewriting
TLDR
RQR is presented—a novel resolution-based rewriting algorithm for the description logic ELHIO¬ that generalizes and extends existing approaches and is worst-case optimal with respect to data complexity for all of these logics. Expand
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. Expand
View-based query answering in Description Logics: Semantics and complexity
TLDR
This paper provides two notions of view-based query answering over ontologies, all based on the idea that the precomputed answers to views are the certain answers to the corresponding queries, and relates such notions to privacy-aware access to ontologies. Expand
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
TLDR
For a whole range of DLs from AL to SHIQ, answering CQs with no transitive roles has CONP-complete data complexity, established by a novel tableaux-based algorithm for checking query entailment. Expand
Data Complexity of Query Answering in Expressive Description Logics with Nominals Data Complexity of Query Answering in Expressive Description Logics with Nominals
The formal foundations of the standard web ontology languages, OWL-Lite and OWLDL, are provided by expressive Description Logics (DLs), such as SHIF and SHOIQ. In the Semantic Web and other domains,Expand
The Limits of Querying Ontologies
  • R. Rosati
  • Mathematics, Computer Science
  • ICDT
  • 2007
TLDR
Results show that extending standard reasoning tasks in DLs to answering relational queries is unfeasible in many DLs, even in inexpressive ones, and believe that these results have important implications for ontology-based information access, in particular for the design of query languages for ontologies. Expand
View-Based Query Answering over Description Logic Ontologies
TLDR
This paper defines a spectrum of notions of view-based query answering over ontologies, all based on the idea that the precomputed answers to views are the certain answers to the corresponding queries, and relates such notions to relevant issues in ontology management, in particular ontology access authorization. Expand
Tractable query answering and rewriting under description logic constraints
TLDR
A novel query rewriting algorithm is presented that handles constraints modeled in the DL ELHIO ¬ and it is used to show that answering conjunctive queries in this setting is PTime -complete w.r.t. data complexity. Expand
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. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 57 REFERENCES
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. Expand
The Limits of Querying Ontologies
  • R. Rosati
  • Mathematics, Computer Science
  • ICDT
  • 2007
TLDR
Results show that extending standard reasoning tasks in DLs to answering relational queries is unfeasible in many DLs, even in inexpressive ones, and believe that these results have important implications for ontology-based information access, in particular for the design of query languages for ontologies. Expand
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. Expand
DL-Lite: Tractable Description Logics for Ontologies
TLDR
DL-Lite is proposed, a new Description Logic specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning, and shows that in DL-LITE the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynometric in theSize of the ABox, the first result of polynomic data complexity for query answering over DL knowledge bases. Expand
Answering Queries Using Views over Description Logics Knowledge Bases
TLDR
This paper addresses answering queries using views in a setting where intensional knowledge about the domain is represented using a very expressive Description Logic equipped with n-ary relations, and queries are nonrecursive datalog queries whose predicates are the concepts and relations that appear in the Description Logic knowledge base. Expand
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
TLDR
Decidability (more precisely, a 2EXPTIME upper bound) of query answering is proved, thus significantly pushing the decidability frontier, both with respect to the query language and the considered DL. Expand
Reducing SHIQ-Description Logic to Disjunctive Datalog Programs
TLDR
This paper presents a novel approach to checking consistency of ABoxes, instance checking and query answering, w.r.t. optimization techniques from deductive databases, and a resolution-based decision procedure for unary coding of numbers worst-case optimal. Expand
Conjunctive Queries for EL with Role Composition ⋆
EL is a rather expressive description logic (DL) that still admits polynomial time inferencing for many reasoning tasks. Conjunctive queries are an important means for expressive querying of DLExpand
Data complexity of answering conjunctive queries over SHIQ knowledge bases
TLDR
An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity that is based on the tableau algorithm for reasoning with individuals in SHIQ. Expand
On the decidability of query containment under constraints
TLDR
This work addresses query containment under constraints within a setting where constraints are specified in the form of special inclusion dependencies over complex expressions, built by using intersection and difference of relations, special forms of quantification, regular expressions over binary relations, and cardinality constraints. Expand
...
1
2
3
4
5
...