A conceptual modelling formalism for temporal database applications
Information Systems
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
Unifying temporal data models via a conceptual model
Information Systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modeling time from a conceptual perspective
Proceedings of the seventh international conference on Information and knowledge management
Temporal logic in information systems
Logics for databases and information systems
A survey of temporal extensions of description logics
Annals of Mathematics and Artificial Intelligence
IEEE Transactions on Knowledge and Data Engineering
Temporal Entity-Relationship Models-A Survey
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the Seventh International Conference on Data Engineering
A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Reasoning on Temporal Conceptual Schemas with Dynamic Constraints
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Reasoning on UML class diagrams
Artificial Intelligence
Complexity of reasoning over temporal data models
ER'10 Proceedings of the 29th international conference on Conceptual modeling
| Hi-index | 0.00 |
This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones.