Attributive concept descriptions with complements
Artificial Intelligence
Journal of the ACM (JACM)
Modal logic
A survey of temporal extensions of description logics
Annals of Mathematics and Artificial Intelligence
Combining Terminological Logics with Tense Logic
EPIA '93 Proceedings of the 6th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A NExpTime-Complete Description Logic Strictly Contained in C2
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Temporalising Tractable Description Logics
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Complexity of solvable cases of the decision problem for the predicate calculus
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Temporal Description Logics: A Survey
TIME '08 Proceedings of the 2008 15th International Symposium on Temporal Representation and Reasoning
A temporal description logic for reasoning about actions and plans
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Interval-based temporal reasoning with general TBoxes
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Runtime verification using a temporal description logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
A temporal terminological logic
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Description logic knowledge and action bases
Journal of Artificial Intelligence Research
Temporalizing ontology-based data access
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Verification and synthesis in description logic based dynamic systems
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Temporal description logic for ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Most of the research on temporalized Description Logics (DLs) has concentrated on the case where temporal operators can be applied to concepts, and sometimes additionally to TBox axioms and ABox assertions. The aim of this article is to study temporalized DLs where temporal operators on TBox axioms and ABox assertions are available, but temporal operators on concepts are not. While the main application of existing temporalized DLs is the representation of conceptual models that explicitly incorporate temporal aspects, the family of DLs studied in this article addresses applications that focus on the temporal evolution of data and of ontologies. Our results show that disallowing temporal operators on concepts can significantly decrease the complexity of reasoning. In particular, reasoning with rigid roles (whose interpretation does not change over time) is typically undecidable without such a syntactic restriction, whereas our logics are decidable in elementary time even in the presence of rigid roles. We analyze the effects on computational complexity of dropping rigid roles, dropping rigid concepts, replacing temporal TBoxes with global ones, and restricting the set of available temporal operators. In this way, we obtain a novel family of temporalized DLs whose complexity ranges from 2- ExpTime-complete via NExpTime-complete to ExpTime-complete.