Answering Regular Path Queries Over SQ Ontologies

We study query answering in the description logic 𝒮𝒬 supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for 𝒮𝒬 knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2ExpTime.

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
10/31/2011

Conjunctive Query Answering for the Description Logic SHIQ

Conjunctive queries play an important role as an expressive query langua...
research
04/29/2022

Finite Entailment of UCRPQs over ALC Ontologies

We investigate the problem of finite entailment of ontology-mediated que...
research
05/18/2018

A set-based reasoner for the description logic (Extended Version)

We present a -based implementation of a reasoner for a decidable fragmen...
research
11/10/2014

Answering Conjunctive Queries over EL Knowledge Bases with Transitive and Reflexive Roles

Answering conjunctive queries (CQs) over EL knowledge bases (KBs) with c...
research
02/28/2014

Nested Regular Path Queries in Description Logics

Two-way regular path queries (2RPQs) have received increased attention r...
research
04/19/2018

A Practical Acyclicity Notion for Query Answering over Horn-SRIQ Ontologies

Conjunctive query answering over expressive Horn Description Logic ontol...

Please sign up or login with your details

Forgot password? Click here to reset