Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reasoning on temporal class diagrams: Undecidability results

Reasoning on temporal class diagrams: Undecidability results 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Reasoning on temporal class diagrams: Undecidability results

Download PDF
24 pages

Loading next page...
 
/lp/springer-journals/reasoning-on-temporal-class-diagrams-undecidability-results-DqaJWkOhIh

References (27)

Publisher
Springer Journals
Copyright
Copyright © 2006 by Springer Science+Business Media, Inc.
Subject
Computer Science; Complexity; Computer Science, general ; Mathematics, general; Artificial Intelligence (incl. Robotics)
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-006-9019-0
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Mar 24, 2006

There are no references for this article.