Issue No. 03 - June (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.224196
<p>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.</p>
deductive entity relationship modelling; assertions; classes; IS-A; disjointness relations; mandatory participation; interdependencies; semantics; first-order logic; inference algorithm; polynomial time complexity; formal basis; conceptual modeling; computational complexity; deductive databases; entity-relationship modelling; inference mechanisms
G. Di Battista and M. Lenzerini, "Deductive Entity Relationship Modeling," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 439-450, 1993.