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

10/22/2020
by   Thomas Gogacz, et al.
0

We study the description logic SQ with number restrictions applicable to transitive roles, extended with either nominals or inverse roles. We show tight 2EXPTIME upper bounds for unrestricted entailment of regular path queries for both extensions and finite entailment of positive existential queries for nominals. For inverses, we establish 2EXPTIME-completeness for unrestricted and finite entailment of instance queries (the latter under restriction to a single, transitive role).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2022

Finite Entailment of UCRPQs over ALC Ontologies

We investigate the problem of finite entailment of ontology-mediated que...
research
06/30/2020

On Finite Entailment of Non-Local Queries in Description Logics

We study the problem of finite entailment of ontology-mediated queries. ...
research
01/16/2014

Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!

Description Logics are knowledge representation formalisms that provide,...
research
11/19/2020

Conservative Extensions in Horn Description Logics with Inverse Roles

We investigate the decidability and computational complexity of conserva...
research
11/17/2020

Answering Regular Path Queries Over SQ Ontologies

We study query answering in the description logic 𝒮𝒬 supporting qualifie...
research
01/16/2014

Logical Foundations of RDF(S) with Datatypes

The Resource Description Framework (RDF) is a Semantic Web standard that...
research
02/04/2014

Optimizing SPARQL Query Answering over OWL Ontologies

The SPARQL query language is currently being extended by the World Wide ...

Please sign up or login with your details

Forgot password? Click here to reset