Output details
11 - Computer Science and Informatics
University of Oxford
Return to search
Output 0 of 0 in the submission
Article title
Tractable query answering and rewriting under description logic constraints
Type
D - Journal article
Title of journal
Journal of Applied Logic
Article number
-
Volume number
8
Issue number
2
First page of article
186
ISSN of journal
1570-8683
Year of publication
2010
Number of additional authors
2
Additional information
<22>
Answering queries over an incomplete database w.r.t. a set of Description Logic (DL) constraints is an important computational task with applications in fields as diverse as information integration and metadata management in the Semantic Web. This paper presents a novel query rewriting algorithm that handles constraints modelled in the DL ELHIO(neg). It proves that answering conjunctive queries in this setting is PTime-complete w.r.t. data complexity and that the algorithm is worst-case optimal; it also proves that the algorithm remains worst-case optimal for various weaker description logics of the EL and DL-Lite families.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
24
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
