Sciweavers

173 search results - page 4 / 35
» Processes for Adhesive Rewriting Systems
Sort
View
CTCS
1997
Springer
15 years 3 months ago
Monads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
Christoph Lüth, Neil Ghani
DAGSTUHL
2006
15 years 1 months ago
Modeling and Simulating Biological Processes with Stochastic Multiset Rewriting
ed Abstract Membrane systems are models of computation inspired by the structure and the function of biological cells. The model was introduced in 1998 by Gh. Paun and since then m...
Matteo Cavaliere, Sean Sedwards
EDBT
2010
ACM
200views Database» more  EDBT 2010»
15 years 6 months ago
Rewrite techniques for performance optimization of schema matching processes
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
Eric Peukert, Henrike Berthold, Erhard Rahm
ICGI
2004
Springer
15 years 5 months ago
Representing Languages by Learnable Rewriting Systems
Rémi Eyraud, Colin de la Higuera, Jean-Chri...
WADT
1997
Springer
15 years 3 months ago
An inductive view of graph transformation
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
Fabio Gadducci, Reiko Heckel