Complexity of answering counting aggregate queries over DL - Lite
The ontology based data access model assumes that users access data by means of an ontology, which is often described in terms of description logics. As a consequence, languages for managing ontologies now need algorithms not only to decide standard reasoning problems, but also to answer database-li...
Main Authors: | Kostylev, E, Reutter, J |
---|---|
Format: | Journal article |
Published: |
Elsevier
2015
|
Similar Items
-
Complexity of answering counting aggregate queries over DL-Lite
by: Kostylev, E, et al.
Published: (2013) -
Answering counting aggregate queries over ontologies of the DL-Lite family
by: Kostylev, E, et al.
Published: (2013) -
The Complexity of Explaining Negative Query Answers in DL−Lite
by: Calvanese, D, et al.
Published: (2012) -
Conjunctive queries with negation over DL-Lite: A closer look
by: Gutiérrez-Basulto, V, et al.
Published: (2013) -
Reasoning about Explanations for Negative Query Answers in DL−Lite
by: Calvanese, D, et al.
Published: (2013)