Sciweavers

35 search results - page 3 / 7
» Contextual hyperedge replacement
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
13 years 6 months ago
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform ...
Ivan Lanese, Ugo Montanari
ECEASST
2010
13 years 3 months ago
Conditional Adaptive Star Grammars
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
Berthold Hoffmann
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 10 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
JETAI
2007
111views more  JETAI 2007»
13 years 5 months ago
Contextual vocabulary acquisition as computational philosophy and as philosophical computation
Contextual vocabulary acquisition (CVA) is the active, deliberate acquisition of a meaning for an unknown word in a text by reasoning from textual clues, prior knowledge, and hypo...
William J. Rapaport, Michael W. Kibby
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 6 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil