%0 Generic %1 borgwardt2024precisecomplexityreasoningmathcalalc %A Borgwardt, Stefan %A Bortoli, Filippo De %A Koopmann, Patrick %D 2024 %K imported %R 10.48550/arXiv.2405.19096 %T The Precise Complexity of Reasoning in $ALC$ with $ømega$-Admissible Concrete Domains (Extended Version) %U https://doi.org/10.48550/arXiv.2405.19096 %X Concrete domains have been introduced in the context of Description Logics to allow references to qualitative and quantitative values. In particular, the class of ω-admissible concrete domains, which includes Allen's interval algebra, the region connection calculus (RCC8), and the rational numbers with ordering and equality, has been shown to yield extensions of ALC for which concept satisfiability w.r.t. a general TBox is decidable. In this paper, we present an algorithm based on type elimination and use it to show that deciding the consistency of an ALC(D) ontology is ExpTime-complete if the concrete domain D is ω-admissible and its constraint satisfaction problem is decidable in exponential time. While this allows us to reason with concept and role assertions, we also investigate feature assertions f(a,c) that can specify a constant c as the value of a feature f for an individual a. We show that, under conditions satisfied by all known ω-admissible domains, we can add feature assertions without affecting the complexity

@misc{borgwardt2024precisecomplexityreasoningmathcalalc, abstract = {Concrete domains have been introduced in the context of Description Logics to allow references to qualitative and quantitative values. In particular, the class of ω-admissible concrete domains, which includes Allen's interval algebra, the region connection calculus (RCC8), and the rational numbers with ordering and equality, has been shown to yield extensions of ALC for which concept satisfiability w.r.t. a general TBox is decidable. In this paper, we present an algorithm based on type elimination and use it to show that deciding the consistency of an ALC(D) ontology is ExpTime-complete if the concrete domain D is ω-admissible and its constraint satisfaction problem is decidable in exponential time. While this allows us to reason with concept and role assertions, we also investigate feature assertions f(a,c) that can specify a constant c as the value of a feature f for an individual a. We show that, under conditions satisfied by all known ω-admissible domains, we can add feature assertions without affecting the complexity}, added-at = {2024-10-17T11:05:19.000+0200}, archiveprefix = {arXiv}, author = {Borgwardt, Stefan and Bortoli, Filippo De and Koopmann, Patrick}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2260380ea397696ce774f171e7d5f44f2/scadsfct}, doi = {10.48550/arXiv.2405.19096}, eprint = {2405.19096}, interhash = {99f72fb411806579e4cdc2ea1b31df8a}, intrahash = {260380ea397696ce774f171e7d5f44f2}, keywords = {imported}, primaryclass = {cs.LO}, timestamp = {2024-10-17T11:05:19.000+0200}, title = {The Precise Complexity of Reasoning in $\mathcal{ALC}$ with $\omega$-Admissible Concrete Domains (Extended Version)}, url = {https://doi.org/10.48550/arXiv.2405.19096}, year = 2024 }