Conference item icon

Conference item

Complexity of answering counting aggregate queries over DL-Lite

Abstract:

One of the main applications of description logics is the ontology-based data access model, which requires algorithms for query answering over ontologies. In fact, some description logics, like those in the DL-Lite family, are designed so that simple queries, such as conjunctive queries, are efficiently computable. In this paper we study counting aggregate queries over ontologies, i.e. queries which use aggregate functions COUNT and COUNT DISTINCT. We propose an intuitive semantics for certai...

Expand abstract
Publication status:
Published
Version:
Accepted Manuscript

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
ORCID:
0000-0002-8886-6129
Reutter, JL More by this author

Contributors

Role:
Editor
Role:
Editor
Role:
Editor
Role:
Editor
Publisher:
CEUR-WS.org Publisher's website
Publication date:
2013-12-01
ISSN:
1613-0073
Pubs id:
pubs:433958
URN:
uri:2c237d1b-4dcc-48f8-97cd-23275a14ec1e
UUID:
uuid:2c237d1b-4dcc-48f8-97cd-23275a14ec1e
Local pid:
pubs:433958
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP