Nothing Special   »   [go: up one dir, main page]

Skip to main content

Complexity of Reasoning over Temporal Data Models

  • Conference paper
Conceptual Modeling – ER 2010 (ER 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6412))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Artale, A.: Reasoning on temporal class diagrams: Undecidability results. Annals on Mathematics and Artificial Intelligence (AMAI) 46, 265–288 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Artale, A., Calvanese, D., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: Reasoning over extended ER models. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 277–292. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. of Artificial Intelligence Research 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Artale, A., Franconi, E., Mandreoli, F.: Description logics for modelling dynamic information. In: Chomicki, J., van der Meyden, R., Saake, G. (eds.) Logics for Emerging Applications of Databases, pp. 239–275. Springer, Heidelberg (2003)

    Google Scholar 

  5. Artale, A., Franconi, E., Wolter, F., Zakharyaschev, M.: A temporal description logic for reasoning about conceptual schemas and queries. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 98–110. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Artale, A., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: Past and future of DL-Lite. In: Proc. of the 24th AAAI Conf. on Artificial Intelligence, AAAI 2010 (2010)

    Google Scholar 

  7. Artale, A., Parent, C., Spaccapietra, S.: Evolving objects in temporal information systems. Annals of Mathematics and Artificial Intelligence 50(1-2), 5–38 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Artale, A., Toman, D.: Decidable reasoning over timestamped conceptual models. In: Proc. of the 21th Int. Workshop on Description Logics (DL 2008), Dresden, Germany (May 2008)

    Google Scholar 

  9. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  10. Berardi, D., Calvanese, D., De Giacomo, G.: Reasoning on UML class diagrams. Artificial Intelligence 168(1-2), 70–118 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Calvanese, D., Lenzerini, M., Nardi, D.: Unifying class-based representation formalisms. J. of Artificial Intelligence Research 11, 199–240 (1999)

    MathSciNet  MATH  Google Scholar 

  12. Combi, C., Degani, S., Jensen, C.S.: Capturing temporal constraints in temporal ER models. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds.) ER 2008. LNCS, vol. 5231, pp. 397–411. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Etzion, O., Gal, A., Segev, A.: Extended update functionality in temporal databases. In: Temporal Databases — Research and Practice. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Gregersen, H., Jensen, J.S.: Conceptual modeling of time-varying information. Technical Report TimeCenter TR-35, Aalborg University, Denmark (1998)

    Google Scholar 

  15. Gregersen, H., Jensen, J.S.: Temporal Entity-Relationship models — a survey. IEEE Transactions on Knowledge and Data Engineering 11(3), 464–497 (1999)

    Article  Google Scholar 

  16. Gupta, R., Hall, G.: An abstraction mechanism for modeling generation. In: Proc. of the 8th Int. Conf. on Data Engineering (ICDE 1992), pp. 650–658. IEEE Computer Society, Los Alamitos (1992)

    Google Scholar 

  17. Hall, G., Gupta, R.: Modeling transition. In: Proc. of the 7th Int. Conf. on Data Engineering (ICDE 1991), pp. 540–549. IEEE Computer Society, Los Alamitos (1991)

    Google Scholar 

  18. Jensen, C.S., Clifford, J., Gadia, S.K., Hayes, P., Jajodia, S., et al.: The Consensus Glossary of Temporal Database Concepts. In: Temporal Databases — Research and Practice, Springer, Heidelberg (1998)

    Google Scholar 

  19. Jensen, C.S., Snodgrass, R.T.: Temporal data management. IEEE Transactions on Knowledge and Data Engineering 111(1), 36–44 (1999)

    Article  Google Scholar 

  20. Jensen, C.S., Soo, M., Snodgrass, R.T.: Unifying temporal data models via a conceptual model. Information Systems 9(7), 513–547 (1994)

    Article  Google Scholar 

  21. Lutz, C., Wolter, F., Zakharyaschev, M.: Temporal description logics: A survey. In: Proc. of the 15th Int. Symposium on Temporal Representation and Reasoning (TIME 2008), pp. 3–14. IEEE Computer Society, Los Alamitos (2008)

    Chapter  Google Scholar 

  22. Sistla, A., Clarke, E.: The complexity of propositional linear temporal logics. In: Proc. of the 14th Annual ACM Symposium on Theory of Computing, pp. 159–168. ACM, New York (1982)

    Google Scholar 

  23. Spaccapietra, S., Parent, C., Zimanyi, E.: Conceptual Modeling for Traditional and Spatio-Temporal Applications—The MADS Approach. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  24. Tauzovich, B.: Towards temporal extensions to the entity-relationship model. In: Proc. of the 10th Int. Conf. on Conceptual Modeling (ER 1991), pp. 163–179. ER Institute (1991)

    Google Scholar 

  25. Theodoulidis, C., Loucopoulos, P., Wangler, B.: A conceptual modelling formalism for temporal database applications. Information Systems 16(3), 401–416 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Artale, A., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M. (2010). Complexity of Reasoning over Temporal Data Models. In: Parsons, J., Saeki, M., Shoval, P., Woo, C., Wand, Y. (eds) Conceptual Modeling – ER 2010. ER 2010. Lecture Notes in Computer Science, vol 6412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16373-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16373-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16372-2

  • Online ISBN: 978-3-642-16373-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics