%0 Journal Article %1 Baader2020-xj %A Baader, Franz %A Borgwardt, Stefan %A Koopmann, Patrick %A Ozaki, Ana %A Thost, Veronika %D 2020 %I Association for Computing Machinery (ACM) %J ACM Trans. Comput. Log. %K %N 4 %P 1--46 %T Metric temporal description logics with interval-rigid names %V 21 %X In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow us to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining description logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there is a growing interest in extending this work to the quantitative case. In this article, we complement existing results on the combination of DLs with metric temporal logics by introducing interval-rigid concept and role names. Elements included in an interval-rigid concept or role name are required to stay in it for some specified amount of time. We investigate several combinations of (metric) temporal logics with A ℒ C by either allowing temporal operators only on the level of axioms or also applying them to concepts. In contrast to most existing work on the topic, we consider a timeline based on the integers and also allow assertional axioms. We show that the worst-case complexity does not increase beyond the previously known bound of 2-E xp S pace and investigate in detail how this complexity can be reduced by restricting the temporal logic and the occurrences of interval-rigid names.

@article{Baader2020-xj, abstract = {In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow us to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining description logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there is a growing interest in extending this work to the quantitative case. In this article, we complement existing results on the combination of DLs with metric temporal logics by introducing interval-rigid concept and role names. Elements included in an interval-rigid concept or role name are required to stay in it for some specified amount of time. We investigate several combinations of (metric) temporal logics with A ℒ C by either allowing temporal operators only on the level of axioms or also applying them to concepts. In contrast to most existing work on the topic, we consider a timeline based on the integers and also allow assertional axioms. We show that the worst-case complexity does not increase beyond the previously known bound of 2-E xp S pace and investigate in detail how this complexity can be reduced by restricting the temporal logic and the occurrences of interval-rigid names.}, added-at = {2024-09-10T11:56:37.000+0200}, author = {Baader, Franz and Borgwardt, Stefan and Koopmann, Patrick and Ozaki, Ana and Thost, Veronika}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/26adf08d061eab7f509df06ae0550a9a9/scadsfct}, interhash = {da9fe88519701cd3bf2e6f8754e378a9}, intrahash = {6adf08d061eab7f509df06ae0550a9a9}, journal = {ACM Trans. Comput. Log.}, keywords = {}, language = {en}, month = oct, number = 4, pages = {1--46}, publisher = {Association for Computing Machinery (ACM)}, timestamp = {2024-09-10T15:15:57.000+0200}, title = {Metric temporal description logics with interval-rigid names}, volume = 21, year = 2020 }