mlsanityData to 14 Oct 2026

On Finite Entailment of Non-Local Queries in Description Logics

arXiv 2006.16869 ↗First posted 30 Jun 2020cs.AI cs.DBcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 30 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.