On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
Artificial Intelligence
Reasoning with UML Class Diagrams
WIFT '98 Proceedings of the Second IEEE Workshop on Industrial Strength Formal Specification Techniques
The description logic handbook
Reasoning on UML class diagrams
Artificial Intelligence
Reasoning over extended ER models
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Full satisfiability of UML class diagrams
ER'10 Proceedings of the 29th international conference on Conceptual modeling
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Semantics and reasoning for control application engineering models
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
Semantics enhanced engineering and model reasoning for control application development
Multimedia Tools and Applications
Finite satisfiability of UML class diagrams with constrained class hierarchy
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
| Hi-index | 5.23 |
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This study focuses on the tractable consistency checking of UML class diagrams. We accurately identify inconsistencies in these diagrams by translating them into first-order predicate logic that is generalized by counting quantifiers and classify their expressivities by eliminating certain components. We introduce optimized algorithms that compute the respective consistencies of class diagrams of different expressive powers in P, NP, PSPACE, or EXPTIME with respect to the size of the class diagrams. In particular, owing to the restrictions imposed on attribute value types, the complexities of consistency checking of class diagrams decrease from EXPTIME to P and PSPACE in two cases: (i) when the class diagrams contain disjointness constraints and overwriting/multiple inheritances and (ii) when the class diagrams contain both these components along with completeness constraints. Additionally, we confirm the existence of a restriction of class diagrams that prevents any logical inconsistency.