2000 character limit reached
On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles (2010.11503v1)
Published 22 Oct 2020 in cs.LO and cs.AI
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).
- Yazmín Ibáñez-García (8 papers)
- Thomas Gogacz (1 paper)
- Víctor Gutiérrez-Basulto (28 papers)
- Jean Christoph Jung (21 papers)
- Filip Murlak (16 papers)