Towards a Parametric Ontology Modularization Framework Based on Graph Transformation

Keywords: Persistent Naming, Reevaluation, G-Maps, Jerboa,

To check interesting properties of graph transformation systems, two techniques are considered: Invariants, i.e., graph-specific properties, may be formulated in first-order logic..

The advantages of agglomerative algorithms are that we don’t have to know the size and the number of modules and the result of these algorithms depend on the cho- sen

First, Kermeta allows the specification of generic model transformations such as refactorings that we ap- ply to different metamodels including Ecore , Java, and Uml.. Second,

1) Libraries maintenance: Java Libraries continuously evolve by releasing new versions with new functional- ity or enhanced performance. However, in some cases, clients decide not

In this paper, we presented two approaches to predicting, whether alignment statements need to change after an ontology update: a two-step approach that consists of

More precisely, we have theoretical, practical, and socio- technological difficulties such as how to understand the subsumption concept described in RDF Semantics [2] with respect

To decide on the goodness of an ontology modularization approach, we need a set of metrics (evaluation criteria) that can be used to evaluate the cohesion and the coupling of