For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Oxford

Return to search Previous output Next output
Output 0 of 0 in the submission
Output title

Optimizing query answering under ontological constraints

Type
E - Conference contribution
DOI
-
Name of conference/published proceedings
Proceedings of the VLDB Endowment
Volume number
4
Issue number
11
First page of article
1004
ISSN of proceedings
2150-8097
Year of publication
2011
Number of additional authors
1
Additional information

<12>

This paper presents a highly-optimized rewriting algorithm for ontological query answering under existential rules. Given an input query, the algorithm produces a bounded Datalog rewriting that can be used to answer the query by taking into account the semantic consequences of the ontology. The algorithm is provably sound and complete and was the first rewriting algorithm that used bounded Datalog as a target language. VLDB has been the reference conference for the Database community for more than 30 years with an average acceptance rate of 17% in the last 10 years.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-