Towards Universal Languages for Tractable Ontology Mediated Query Answering

11/26/2019
by   Heng Zhang, et al.
0

An ontology language for ontology mediated query answering (OMQA-language) is universal for a family of OMQA-languages if it is the most expressive one among this family. In this paper, we focus on three families of tractable OMQA-languages, including first-order rewritable languages and languages whose data complexity of the query answering is in AC0 or PTIME. On the negative side, we prove that there is, in general, no universal language for each of these families of languages. On the positive side, we propose a novel property, the locality, to approximate the first-order rewritability, and show that there exists a language of disjunctive embedded dependencies that is universal for the family of OMQA-languages with locality. All of these results apply to OMQA with query languages such as conjunctive queries, unions of conjunctive queries and acyclic conjunctive queries.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2022

Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic

Our concern is the problem of determining the data complexity of answeri...
research
12/14/2021

Answering Queries with Negation over Existential Rules

Ontology-based query answering with existential rules is well understood...
research
07/01/2021

Computing CQ lower-bounds over OWL 2 through approximation to RSA

Conjunctive query (CQ) answering over knowledge bases is an important re...
research
01/27/2017

Comparative Study Of Data Mining Query Languages

Since formulation of Inductive Database (IDB) problem, several Data Mini...
research
02/23/2022

Scalable Query Answering under Uncertainty to Neuroscientific Ontological Knowledge: The NeuroLang Approach

Researchers in neuroscience have a growing number of datasets available ...
research
12/15/2021

Characterizing the Program Expressive Power of Existential Rule Languages

Existential rule languages are a family of ontology languages that have ...
research
11/19/2014

Existential Rule Languages with Finite Chase: Complexity and Expressiveness

Finite chase, or alternatively chase termination, is an important condit...

Please sign up or login with your details

Forgot password? Click here to reset