Consistency Checking Algorithms for Restricted UML Class Diagrams

Kaneiwa, Ken; Satoh, Ken

doi:10.1007/11663881_13

Cited by 25 publications

(19 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concerning unification by means of a single formalisation in a chosen logic, there are separate formalizations, which can be seen as prerequisites, and partial unifications, e.g., [1,5,9,19,22,23,27,32]. Their approach is, mainly, to choose a logic and show it fits sufficiently with one of the CDM languages, and perhaps due to this, different logics are used for different CDM languages, therewith still not providing the sought-after interoperability for either of the languages or among each other.…”

Section: Related Workmentioning

confidence: 99%

Toward an Ontology-Driven Unifying Metamodel for UML Class Diagrams, EER, and ORM2

Keet

Fillottrani

2013

Conceptual Modeling

View full text Add to dashboard Cite

Abstract. Software compatibility and application integration can be achieved using their respective conceptual data models. However, each model may be represented in a different language. While such languages seem similar yet known to be distinct, no unifying framework exists that respects all of their language features. Aiming toward filling this gap, we designed a common, ontology-driven, metamodel of the static, structural, components of ER, EER, UML v2.4.1, ORM, and ORM2, such that each is a fragment of the encompassing consistent metamodel. This paper presents and overview and notable insights obtained on the real common core entities and constraints, roles and relationships, and attributes and value types that we refine with the notion of dimensional attribute.

show abstract

Section: Related Workmentioning

confidence: 99%

Toward an Ontology-Driven Unifying Metamodel for UML Class Diagrams, EER, and ORM2

Keet

Fillottrani

2013

Conceptual Modeling

View full text Add to dashboard Cite

show abstract

“…Third, we can check whether there is a model of an UML diagram that satisfies all classes and all relationships in a diagram. This last notion of satisfiability, referred here as full satisfiability and introduced in [8,9] is thus stronger than diagram satisfiability, since a model of a diagram that satisfies all classes is, by definition, also a model of that diagram. We now address the complexity of full satisfiability for UCDs with the standard set of constructs, i.e., UCD full .…”

Section: Full Satisfiability Of Uml Class Diagramsmentioning

confidence: 99%

“…Thus, one can in principle reason on UCDs. The reasoning tasks that one is interested in are, e.g., subsumption between two classes, i.e., the fact that each instance of one class is necessarily also an instance of another class, satisfiability of a specific class (or association) in the diagram, i.e., the fact that the information encoding that class (or association) in the diagram is not contradictory, diagram satisfiability, which requires that at least one class in the diagram is satisfiable, and full satisfiability of the diagram [8,9], i.e., the fact that there exists an instantiation of the diagram where all classes and associations of the diagram are non-empty.…”

Section: Introductionmentioning

confidence: 99%

“…The only works that addressed explicitly the complexity of full satisfiability of UCDs are [8,9], which include a classification of UCDs based on inconsistency triggers. Each inconsistency trigger is a pattern for recognizing possible inconsistencies of the diagram based on the interaction between different modelling constraints.…”

Section: Introductionmentioning

confidence: 99%

“…Each inconsistency trigger is a pattern for recognizing possible inconsistencies of the diagram based on the interaction between different modelling constraints. [8,9] introduce various algorithms for checking full satisfiability of UCDs with different expressive power, together with an analysis of their computational complexity (i.e., upper bounds are provided). In particular, checking full satisfiability in the following scenarios is showed to be in:…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Full Satisfiability of UML Class Diagrams

Artale

Calvanese

Ibáñez-García

2010

Conceptual Modeling – ER 2010

View full text Add to dashboard Cite

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

show abstract

Evidence-Based Languages for Conceptual Data Modelling Profiles

Fillottrani

Keet

2015

Advances in Databases and Information Systems

View full text Add to dashboard Cite

Multiple logic-based reconstruction of conceptual data modelling languages such as EER, UML Class Diagrams, and ORM exists. They mainly cover various fragments of the languages and none are formalised such that the logic applies simultaneously for all three modelling language families as unifying mechanism. This hampers interchangeability, interoperability, and tooling support. In addition, due to the lack of a systematic design process of the logic used for the formalisation, hidden choices permeate the formalisations that have rendered them incompatible.We aim to address these problems, first, by structuring the logic design process in a methodological way. We generalise and extend the DSL design process to apply to logic language design more generally and, in particular, by incorporating an ontological analysis of language features in the process. Second, availing of this extended process, of evidence gathered of language feature usage, and of computational complexity insights from Description Logics (DL), we specify logic profiles taking into account the ontological commitments embedded in the languages. The profiles characterise the minimum logic structure needed to handle the semantics of conceptual models, enabling the development of interoperability tools. There is no known DL language that matches exactly the features of those profiles and the common core is small (in the tractable ALN I). Although hardly any inconsistencies can be derived with the profiles, it is promising for scalable runtime use of conceptual data models.

show abstract

Consistency Checking Algorithms for Restricted UML Class Diagrams

Cited by 25 publications

References 4 publications

Toward an Ontology-Driven Unifying Metamodel for UML Class Diagrams, EER, and ORM2

Toward an Ontology-Driven Unifying Metamodel for UML Class Diagrams, EER, and ORM2

Full Satisfiability of UML Class Diagrams

Evidence-Based Languages for Conceptual Data Modelling Profiles

Contact Info

Product

Resources

About