TY - GEN
T1 - CARE - A Constraint-Based Approach for Re-Establishing Conformance-Relationships
AU - Schönböck, Johannes
AU - Kusel, Angelika
AU - Etzlstorfer, Jürgen
AU - Kapsammer, Elisabeth
AU - Schwinger, Wieland
AU - Wimmer, Manuel
AU - Wischenbart, Martin
PY - 2014
Y1 - 2014
N2 - In Model-Driven Engineering, models have to conform to their associated linguistic and ontological metamodels. While linguistic metamodels are usually not subject to frequent changes, ontological metamodels are. Thus, existing conformance relationships may be easily corrupted by changes on the metamodel or by the incautious modification of models. Current approaches for re-establishing conformance relationships are often (i) deeply woven into specific tools to record changes and to derive resolutions, or (ii) require extensive user effort to guide the resolution process, and (iii) the output of these approaches usually is one single solution, whereas alternative solutions remain unexplored. To allow for exploring a broader solution space independent of specific tools and to avoid extensive user involvement by utilizing
predefined repair actions, we propose a logic programming
approach called CARE, for accomplishing multiple solutions. In particular, CARE bases on a formalization of the ontological conformance relationship as constraints, accompanying repair actions for counteracting constraint violations, as well as quality criteria for ranking of solutions. This paper reports on the realization of CARE based on Answer Set Programming and summarizes lessons learned from applying the approach in several experiments.
AB - In Model-Driven Engineering, models have to conform to their associated linguistic and ontological metamodels. While linguistic metamodels are usually not subject to frequent changes, ontological metamodels are. Thus, existing conformance relationships may be easily corrupted by changes on the metamodel or by the incautious modification of models. Current approaches for re-establishing conformance relationships are often (i) deeply woven into specific tools to record changes and to derive resolutions, or (ii) require extensive user effort to guide the resolution process, and (iii) the output of these approaches usually is one single solution, whereas alternative solutions remain unexplored. To allow for exploring a broader solution space independent of specific tools and to avoid extensive user involvement by utilizing
predefined repair actions, we propose a logic programming
approach called CARE, for accomplishing multiple solutions. In particular, CARE bases on a formalization of the ontological conformance relationship as constraints, accompanying repair actions for counteracting constraint violations, as well as quality criteria for ranking of solutions. This paper reports on the realization of CARE based on Answer Set Programming and summarizes lessons learned from applying the approach in several experiments.
M3 - Conference proceedings
SN - 978-1-921770-36-4
VL - 154
T3 - CRPIT
SP - 19
EP - 28
BT - Proceedings of the 10th Asian-Pacific Conference on Conceptual Modelling (APCCM 2014)
A2 - Grossmann, G. and Saeki, M., null
PB - ACS
ER -