Complexity of reasoning over temporal data models
Artale, A. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2010) Complexity of reasoning over temporal data models. In: Parsons, J. and Saeki, M. and Shoval, P. and Woo, C. and Wand, Y. (eds.) Conceptual Modeling – ER 2010. Lecture Notes in Computer Science 6412. Berlin, Germany: Springer, pp. 174-187. ISBN 9783642163722.
Abstract
We investigate the computational complexity of reasoning over temporal extensions of conceptual data models. The temporal conceptual models we analyse include the standard UML/EER constructs, such as isa between entities and relationships, disjointness and covering, cardinality constraints and their refinements, multiplicity and key constraints; in the temporal dimension, we have timestamping, evolution, transition and lifespan cardinality constraints. We give a nearly comprehensive picture of the impact of these constructs on the complexity of reasoning, which can range from NLogSpace to undecidability.
Metadata
Item Type: | Book Section |
---|---|
Additional Information: | 29th International Conference on Conceptual Modeling, Vancouver, BC, Canada, November 1-4, 2010. Proceedings |
School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
Depositing User: | Administrator |
Date Deposited: | 13 May 2013 13:55 |
Last Modified: | 09 Aug 2023 12:33 |
URI: | https://eprints.bbk.ac.uk/id/eprint/6715 |
Statistics
Additional statistics are available via IRStats2.