First Steps Towards Taming Description Logics with Strings - Laboratoire Méthodes Formelles Access content directly
Conference Papers Year : 2023

First Steps Towards Taming Description Logics with Strings

Abstract

We consider the description logic ALCFP(D_Σ) over the concrete domain D_Σ with the strict prefix order over finite strings. Using an automata-based approach, we show that the concept satisfiability problem w.r.t. general TBoxes for ALCFP(D_Σ) is ExpTime-complete for all finite alphabets Σ. As far as we know, this is the first complexity result for an expressive description logic with a nontrivial concrete domain on strings.
Fichier principal
Vignette du fichier
final-jelia23.pdf (584.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04212642 , version 1 (20-09-2023)

Identifiers

  • HAL Id : hal-04212642 , version 1

Cite

Stéphane Demri, Karin Quaas. First Steps Towards Taming Description Logics with Strings. 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA'23), Sep 2023, Dresden (GERMANY), Germany. pp.322--337. ⟨hal-04212642⟩
112 View
41 Download

Share

Gmail Facebook X LinkedIn More