We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
The wide scale usage of OWL for the formalization of real-world ontologies is currently influenced by important limitations which concern both its expressivity and the efficiency ...
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...