A logical design methodology for relational databases using the extended entity-relationship model
ACM Computing Surveys (CSUR)
Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
A comparative analysis of methodologies for database schema integration
ACM Computing Surveys (CSUR)
Database theory—past and future
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
Semantic database modeling: survey, applications, and research issues
ACM Computing Surveys (CSUR)
O2, an object-oriented data model
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Formal properties of net-based knowledge representation schemes
Data & Knowledge Engineering
Set containment inference and syllogisms
Theoretical Computer Science - First International Conference on Database Theory, Rome, September 1986
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A logic for object-oriented logic programming
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Class hierarchies and their complexity
Advances in database programming languages
Object-oriented database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Methodology and Tools for Data Design
Methodology and Tools for Data Design
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Towards a sound view integration methodology
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Object-Oriented Databases: Definition and Research Directions
IEEE Transactions on Knowledge and Data Engineering
Covering and Disjointness Constraints in Type Networks
Proceedings of the Third International Conference on Data Engineering
On the Properties of Extended Inclusion Dependencies
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Unary inclusion dependencies have polynomial time inference problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Making object-oriented schemas more expressive
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Consistency Checking in Complex Object Database Schemata with Integrity Constraints
IEEE Transactions on Knowledge and Data Engineering
Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas
IEEE Transactions on Knowledge and Data Engineering
Structuring Primitives for a Dictionary of Entity Relationship Data Schemas
IEEE Transactions on Software Engineering
The description logic handbook
Managing Uncertainties in Image Databases: A Fuzzy Approach
Multimedia Tools and Applications
Preliminary explorations in specifying and validating entity-relationship models in PVS
Proceedings of the second workshop on Automated formal methods
Modelling protocols for multiagent interaction by F-logic
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Reasoning over extended ER models
ER'07 Proceedings of the 26th international conference on Conceptual modeling
| Hi-index | 0.00 |
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.