Data Complexity of Query Answering in Description Logics

Abstract

In this paper we study data complexity of answering conjunctive queries over DL knowledge bases constituted by an ABox and a TBox. In particular, we characterize the LogSpace boundary (over the data) of the problem. This boundary is particularly meaningful because, when we go above it, query answering is not expressible as a first-order logic formula (and hence an SQL query) over the data. Within the LogSpace boundary we essentially find DL-Lite, a simple DL that is rich enough to express the core of UML class diagrams. The second contribution of the paper is to establish coNP-hardness of query answering with respect to data complexity for various cases of surprisingly simple DLs.

DOI: 10.1016/j.artint.2012.10.003

Extracted Key Phrases

1 Figure or Table

050100'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

555 Citations

Semantic Scholar estimates that this publication has 555 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{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}, journal={Artif. Intell.}, year={2005}, volume={195}, pages={335-360} }