Reasoning on Temporal Conceptual Schemas with Dynamic Constraints Alessandro Artale   View Paper (PDF)   Return to Regular Papers Abstract 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. BIBTEX @inproceedings{DBLP:conf/time/Artale04,    author    = {Alessandro Artale},    title     = {Reasoning on Temporal Conceptual Schemas with Dynamic Constraints.},    booktitle = {TIME},    year      = {2004},    pages     = {79-86},    ee        = {http://csdl.computer.org/comp/proceedings/time/2004/2155/00/21550079abs.htm},    crossref  = {conf/time/2004},    bibsource = {DBLP, http://dblp.uni-trier.de}  }  @proceedings{DBLP:conf/time/2004,    title     = {11th International Symposium on Temporal Representation                 and Reasoning (TIME 2004), 1-3 July 2004, Tatihou Island,                 Normandie, France},    booktitle = {TIME},    publisher = {IEEE Computer Society},    year      = {2004},    isbn      = {0-7695-2155-X},    bibsource = {DBLP, http://dblp.uni-trier.de}  } }, ©2005 Association for Computing Machinery