Reasoning on temporal class diagrams: Undecidability results
Annals of Mathematics and Artificial Intelligence
Evolving objects in temporal information systems
Annals of Mathematics and Artificial Intelligence
Foundations of Temporal Conceptual Data Models
Conceptual Modeling: Foundations and Applications
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modeling the evolution of objects in temporal information systems
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
This paper formally clarifies the relevant reasoning problems for temporal EER diagrams. We distinguish between the following reasoning services: (a) Entity, relationship and schema satisfiability; (b) Liveness and global satisfiability for both entities and relationships; (c) Subsumption for either entities or relationships; (d) Logical implication between schemas. We then show that reasoning on temporal models is an undecidable problem as soon as the schema language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between entities.