22 citations · 40 across the 4 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2018★ 2 cited
On the Verification of Logically Decorated Graph Transformations
Jon Haël Brenas, Rachid Echahed, Martin Strecker
We address the problem of reasoning on graph transformations featuring actions such as \emph{addition} and \emph{deletion} of nodes and edges, node \emph{merging} and \emph{cloning…
cs.LO2014
SROIQsigma is decidable
Jon Haël Brenas, Rachid Echahed, Martin Strecker
We consider a dynamic extension of the description logic . This means that interpretations could evolve thanks to some actions such as addition and/or deletion of…