Ontologies can be used to provide an enriched vocabulary for the formulation
of queries over instance data. We identify query emptiness and predicate
emptiness as two central reasoning services in this context. Query
emptiness asks whether a given query has an empty answer over all
data sets formulated in a given signature. Predicate emptiness is
defined analogously, but quantifies universally over all queries
that contain a given predicate. In this paper, we determine the computational
complexity of query emptiness and predicate emptiness in the EL,
DL-Lite, and ALC-families of description logics, investigate the
connection to ontology modules, and perform a practical case study
to evaluate the new reasoning services.
%0 Journal Article
%1 Baader2010
%A Baader, Franz
%A Bienvenu, Meghyn
%A Lutz, Carsten
%A Wolter, Frank
%D 2010
%K description_logics
%T Query and Predicate Emptiness in Description Logics
%U http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1246
%X Ontologies can be used to provide an enriched vocabulary for the formulation
of queries over instance data. We identify query emptiness and predicate
emptiness as two central reasoning services in this context. Query
emptiness asks whether a given query has an empty answer over all
data sets formulated in a given signature. Predicate emptiness is
defined analogously, but quantifies universally over all queries
that contain a given predicate. In this paper, we determine the computational
complexity of query emptiness and predicate emptiness in the EL,
DL-Lite, and ALC-families of description logics, investigate the
connection to ontology modules, and perform a practical case study
to evaluate the new reasoning services.
@article{Baader2010,
abstract = {Ontologies can be used to provide an enriched vocabulary for the formulation
of queries over instance data. We identify query emptiness and predicate
emptiness as two central reasoning services in this context. Query
emptiness asks whether a given query has an empty answer over all
data sets formulated in a given signature. Predicate emptiness is
defined analogously, but quantifies universally over all queries
that contain a given predicate. In this paper, we determine the computational
complexity of query emptiness and predicate emptiness in the EL,
DL-Lite, and ALC-families of description logics, investigate the
connection to ontology modules, and perform a practical case study
to evaluate the new reasoning services.},
added-at = {2011-08-09T16:33:51.000+0200},
author = {Baader, Franz and Bienvenu, Meghyn and Lutz, Carsten and Wolter, Frank},
biburl = {https://www.bibsonomy.org/bibtex/2335389ba3d91d191b217da416141258f/reynares.e},
conference = {Knowledge Representation and Reasoning Conference},
interhash = {54e4c65e3dfd08ca5faa13bbad397038},
intrahash = {335389ba3d91d191b217da416141258f},
keywords = {description_logics},
tags = {TOREAD},
timestamp = {2013-05-16T22:50:43.000+0200},
title = {Query and Predicate Emptiness in Description Logics},
url = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1246},
year = 2010
}