Checking Full Satisfiability of Conceptual Models

Abstract. 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.

• Type: Journal
• Year: 2010
• Where: DLOG
• Authors: Alessandro Artale, Diego Calvanese, Yazmin Angélica Ibáñez-García
• Keywords: Automated Reasoning, De-facto Standard Formalism, DLOG 2010, Satisfiability, UML Class