Expressive Completeness of Existential Rule Languages for Ontology-based Query Answering release_qbxgdhclhfg2vgss7qcozpusam

by Heng Zhang, Yan Zhang, Jia-Huai You

Released as a article .

2016  

Abstract

Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering. In this paper, we prove that disjunctive embedded dependencies exactly capture the class of recursively enumerable ontologies in Ontology-based Conjunctive Query Answering (OCQA). Our expressive completeness result does not rely on any built-in linear order on the database. To establish the expressive completeness, we introduce a novel semantic definition for OCQA ontologies. We also show that neither the class of disjunctive tuple-generating dependencies nor the class of embedded dependencies is expressively complete for recursively enumerable OCQA ontologies.
In text/plain format

Archived Files and Locations

application/pdf  381.5 kB
file_tgk45hpcibgd5ca6tetxa3cbta
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-04-18
Version   v1
Language   en ?
arXiv  1604.05006v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 5a4f14bb-6f75-40ab-a82c-7f4608481bbb
API URL: JSON