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
UML Distilled: A Brief Guide to the Standard Object Modeling Language
UML Distilled: A Brief Guide to the Standard Object Modeling Language
The description logic handbook
Reasoning on UML class diagrams
Artificial Intelligence
Logical aspects of events: quantification, sorts, composition and disjointness
AOW '05 Proceedings of the 2005 Australasian Ontology Workshop - Volume 58
Decidable Reasoning in UML Schemas with Constraints
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Scalable satisfiability checking and test data generation from modeling diagrams
Automated Software Engineering
ECMDA-FA'07 Proceedings of the 3rd European conference on Model driven architecture-foundations and applications
Towards Class Diagram Algebra for Composing Data Models
Proceedings of the 2010 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the 9th SoMeT_10
Full satisfiability of UML class diagrams
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Towards hybrid reasoning for verifying and validating multilevel models
EKAW'10 Proceedings of the 17th international conference on Knowledge engineering and management by the masses
Verifying and validating multi-layered models with OWL FA toolkit
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
| Hi-index | 0.00 |
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This paper focuses on tractable consistency checking of UML class diagrams. We accurately identify inconsistencies in these diagrams by translating them into first-order predicate logic generalized by counting quantifiers and classify their expressivities by eliminating some components. For class diagrams of different expressive powers, we introduce optimized algorithms that compute their respective consistencies in P, NP, PSPACE, or EXPTIME with respect to the size of a class diagram. In particular, for two cases in which class diagrams contain (i) disjointness constraints and overwriting/multiple inheritances and (ii) these components along with completeness constraints, the restriction of attribute value types decreases the complexities from EXPTIME to P and PSPACE. Additionally, we confirm the existence of a meaningful restriction of class diagrams that prevents any logical inconsistency.