Practical datalog rewriting for existential rules

Loading...
Thumbnail Image
File version

Version of Record (VoR)

Author(s)
Wang, Z
Xiao, P
Wang, K
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2019
Size
File type(s)
Location

Oslo, Norway

Abstract

Existential rules is an expressive ontology formalism for ontology-mediated query answering and as a trade-off, query answering is of high complexity, while several tractable fragments have been identified. Existing systems are based on first-order rewriting methods and the resulting queries can be too large for DBMS to handle. It is shown that datalog rewriting can result in more compact queries but the previous study is mostly theoretical. A practical datalog rewriting algorithm is still missing. In this paper, we fill the gap by proposing a practical datalog rewriting algorithm for conjunctive query answering over existential rules, and establish its correctness over well known fragments of existential rules. Experiments on our prototype system showed superior or comparable performance over state-of-the-art systems on both the compactness of rewritings and the efficiency of query answering.

Journal Title
Conference Title

CEUR Workshop Proceedings

Book Title
Edition
Volume

2373

Issue
Thesis Type
Degree Program
School
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© The Author(s) 2019. This is an Open Access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Persistent link to this record
Citation

Wang, Z; Xiao, P; Wang, K, Practical datalog rewriting for existential rules, CEUR Workshop Proceedings, 2019, 2373, pp. 1-12