DROPS

Document

DOI: 10.4230/LIPIcs.CSL.2026.42

Robustness of Constraint Automata for Description Logics with Concrete Domains

Authors: Stéphane Demri and Tianwen Gu

Published in: LIPIcs, Volume 363, 34th EACSL Annual Conference on Computer Science Logic (CSL 2026)

Abstract

Decidability or complexity issues about the consistency problem for description logics with concrete domains have already been analysed with tableaux-based or type elimination methods. Concrete domains in ontologies are essential to consider concrete objects and predefined relations. In this work, we expose an automata-based approach leading to the optimal upper bound ExpTime, that is designed by enriching the transitions with symbolic constraints. We show that the nonemptiness problem for such automata belongs to ExpTime if the concrete domains satisfy a few simple properties. Then, we provide a reduction from the consistency problem for ontologies, yielding ExpTime-membership. Thanks to the expressivity of constraint automata, the results are extended to additional ingredients such as inverse roles, functional role names and constraint assertions, while maintaining ExpTime-membership, which illustrates the robustness of the approach.

Cite as

Stéphane Demri and Tianwen Gu. Robustness of Constraint Automata for Description Logics with Concrete Domains. In 34th EACSL Annual Conference on Computer Science Logic (CSL 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 363, pp. 42:1-42:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{demri_et_al:LIPIcs.CSL.2026.42,
  author =	{Demri, St\'{e}phane and Gu, Tianwen},
  title =	{{Robustness of Constraint Automata for Description Logics with Concrete Domains}},
  booktitle =	{34th EACSL Annual Conference on Computer Science Logic (CSL 2026)},
  pages =	{42:1--42:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-411-6},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{363},
  editor =	{Guerrini, Stefano and K\"{o}nig, Barbara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.42},
  URN =		{urn:nbn:de:0030-drops-254679},
  doi =		{10.4230/LIPIcs.CSL.2026.42},
  annote =	{Keywords: Description logics, concrete domains, constraint automata, complexity}
}

Search Results

Documents authored by Gu, Tianwen

Robustness of Constraint Automata for Description Logics with Concrete Domains

Abstract

Cite as

Thanks for your feedback!

Could not send message