Towards Universal Languages for Tractable Ontology Mediated Query Answering. (arXiv:1911.11359v1 [cs.AI])

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.

Source link

Related posts

edX, HarvardX, and Geogle Introduce a Certificate Program on Tiny Machine Learning – IBL News


Visual search on AWS—Part 1: Engine implementation with Amazon SageMaker


Selecting good features – Part IV: stability selection, RFE and everything side by side


This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

Privacy & Cookies Policy


COVID-19 (Coronavirus) is a new illness that is having a major effect on all businesses globally LIVE COVID-19 STATISTICS FOR World