Skip to main content

Reasoning over Extended ER Models

  • Conference paper
Conceptual Modeling - ER 2007 (ER 2007)

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

Included in the following conference series:

Abstract

We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs: isa between entities and relationships, disjointness and covering of entities and relationships, cardinality constraints for entities in relationships and their refinements as well as multiplicity constraints for attributes. We extend the known ExpTime-completeness result for UML class diagrams [5] and show that reasoning over EER diagrams with isa between relationships is ExpTime-complete even without relationship covering. Surprisingly, reasoning becomes NP-complete when we drop isa between relationships (while still allowing all types of constraints on entities). If we further omit disjointness and covering over entities, reasoning becomes polynomial. Our lower complexity bound results are proved by direct reductions, while the upper bounds follow from the correspondences with expressive variants of the description logic DL-Lite, which we establish in this paper. These correspondences also show the usefulness of DL-Lite as a language for reasoning over conceptual models and ontologies.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: DL-Lite in the light of first-order logic. In: Proc. of the 22nd Nat.Conf. on Artificial Intelligence (AAAI 2007) (2007)

    Google Scholar 

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

    MATH  Google Scholar 

  3. Batini, C., Ceri, S., Navathe, S.B.: Conceptual Database Design, an Entity-Relationship Approach. Benjamin and Cummings Publ. Co. (1992)

    Google Scholar 

  4. Bechhofer, S., van Harmelen, F., Hendler, J., Horrocks, I., McGuinness, D.L., Patel-Schneider, P.F., Stein, L.A.: OWL Web Ontology Language reference. W3C Recommendation, Available at (February 2004), http://www.w3.org/TR/owl-ref/

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  7. Calvanese, G.D., Giacomo, D.: Expressive description logics. In: Baader. F., et al. (eds.) [2], ch.5, pp. 178–218 (2003)

    Google Scholar 

  8. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), pp. 602–607 (2005)

    Google Scholar 

  9. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260–270 (2006)

    Google Scholar 

  10. Calvanese, D., Lenzerini, M.: On the interaction between ISA and cardinality constraints. In: Proc. of the 10th IEEE Int. Conf. on Data Engineering (ICDE’94), pp. 204–213. IEEE Computer Society Press, Los Alamitos (1994)

    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. Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford Logic Guides 35 (1997)

    Google Scholar 

  13. Di Battista, G., Lenzerini, M.: Deductive entity-relationship modeling. IEEE Trans. on Knowledge and Data Engineering 5(3), 439–450 (1993)

    Article  Google Scholar 

  14. ElMasri, R.A., Navathe, S.B.: Fundamentals of Database Systems, 5th edn. Addison Wesley Publ.Co. (2007)

    Google Scholar 

  15. Kozen, D.: Theory of Computation. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  16. Lenzerini, M., Nobili, P.: On the satisfiability of dependency constraints in entity-relationship schemata. Information Systems 15(4), 453–461 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christine Parent Klaus-Dieter Schewe Veda C. Storey Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Artale, A., Calvanese, D., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M. (2007). Reasoning over Extended ER Models. In: Parent, C., Schewe, KD., Storey, V.C., Thalheim, B. (eds) Conceptual Modeling - ER 2007. ER 2007. Lecture Notes in Computer Science, vol 4801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75563-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75563-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75562-3

  • Online ISBN: 978-3-540-75563-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics