Deductive entity relationship modeling
Authors:
- G. Di BattistaGBG. Di Battista
- M. LenzeriniMLM. Lenzerini
- 1 June 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 5 (3) , 439-450
Abstract
An entity relationship oriented model, that includes the notion of class, together with different types of assertions on classes, is presented. The assertions are used to model IS-A and disjointness relations both between entities and between relationships, part-of relations between entities and relationships, mandatory participation of an entity in a relationship, and interdependencies between the projections of relationships. The semantics of the model are defined in terms of first-order logic, and a sound and complete inference algorithm for such a model is presented. The algorithm is shown to have polynomial time complexity in the case where interdependencies on the projections of relationships are not taken into account. It is suggested that the model and the associated inference capabilities provide a suitable formal basis for designing an effective environment supporting conceptual modeling.Keywords
This publication has 18 references indexed in Scilit:
- Object-oriented databases: definition and research directionsIEEE Transactions on Knowledge and Data Engineering, 1990
- F-logic: a higher-order language for reasoning about objects, inheritance, and schemeACM SIGMOD Record, 1989
- C-logic of complex objects1989
- Formal properties of net-based knowledge representation schemesData & Knowledge Engineering, 1988
- O2, an object-oriented data model1988
- Semantic database modeling: survey, applications, and research issuesACM Computing Surveys, 1987
- A comparative analysis of methodologies for database schema integrationACM Computing Surveys, 1986
- Set containment inference and syllogismsTheoretical Computer Science, 1986
- The Implication Problem for Functional and Inclusion Dependencies is UndecidableSIAM Journal on Computing, 1985
- Unary inclusion dependencies have polynomial time inference problems1983