On Finite Entailment of Non-Local Queries in Description Logics

06/30/2020
by   Tomasz Gogacz, et al.
0

We study the problem of finite entailment of ontology-mediated queries. Going beyond local queries, we allow transitive closure over roles. We focus on ontologies formulated in the description logics ALCOI and ALCOQ, extended with transitive closure. For both logics, we show 2EXPTIME upper bounds for finite entailment of unions of conjunctive queries with transitive closure. We also provide a matching lower bound by showing that finite entailment of conjunctive queries with transitive closure in ALC is 2EXPTIME-hard.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2020

On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles

We study the description logic SQ with number restrictions applicable to...
research
08/09/2018

Finite Query Answering in Expressive Description Logics with Transitive Roles

We study the problem of finite ontology mediated query answering (FOMQA)...
research
09/06/2021

On non-structural subtype entailment

We prove that the non-structural subtype entailment problem for finite a...
research
12/07/2022

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests

SHACL is a W3C-proposed schema language for expressing structural constr...
research
08/29/2021

An Upper Bound for Provenance in ELHr

We investigate the entailment problem in ELHr ontologies annotated with ...
research
07/15/2020

Defeasible RDFS via Rational Closure

In the field of non-monotonic logics, the notion of Rational Closure (RC...

Please sign up or login with your details

Forgot password? Click here to reset