BIROn - Birkbeck Institutional Research Online

    Complexity of reasoning over temporal data models

    Artale, A. and Kontchakov, Roman and Ryzhikov, V. 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.

    Full text not available from this repository.

    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 Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 13 May 2013 13:55
    Last Modified: 11 Oct 2016 12:02
    URI: http://eprints.bbk.ac.uk/id/eprint/6715

    Statistics

    Downloads
    Activity Overview
    0Downloads
    128Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item