Sciweavers

2189 search results - page 211 / 438
» A Graded Applicability of Rules
Sort
View
GG
2008
Springer
13 years 10 months ago
Adaptive Star Grammars for Graph Models
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Frank Drewes, Berthold Hoffmann, Mark Minas
ADVCS
2007
108views more  ADVCS 2007»
13 years 9 months ago
Open Synchronous Cellular Learning Automata
Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and als...
Hamid Beigy, Mohammad Reza Meybodi
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 9 months ago
Matrix Graph Grammars
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Pedro Pablo Pérez Velasco
ENTCS
2008
96views more  ENTCS 2008»
13 years 9 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
JOT
2007
193views more  JOT 2007»
13 years 9 months ago
Applying Triple Graph Grammars For Pattern-Based Workflow Model Transformations
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable busines...
Carsten Lohmann, Joel Greenyer, Juanjuan Jiang, Ta...