On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles
Logic in Computer Science
2020-10-23 v1 Artificial Intelligence
Abstract
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).
Keywords
Cite
@article{arxiv.2010.11503,
title = {On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles},
author = {Thomas Gogacz and Víctor Gutiérrez-Basulto and Yazmín Ibáñez-García and Jean Christoph Jung and Filip Murlak},
journal= {arXiv preprint arXiv:2010.11503},
year = {2020}
}
Comments
Full version of a paper accepted at IJCAI'19