Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Finite Entailment of Non-Local Queries in Description Logics (2006.16869v1)

Published 30 Jun 2020 in cs.AI and cs.DB

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Tomasz Gogacz (11 papers)
  2. Víctor Gutiérrez-Basulto (28 papers)
  3. Albert Gutowski (2 papers)
  4. Filip Murlak (16 papers)
  5. Yazmín Ibáñez-García (8 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.