The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains (Extended Version)

Stefan Borgwardt; Filippo De Bortoli; Patrick Koopmann

doi:10.48550/arXiv.2405.19096

The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains (Extended Version)

Research output: Preprint/Documentation/Report › Preprint

Contributors

Stefan Borgwardt - , Chair of Automata Theory (Author)
Filippo De Bortoli - , Chair of Automata Theory, Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI Dresden) (Author)
Patrick Koopmann - , Vrije Universiteit Amsterdam (VU) (Author)

Details

Original language	English
Publisher	arXiv
Publication status	Published - 29 May 2024

No renderer: customAssociatesEventsRenderPortal,dk.atira.pure.api.shared.model.researchoutput.WorkingPaper

Keywords

The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains

Borgwardt, S., De Bortoli, F. & Koopmann, P., Jun 2024, Proceedings of the 37th International Workshop on Description Logics (DL 2024). Giordano, L., Jung, J. C. & Ozaki, A. (eds.). CEUR-WS.org, Vol. 3739. 10 p. (CEUR Workshop Proceedings, Vol. 3739).

Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review

View all research output (1)

Research Portal of the TU Dresden

The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains (Extended Version)

Contributors

Details

Keywords

Related content

The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains