A Cookbook for Temporal Conceptual Data Modelling with Description Logics
Authors:
- Alessandro ArtaleAAAlessandro Artale
- Roman KontchakovRKRoman Kontchakov
- Vladislav RyzhikovVRVladislav Ryzhikov
- Michael ZakharyaschevMZMichael Zakharyaschev
Preprint
Abstract
We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. In the temporal dimension, they capture future and past temporal operators on concepts, flexible and rigid roles, the operators `always' and `some time' on roles, data assertions for particular moments of time and global concept inclusions. The logics are interpreted over the Cartesian products of object domains and the flow of time (Z,<), satisfying the constant domain assumption. We prove that the most expressive of our temporal description logics (which can capture lifespan cardinalities and either qualitative or quantitative evolution constraints) turn out to be undecidable. However, by omitting some of the temporal operators on concepts/roles or by restricting the form of concept inclusions we obtain logics whose complexity ranges between PSpace and NLogSpace. These positive results were obtained by reduction to various clausal fragments of propositional temporal logic, which opens a way to employ propositional or first-order temporal provers for reasoning about temporal data models.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Unary finite automata vs. arithmetic progressionsInformation Processing Letters, 2009
- Evolving objects in temporal information systemsAnnals of Mathematics and Artificial Intelligence, 2007
- The Complexity of Generalized Satisfiability for Linear Temporal Logic2007
- Past is for free: on the complexity of verifying linear temporal properties with pastActa Informatica, 2004
- Decidable fragments of first-order temporal logicsAnnals of Pure and Applied Logic, 2000
- Time-dependent concepts: representation and reasoning using temporal description logicsData & Knowledge Engineering, 1997
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logicInformation Processing Letters, 1993
- A conceptual modelling formalism for temporal database applicationsInformation Systems, 1991
- A decision procedure for combinations of propositional temporal logic and other specialized theoriesJournal of Automated Reasoning, 1986
- On the size of refutation Kripke models for some linear modal and tense logicsStudia Logica, 1980