BIROn - Birkbeck Institutional Research Online

    Complexity of reasoning in entity relationship models

    Artale, A. and Calvanese, D. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, M. (2007) Complexity of reasoning in entity relationship models. In: Calvanese, D. and Franconi, E. and Haarslev, V. and Lembo, D. and Motik, B. and Turhan, A.-Y. and Tessaris, S. (eds.) Proceedings of the 2007 International Workshop on Description Logics. CEUR Workshop Proceedings 250. CEUR Workshop Proceedings.

    Full text not available from this repository.


    We investigate the complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which include different combinations of the constructors for isa between concepts and relationships, disjointness, covering, cardinality constraints and their refinement. Specifically, we show that reasoning over EER diagrams with isa between relationships is ExpTime-complete even when we drop both covering and disjointness for relationships. Surprisingly, when we also drop isa between relations, reasoning becomes NP-complete. If we further remove the possibility to express covering between entities, reasoning becomes polynomial. Our lower bound results are established by direct reductions, while the upper bounds follow from correspondences with expressive variants of the description logic DL-Lite. The established correspondence shows also the usefulness of DL-Lite as a language for reasoning over conceptual models and ontologies.


    Item Type: Book Section
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Sarah Hall
    Date Deposited: 11 May 2021 12:22
    Last Modified: 09 Aug 2023 12:50


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item