On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
On taxonomic reasoning in conceptual design
ACM Transactions on Database Systems (TODS)
Description logics for conceptual data modeling
Logics for databases and information systems
Description Logics in Data Management
IEEE Transactions on Knowledge and Data Engineering
Describing Database Objects in a Concept Language Environment
IEEE Transactions on Knowledge and Data Engineering
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The description logic handbook
Conceptual modeling with description logics
The description logic handbook
Modeling Languages: Syntax, Semantics and All That Stuff, Part I: The Basic Stuff
Modeling Languages: Syntax, Semantics and All That Stuff, Part I: The Basic Stuff
Decidable reasoning in terminological knowledge representation systems
Journal of Artificial Intelligence Research
Reasoning on UML class diagrams
Artificial Intelligence
On the complexities of consistency checking for restricted UML class diagrams
Theoretical Computer Science
The DL-lite family and relations
Journal of Artificial Intelligence Research
Reasoning over extended ER models
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Consistency checking algorithms for restricted UML class diagrams
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Foundations of the unified modeling language
2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
OCL-Lite: Finite reasoning on UML/OCL conceptual schemas
Data & Knowledge Engineering
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
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 | 0.00 |
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expressed by UCDs one can exploit automated reasoning tools to detect relevant properties, such as schema and class satisfiability and subsumption between classes. Among the reasoning tasks of interest, the basic one is detecting full satisfiability of a diagram, i.e., whether there exists an instantiation of the diagram where all classes and associations of the diagram are non-empty and all the constraints of the diagram are respected. In this paper we establish tight complexity results for full satisfiability for various fragments of UML class diagrams. This investigation shows that the full satisfiability problem is ExpTime-complete in the full scenario, NP-complete if we drop isa between relationships, and NLogSpace-complete if we further drop covering over classes.